{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D25","name":"ADR Conformance","shortDescription":{"text":"ADR Conformance"},"helpUri":"https://codehealth.canine.dev/dimensions/D25"},{"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":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02: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":"D40","name":"Network Egress Confinement","shortDescription":{"text":"Network Egress Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D40"},{"id":"D41","name":"Kernel \u0026 Syscall Confinement","shortDescription":{"text":"Kernel \u0026 Syscall Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D41"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C1","name":"Data Protection","shortDescription":{"text":"Data Protection"},"helpUri":"https://codehealth.canine.dev/dimensions/C1"},{"id":"C4","name":"Data Retention","shortDescription":{"text":"Data Retention"},"helpUri":"https://codehealth.canine.dev/dimensions/C4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"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":"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Cryptographic Hygiene","shortDescription":{"text":"Cryptographic Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"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":"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":"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":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"FontInfo::std14_width (cyclomatic 462): FontInfo::std14_width has cyclomatic complexity 462 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":3405}}}],"partialFingerprints":{"codehealthFindingId/v1":"473acc410ff3fdad251b45119907da42500b939197303406bbd97622d14d4f77"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::extract_mixed_ocr_native_with_layout_inputs (cyclomatic 287): xberg::extractors::pdf::ocr::pipeline::extract_mixed_ocr_native_with_layout_inputs has cyclomatic complexity 287 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d19361b71f0513e484e1827200712e039eaf69da5a4ffe4618ea7be9d00060"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::extract_with_ocr_for_page (cyclomatic 265): xberg::extractors::pdf::ocr::pipeline::extract_with_ocr_for_page has cyclomatic complexity 265 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":5138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa8e4d2fec0268cf919cf0c395cfcaaffd9e27d9b5f73d2fff9f9ad26a60438"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownExtractor::build_internal_document_with_jsx (cyclomatic 254): MarkdownExtractor::build_internal_document_with_jsx has cyclomatic complexity 254 (threshold 15). Of this number, 253 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":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51ef19fafb2283ec23904edab345b307de30047da7178d6234328fe38665762"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::fonts::font_dict::standard_encoding_lookup (cyclomatic 221): xberg_native_pdf::fonts::font_dict::standard_encoding_lookup has cyclomatic complexity 221 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":6186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79737bb63be0cc6b1eb0e61843a048eb9ebc80faf22cf2463f8e4f93facbc70"}},{"ruleId":"D1","level":"warning","message":{"text":"DjotExtractor::build_internal_document (cyclomatic 190): DjotExtractor::build_internal_document has cyclomatic complexity 190 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cb20e133992007f14d30238e3c01ba30a22ba24b86cc8c5a9950603d38316e"}},{"ruleId":"D1","level":"warning","message":{"text":"DocxParser::parse_body_elements (cyclomatic 185): DocxParser::parse_body_elements has cyclomatic complexity 185 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8bf157c6dd66311234617b593797ca70717cafe3bac728b8d1090f98d9bd66"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::execute_operators_with_backdrop (cyclomatic 183): PageRenderer::execute_operators_with_backdrop has cyclomatic complexity 183 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1ffa1508de1d41c705f0a3bb0c41d00d796afb9c8a94ce1e985ae541091f45"}},{"ruleId":"D1","level":"warning","message":{"text":"RstExtractor::build_internal_document_within (cyclomatic 182): RstExtractor::build_internal_document_within has cyclomatic complexity 182 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67490b23dec74bb3fb7873b6f4fa6d2848b45f4345a06ebf03678a54fc09f85"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfExtractor::extract_core_native_with_layout_pages (cyclomatic 166): PdfExtractor::extract_core_native_with_layout_pages has cyclomatic complexity 166 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"2213fa45e38c23993c96ceb971fae49a51533e41e43c86858982d26a6e0ade9f"}},{"ruleId":"D1","level":"warning","message":{"text":"OrgModeExtractor::build_internal_document (cyclomatic 116): OrgModeExtractor::build_internal_document has cyclomatic complexity 116 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"536fa182fc1da9c51f474847af782e11cc4d10142fa049f82c673e8862fdf14b"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::execute_operator_with_paint_restarts (cyclomatic 113): TextExtractor::execute_operator_with_paint_restarts has cyclomatic complexity 113 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/operators.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e552dd10177206d5b30f2dea9a0cb57edc3bee4b1c6db4ec3303f0309882dc28"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::jats::elements::extract_jats_all_in_one (cyclomatic 111): xberg::extractors::jats::elements::extract_jats_all_in_one has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5498eb41ab66f1aa55543632e4c6ff289d83045f13490edc98ec0fb4c4bc5156"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::post_process_table_inner (cyclomatic 110): xberg::pdf::table_reconstruct::post_process_table_inner has cyclomatic complexity 110 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"699a43ec9a09f1b564ef29e0cfb16253eaabddc9228692b55db48068c1171534"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::assemble_text_from_spans (cyclomatic 107): PdfDocument::assemble_text_from_spans has cyclomatic complexity 107 (threshold 15). Of this number, 97 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/text_assembly.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc097d0d4467f70fedd5ef48c5be2f8f422654636e8c3ad4632e5d7281bfb8a"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::execute_separation_operators (cyclomatic 101): xberg_native_pdf::rendering::separation_renderer::execute_separation_operators 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":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b2d3905ae670f4df6b6db38efdf720556256c6e0fb58c4874298bcb4fd11fa"}},{"ruleId":"D1","level":"warning","message":{"text":"FontInfo::char_to_unicode_uncached (cyclomatic 99): FontInfo::char_to_unicode_uncached has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent 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: FontInfo::gid_to_standard_glyph_name (cyclomatic 219) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":4376}}}],"partialFingerprints":{"codehealthFindingId/v1":"479f01f9c1277aab02ab57a13742251cdbb6693cc311eda4d5c9993843c703fd"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::ocr::processor::execution::perform_ocr (cyclomatic 96): xberg::ocr::processor::execution::perform_ocr has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3c5604d6b6ff4e42a40f1474dddb47a2953cab71ed4dab1b71cb7177809768"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::build_comrak_ast_with_table_mode (cyclomatic 91): xberg::rendering::comrak_bridge::build_comrak_ast_with_table_mode has cyclomatic complexity 91 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5768ce6da48a867caa8ebd8abb8e2bdd6d55f4456f7040ab3be71e4ecf97edc0"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::jats::build_jats_internal_document (cyclomatic 86): xberg::extractors::jats::build_jats_internal_document has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f2e92542f09395dbf9a0fbbddcf5764ccbf77867f039c4cb3d50524a278270"}},{"ruleId":"D1","level":"warning","message":{"text":"TypstExtractor::build_internal_document (cyclomatic 85): TypstExtractor::build_internal_document has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc683ecd5048ec64fb984ddf4c7511647bac80e665a52bb02725d4e8b66b4643"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::functions::execute (cyclomatic 83): xberg_native_pdf::functions::execute has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/functions/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c0379ed44fa74e2e5b073ccd8df92e367f13162d9c04446205fd76a7b6c15b"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docbook::parse_docbook_single_pass (cyclomatic 81): xberg::extractors::docbook::parse_docbook_single_pass has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a237302fa6a6b6820dbd9224b3ba66b2cd01b15723ab2bceb594ab117f5a2090"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docx::build_internal_document (cyclomatic 81): xberg::extractors::docx::build_internal_document has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"effa0c324d2ec71363da8ca6932920dfe94912ed4a24bc02fe7e209d7590a874"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::build_document_structure_with_native (cyclomatic 80): xberg::pdf::structure::pipeline::build_document_structure_with_native has cyclomatic complexity 80 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"4189fc75b944e979943864dc124c6ef798c4c762571ac4536b4012f30e535fe4"}},{"ruleId":"D1","level":"warning","message":{"text":"FictionBookExtractor::extract_metadata (cyclomatic 67): FictionBookExtractor::extract_metadata has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b5473125ef3b93eb5e118c821cf19976462e3194ff88ea81b68dd544264ee"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::rendering::djot::render_djot (cyclomatic 67): xberg::rendering::djot::render_djot has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19c018244fd2395af563641f82216a4a5ff6ddde481ff2eec6b47291273e545"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::process_form_xobject_paths (cyclomatic 67): PdfDocument::process_form_xobject_paths has cyclomatic complexity 67 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3edd8516cccc953e18a2d9b0dc2ac9892c24f7be46188f4a917d56484ac3c9"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docbook::build_docbook_internal_document (cyclomatic 66): xberg::extractors::docbook::build_docbook_internal_document has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e6bf117f71dc544e18f17b7c8985ba1a3fbc5f5602e31a54e036553c75b9b5"}},{"ruleId":"D1","level":"warning","message":{"text":"EpubExtractor::build_internal_document (cyclomatic 65): EpubExtractor::build_internal_document has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"802b843e979ff16561247eadee7572fa0b08490c524ac178ea856b1048b7aca8"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::classify::classify_paragraphs (cyclomatic 64): xberg::pdf::structure::classify::classify_paragraphs has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4088163dd43f930fdcc00959a2a62cb8fba1ef423bdfc474bd3365d4d7fa4b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_content_stream_paths_only (cyclomatic 64): xberg_native_pdf::content::parser::parse_content_stream_paths_only has cyclomatic complexity 64 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e826d6339d5a729084c7b3bac9cccea68548104f435a089dee30c0c8ef71e731"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::extraction::extract_all_from_native_document (cyclomatic 62): xberg::extractors::pdf::extraction::extract_all_from_native_document has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"052c8d1e8e9769b1eb361f5ad255cd86e2b1064db4ecb0578792852fd5cc179e"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::jats::parser::extract_citation_text (cyclomatic 60): xberg::extractors::jats::parser::extract_citation_text has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/parser.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd144d207500a3e85acd7f3964d7ad72453e1037c5eb5e7392bf6445db0fbfe"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::merge_adjacent_spans (cyclomatic 60): TextExtractor::merge_adjacent_spans has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_merging.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbcf66c6b6718643d66a98243c3c64fefb91a533b645832b4f11afd06a80da8"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::process_xobject (cyclomatic 60): TextExtractor::process_xobject has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/xobjects.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d55a6268632561a862f3444a01c1b15318d420dc5ee89355978dd8f59340fc"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::render_image (cyclomatic 60): PageRenderer::render_image has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f917e3fd632c8ba0a8c161b28473762c22f86bee6b0b10539529679830b7fa16"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::latex::commands::process_command (cyclomatic 59): xberg::extractors::latex::commands::process_command has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/commands.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b980a911f0f58f9d5fbebd53a5d442ab0509b6478a99b36f5f6791396b2cda"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::forward_scan_ctm (cyclomatic 58): xberg_native_pdf::content::parser::forward_scan_ctm has cyclomatic complexity 58 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b661dd15c8085fa84db691ef05a35a1fcf4b437804fe2415eecd8e7ff3c1e7f"}},{"ruleId":"D1","level":"warning","message":{"text":"RstExtractor::extract_text_from_rst (cyclomatic 57): RstExtractor::extract_text_from_rst 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":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b1870f20f946f114148d31a0030419fd800141a43b2c05bd07da7d9ddff9ad"}},{"ruleId":"D1","level":"warning","message":{"text":"TextRasterizer::render_unicode_text (cyclomatic 56): TextRasterizer::render_unicode_text has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"55348298727207c8e96286bdfee4d487a2e6eb8c242247a8e0131ebf434a0df9"}},{"ruleId":"D1","level":"warning","message":{"text":"FictionBookExtractor::build_internal_document (cyclomatic 54): FictionBookExtractor::build_internal_document has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ee63a08087d7d5034142d42af314772e8190b0c1798582e1fd40269e1fbad0"}},{"ruleId":"D1","level":"warning","message":{"text":"DocxExtractor::extract_content (cyclomatic 53): DocxExtractor::extract_content has cyclomatic complexity 53 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"053ff9507c2d994f7606412d6349b9a76482402b806a7b2d34f6d1fbb44e2823"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docbook::extract_para_with_annotations (cyclomatic 52): xberg::extractors::docbook::extract_para_with_annotations has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf849e620cc54a73eeedddeb12e9a39e832ffbb784ee03fb4376337b5d279977"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::ocr::hocr_parser::parse_paragraph (cyclomatic 52): xberg::ocr::hocr_parser::parse_paragraph has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"d858650a86b32c02109d4529a49d1ba03a8f01843de6fa4d6f19ac081360189b"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::extractors::text::should_insert_space (cyclomatic 52): xberg_native_pdf::extractors::text::should_insert_space has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6428dc7d8277344c7bae7ced6ff555e427f9c12479a2d3d0442952b49a53a54"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_widget_spans (cyclomatic 51): PdfDocument::extract_widget_spans 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":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e263fac7d9c2683af4b06652377b95127b34fd20583146355cfaf37384df0d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::topological_block_order (cyclomatic 51): PdfDocument::topological_block_order has cyclomatic complexity 51 (threshold 15). Of this number, 50 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"3971f7c117a6e9cec87c58d94abaf5a3cfe4d0da1738377142c390fba4314ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"LatexExtractor::build_internal_document (cyclomatic 49): LatexExtractor::build_internal_document 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":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"6709390200c4ae15b8c170f47430a7d171ef0a162aa87c66cd673345933b1e7d"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_paths (cyclomatic 48): PdfDocument::extract_paths has cyclomatic complexity 48 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"595acaccf8d7bc94bf5567773427c76c1e3df982f753c033617467107170634d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::odt::build_internal_elements (cyclomatic 46): xberg::extractors::odt::build_internal_elements 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":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"582a367395e54040ea9e11f60ae41d4aa40fd405977da199207f12e6aacd3b42"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_text_operator_fast (cyclomatic 46): xberg_native_pdf::content::parser::parse_text_operator_fast 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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87421077d6e0fd7d06cae5f0b7f165c9130be087888a9559efbf12fe6388f95"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::blocks_to_paragraphs (cyclomatic 45): xberg::pdf::structure::pipeline::blocks_to_paragraphs has cyclomatic complexity 45 (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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3130684b9f029af604f004f0efa6e91ee416ba4a13f072c894a24906a1fb7e1"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::append_advance_buffer (cyclomatic 45): TextExtractor::append_advance_buffer has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5789cae1271ff54ae0a5970314bbaba5c216af9dc3d257c02a27f6b7796e80ad"}},{"ruleId":"D1","level":"warning","message":{"text":"FontInfo::from_dict (cyclomatic 44): FontInfo::from_dict 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. This is NOT this file\u0027s highest cyclomatic complexity: FontInfo::gid_to_standard_glyph_name (cyclomatic 219) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bac0c689e8f4bc14db3f42adcd2cefdb4f37a270594a3d051e753c2d137df7b"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docbook::extract_element_text_with_inline (cyclomatic 43): xberg::extractors::docbook::extract_element_text_with_inline 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":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f60853a39da3856910dc2f657ac29a13a0c23530295e106ff4abcf0d2a9791a"}},{"ruleId":"D1","level":"warning","message":{"text":"XfaParser::parse_template (cyclomatic 43): XfaParser::parse_template 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":"crates/xberg-native-pdf/src/xfa/parser.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c421b803f17cb884435bcbd91d5f8a9a59a0f645774c3d1c9e142790479ca92"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::ppt::extract_texts_from_records (cyclomatic 42): xberg::extraction::ppt::extract_texts_from_records has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b7e48aefd709435295fa5cdfd38ba759352d85f689eadf8f1bfc46bf88548b"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::fill_with_tiling_pattern (cyclomatic 41): PageRenderer::fill_with_tiling_pattern has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4701}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53042c420dae93498df8aab4d5b2bf2c595ed3f3e198a0e10a1853619f2db2f"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::scan_graphics_region (cyclomatic 41): xberg_native_pdf::content::parser::scan_graphics_region 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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":4367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3f19039d40903032771d4ec643cd8e9be8680175c9a414ac569d8d1c0e6257"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::extractors::images::extract_image_from_xobject (cyclomatic 41): xberg_native_pdf::extractors::images::extract_image_from_xobject 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":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd569eb5181b8045c8c4e523a8297784cba405f9c96a387ac8f8be507b7bfe77"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_cli::main (cyclomatic 40): xberg_cli::main has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/main.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"5639751365ec9f46e23affb28db38ec2d1166c234d7d7cb6860ce1d99995b606"}},{"ruleId":"D1","level":"warning","message":{"text":"RstExtractor::parse_inline_markup (cyclomatic 39): RstExtractor::parse_inline_markup has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab48b835e6401ad76e1340d95d8b4eb783b6caf327ee7f7bae858b4a9ca64528"}},{"ruleId":"D1","level":"warning","message":{"text":"RtfExtractor::build_internal_document (cyclomatic 39): RtfExtractor::build_internal_document has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe22742f670debea306e5d05f2c0b7ae9abb817ed70184f6b7d0e9b2318d2163"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::core::pipeline::run_pipeline_impl (cyclomatic 39): xberg::core::pipeline::run_pipeline_impl has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"292de444d3458a730919fbc93af72d16e2e6dd0186d9acedf81ba84967e84fed"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_page_tables (cyclomatic 39): PdfDocument::extract_page_tables has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1e0ea575e1f7dc38b6e67cfbf57bb868e5f33e85386bbeb1b5d54539bbd05a"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::is_well_formed_table_core (cyclomatic 38): xberg::pdf::table_reconstruct::is_well_formed_table_core 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":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"faba6f8d16212aec316ff62d9f1bf14eec45844553b552ae1b71a6f664a257c1"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::append_non_widget_annotation_text (cyclomatic 38): PdfDocument::append_non_widget_annotation_text 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":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"13af2cbc8bbcc8a1673b87c6769e112b5f3cc406cc45335e0d6ca0fa5c7d5283"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::merge_sub_superscript_spans (cyclomatic 38): PdfDocument::merge_sub_superscript_spans 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. This is NOT this file\u0027s highest cyclomatic complexity: PdfDocument::normalize_arabic_presentation_forms (cyclomatic 57) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"403e121c08a7612b1911519fa715c0ab8cbf1eae38addeece405c179ad0c98cf"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::append_and_advance (cyclomatic 38): TextExtractor::append_and_advance 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":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b58ea9b4061244c79e6aa3cd9159b5f361605bb6f6b93e0b48c420737981d4"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractionConfig::with_file_overrides (cyclomatic 37): ExtractionConfig::with_file_overrides has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d822da176d210253ce49359ba957304954e454670e0690fd1e5f5384dfe535c"}},{"ruleId":"D1","level":"warning","message":{"text":"TypstParser::extract_content (cyclomatic 37): TypstParser::extract_content has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f309decafda23d5f1ee8e4a2bae794cdeae1bb38a88eb0fbf19639c48f79ea8"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::read_uncompressed_object (cyclomatic 37): PdfDocument::read_uncompressed_object has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d3be1a5e292ea561e14f8e11478049cd0cb38db0e80ab98e1c90d0f0281ba4"}},{"ruleId":"D1","level":"warning","message":{"text":"LatexExtractor::process_content_line (cyclomatic 36): LatexExtractor::process_content_line has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2025318a04576abb1110298a87ee121af13cafbfd43dbf5a17056f795315c09"}},{"ruleId":"D1","level":"warning","message":{"text":"RedactionPass::redact_format_metadata (cyclomatic 36): RedactionPass::redact_format_metadata has cyclomatic complexity 36 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6366262b7ac5ac23e0751a392885470315a3e1b14a5997cf690ed5f3447fca"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::jats::extract_para_with_annotations_jats (cyclomatic 36): xberg::extractors::jats::extract_para_with_annotations_jats has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9128b95b91215bbb574c9b389a145a0be0074c01e728354fc54d56985674ad47"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::layout_classify::apply_hint_to_paragraph (cyclomatic 36): xberg::pdf::structure::layout_classify::apply_hint_to_paragraph has cyclomatic complexity 36 (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":"crates/xberg/src/pdf/structure/layout_classify.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22420c75f68c66256549fabce4c49430baa994d77ce47bb14477bce0fd49df0"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_text_structure_order_cached_with_spans (cyclomatic 36): PdfDocument::extract_text_structure_order_cached_with_spans has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d530d473de6c6947c56dba5e83d03fd74c05908792dbd8739084f7bff8b7b5"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::reorder_rowspan_labels (cyclomatic 36): PdfDocument::reorder_rowspan_labels has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3a7cfe3cd8042ae37fa9d8eb8258c10db2dd6d7d6f854db3b13e3a15c8399a"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::load_fonts (cyclomatic 35): PdfDocument::load_fonts 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":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b28358b2d56485020df79dd29e27d08df9b5239108603ac7c99841bb45716d"}},{"ruleId":"D1","level":"warning","message":{"text":"TextRasterizer::load_font_data (cyclomatic 35): TextRasterizer::load_font_data has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2621a8856b2acb02aa10a899337387887ae74f280c13f27a2450f9eefe9cd015"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::hwpx::build_hwpx_internal_document (cyclomatic 34): xberg::extractors::hwpx::build_hwpx_internal_document has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/hwpx.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1986bc73a933b1ec7ec5fd59f292e14b97d55f2494c3407cd2d4fe9bc9a8304"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::run_ocr_pipeline_stages (cyclomatic 34): xberg::extractors::pdf::ocr::pipeline::run_ocr_pipeline_stages has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":9815}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8dc78079ce0d0f921af36da2e5970aad00894edd971229a4bd8a3e29713017"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::has_persistent_gutter_corridor (cyclomatic 34): PdfDocument::has_persistent_gutter_corridor has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9159ce4fd74104af25278b353a48bc2d9127cf4731bb6be0588bd7598cdeee"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::sidebar_body_reading_order (cyclomatic 34): PdfDocument::sidebar_body_reading_order has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"870fdc0178059fb26d894347cd0ed51f1edcb2698b296c4de94dc3c803d97a4c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_tables_in_cluster (cyclomatic 34): xberg_native_pdf::structure::spatial_table_detector::detect_tables_in_cluster has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ae541b9021856ba9d3c2d0c4d8df05b32cd481c635c31e6efdfbd19765b43e"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlWalker::handle_close_tag (cyclomatic 33): HtmlWalker::handle_close_tag has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: HtmlWalker::handle_open_tag (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure/tag_handlers.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58d60ae53153b1f850a6d8a52ffa4e49d42d9cad47a967e8e8a09af7c767c9b"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_text_lines_inner (cyclomatic 33): PdfDocument::extract_text_lines_inner 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":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c46ea3646850b065bafc34df28937173a3bcf2e66f419a86ec9b4e6235ad1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_embedded_fonts_with_unicode_maps_and_widths (cyclomatic 33): PdfDocument::extract_embedded_fonts_with_unicode_maps_and_widths 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":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"05db4ae331b38e5dd33981e42d502028bd832fa7a0849d921637a3698893402c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::split_table_at_section_dividers (cyclomatic 33): xberg_native_pdf::structure::spatial_table_detector::split_table_at_section_dividers 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2d61b3cc790bee64a73ee5a5b22e717f526bd272f0203e65ba19da787df41e"}},{"ruleId":"D1","level":"warning","message":{"text":"FictionBookExtractor::extract_paragraph_with_annotations (cyclomatic 32): FictionBookExtractor::extract_paragraph_with_annotations has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f0a00a27d5d1120e92cfd83dd326d109a90c93d9345156270bdb430199b6d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::core::mime::detect_mime_type_from_bytes_with_inspection (cyclomatic 32): xberg::core::mime::detect_mime_type_from_bytes_with_inspection 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":"crates/xberg/src/core/mime.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fc977a15b974a3e43cd2e9c706df0015967308146bb2e35233762c96a4b354"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::rendering::html_styled::render_elements (cyclomatic 32): xberg::rendering::html_styled::render_elements has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/html_styled.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"72218e5d1be1d84626a79355642685130072737101f5d95dc4bc807c64f758c3"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::assemble_positioned_words (cyclomatic 32): PdfDocument::assemble_positioned_words 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":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e496cffd5e9f00b688b25daf36a0a6db03cf48a1ed74eeac1497253b42df50"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::render_form_xobject_with_invocation (cyclomatic 32): PageRenderer::render_form_xobject_with_invocation 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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2f02bff9d8abd5c5120dd9ce75de35f2211a74777a586a668fa4965f7fcd97"}},{"ruleId":"D1","level":"warning","message":{"text":"Paragraph::runs_to_markdown_with_math (cyclomatic 31): Paragraph::runs_to_markdown_with_math has cyclomatic complexity 31 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b6acda7315cee4a35a4b652762dca5a78845ef41773621de698310d95b0bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::build_cells_from_intersections (cyclomatic 31): xberg_native_pdf::structure::spatial_table_detector::build_cells_from_intersections 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7089dfaf91df9830a3e20108714af83ec871858a6b147816849649e5321f4a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::recognize_pdf_formula_page_inputs (cyclomatic 30): xberg::extractors::pdf::recognize_pdf_formula_page_inputs has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7adfcceeab3ed6b88873a60273715582f140163930bd1fe3a7e700257600eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::reverse_rtl_visual_order_runs (cyclomatic 30): PdfDocument::reverse_rtl_visual_order_runs 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: PdfDocument::normalize_arabic_presentation_forms (cyclomatic 57) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb95f8c34fcdf26fdfcdb82de8fc6c1dbcd61770b189653bc5d3220d4ce06ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"XYCutStrategy::short_line_central_corridor_prose (cyclomatic 30): XYCutStrategy::short_line_central_corridor_prose has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f5fe245a1c59d68a11740d3f1b11d20cd6799cd282d1d7e4e11619d66563e2"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::xref::parse_xref_stream (cyclomatic 30): xberg_native_pdf::xref::parse_xref_stream has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"f835bdd15887584a5f99e827f70c2f6288f827edffe126a3debb19ff7c6789fa"}},{"ruleId":"D1","level":"warning","message":{"text":"JupyterExtractor::terminal_text (cyclomatic 29): JupyterExtractor::terminal_text has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"784d412fb3984c7a9ada853f740f46099a2539821391f016930eb3a849c19897"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::plan (cyclomatic 29): xberg::extractors::pdf::ocr::layer_token_recovery::plan has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb26a5cd82bc44a459e48e7e2a2b0246bdaa2a7573b7ad471bf134cb8fc1eac"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::to_markdown (cyclomatic 28): Run::to_markdown has cyclomatic complexity 28 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d444d84cbb2ecc1cb1e6e1ed84e24f9daee23de81df5a7c99ab904fc5cf95e"}},{"ruleId":"D1","level":"warning","message":{"text":"LatexExtractor::strip_inline_commands_with_symbols (cyclomatic 28): LatexExtractor::strip_inline_commands_with_symbols has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b407fd39efa44be42cacced31789a3beb0b22ce0aaaa78b1025d7d7bab0fd50"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::odt::collect_inline_run (cyclomatic 28): xberg::extractors::odt::collect_inline_run has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46c3782b8e3328d4db537c9a549191e75c387f886190c6a0c0c275227a0e433"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::annotation_content_spans (cyclomatic 28): PdfDocument::annotation_content_spans has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4039f891cdc39c845f1160883faac535b7f53bb466e16fef76d2e188133596"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::classifier_column_gutter (cyclomatic 28): PdfDocument::classifier_column_gutter has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a0499dac80e05fea70d9402e32293accbf0fe0638e37171a041b7aad6fda2f"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_images_from_form_xobject (cyclomatic 28): PdfDocument::extract_images_from_form_xobject has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b80043314045cf2c7b9bf59c224fca134ac0987642f6f778bafbd8c5e28ec87"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::show_text (cyclomatic 28): TextExtractor::show_text has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"155912320f2e3324fdef23481a8bda433e51546b46829cbd1ddb2ab16eaa0128"}},{"ruleId":"D1","level":"warning","message":{"text":"Table::render_text (cyclomatic 28): Table::render_text has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dccc65ecdda8d18653a0ccc40e55f7021e15d4934fc480eab9b9269fba104d5"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::resolution::color::evaluate_type0_sampled (cyclomatic 28): xberg_native_pdf::rendering::resolution::color::evaluate_type0_sampled has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa29dac76b0d1373860c557d90fa8473d0f42236d5497110ba1a086850e2d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::jats::parser::extract_fig_content (cyclomatic 27): xberg::extractors::jats::parser::extract_fig_content 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":"crates/xberg/src/extractors/jats/parser.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2c8a2d6b8ccf28edf471c7f9f8fed65c60327d8cbb86b60069d69a716e6aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::adapters::reattach_ocr_layout_list_markers (cyclomatic 27): xberg::pdf::structure::adapters::reattach_ocr_layout_list_markers 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":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbc415553dcdfeef63e8d6372165b490b0bd521979026a12f86fee93de886c6"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::rendering::djot::escape_block_prefix (cyclomatic 27): xberg::rendering::djot::escape_block_prefix 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":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c01ef3b301e0f4dd59dd78e30580d7ca10d2184441d25c45a8ae4f0c2bc44ec"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::is_multi_column_page (cyclomatic 27): PdfDocument::is_multi_column_page 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bcc8cf0e9fc90f56e95f355b675331c970fc518b2f5c73001126b028215459"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::tint_for_ink (cyclomatic 27): xberg_native_pdf::rendering::separation_renderer::tint_for_ink 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":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd0bce918f3d1dde114bce906157df8a919b1afc2ded0780be2984d34807f36"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::split_rows_by_text_positions (cyclomatic 27): xberg_native_pdf::structure::spatial_table_detector::split_rows_by_text_positions 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d292c8b48994c30323a63f7dbc3ee536c8c4e951b0e0e55e78942a082e5656"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_horizontal_rules (cyclomatic 27): xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_horizontal_rules 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb59774b8fc2d3b12a3fb8332ba5cc04c8a658a25080fd3bceae4aede97a2891"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageExtractor::extract_with_ocr_pass (cyclomatic 26): ImageExtractor::extract_with_ocr_pass 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":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a888b20264c9531579149a56aefc8b617b34190aedb0a2bf6c0213698d89cc4"}},{"ruleId":"D1","level":"warning","message":{"text":"SlanetModel::recognize (cyclomatic 26): SlanetModel::recognize has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10d2fa2f64d359212d867f3a244c980eabd13cbc08f5478e6e5712c91318814"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::ocr::conversion::iterator_word_to_element (cyclomatic 26): xberg::ocr::conversion::iterator_word_to_element has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/conversion.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"1425192bf58564ac273905431212ce58cefc2f5a49fe6c6011b7a959e3290541"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::ocr::processor::execution::render_inline_ocr_table_content (cyclomatic 26): xberg::ocr::processor::execution::render_inline_ocr_table_content has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"1451e131aae5d138990b9e0e8782b408ea563e39ff0f84006bbb958547997692"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::text_repair::repair_contextual_ligatures_mapped (cyclomatic 26): xberg::pdf::structure::text_repair::repair_contextual_ligatures_mapped has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/text_repair.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb93d05599a95aa6e932e7c45497759d87505cae6ebe38d5595ce1c78ebb01c"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::collect_image_handles_from_form_xobject (cyclomatic 26): PdfDocument::collect_image_handles_from_form_xobject has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c447b89ab6f7147e81d5a4e9e63c7410717c38c30aeb85af50db157e1d13fb5e"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::parser::parse_k_children (cyclomatic 26): xberg_native_pdf::structure::parser::parse_k_children has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"da941a9262f48e74d7a4d641d5ce1b975951e8ba61e1565666b5e9f7140c2bd7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_page_columns (cyclomatic 26): xberg_native_pdf::structure::spatial_table_detector::detect_page_columns has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"834f9c3fc000a947ece96ab1e1c540ce6d893372da0790706dc19d606969c190"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_spans (cyclomatic 26): xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_spans has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef33cf34304bcc1ef68d0a52f11d2d0b8f97cd60de25929f75748202fbc05fe"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::strip_form_numbering_artifacts (cyclomatic 26): xberg_native_pdf::structure::spatial_table_detector::strip_form_numbering_artifacts has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3024}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3c566570bab8e0a3d9deea075ecda3f0c31846c1cdedf52763c3ac6a6e1d7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::xref::parse_traditional_xref (cyclomatic 26): xberg_native_pdf::xref::parse_traditional_xref has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc1c636ef1c72f9da1d64b9673b58f3af2d15da4cf9497846ffdbe389d40e15"}},{"ruleId":"D1","level":"warning","message":{"text":"JatsExtractor::extract_content (cyclomatic 25): JatsExtractor::extract_content has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b274c06ffedeea92bb07fe1ebada61fd5c7ce15090dabcdd4740eaf0ab6d27d7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::email::process_node (cyclomatic 25): xberg::extractors::email::process_node 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":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"596e75481b488a9bdb39c6bf7c502dde603e6c98b7c7158f63d804b969743329"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::hidden_layer::painted_literal_image (cyclomatic 25): xberg::extractors::pdf::ocr::hidden_layer::painted_literal_image has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4e170d51e0dbe503126c4f68ad7e30ecdfd8f06828e1dbfa786742ed5de2e3"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::ocr::hocr_parser::parse_title_properties (cyclomatic 25): xberg::ocr::hocr_parser::parse_title_properties 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":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4b00443b82e8a8e572583676a91af38f29ed73981e65d37e4829d2e5acd901"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::assembly::extract_text_with_glyph_offset (cyclomatic 25): xberg::pdf::structure::assembly::extract_text_with_glyph_offset 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":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d0d22a321163c90da24665c9eac01ffb97308d636abdc7fc06a25719b7537f"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::finalize_paragraph (cyclomatic 25): xberg::pdf::structure::pipeline::finalize_paragraph has cyclomatic complexity 25 (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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1e92df617f7a7a6d1e124ae7f17ce9f83858f7038227467343e5d6c6047cb9"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::postprocess_spans (cyclomatic 25): PdfDocument::postprocess_spans 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":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2f37c3ecfaa8cb5803ec8fd019fbb287374ddc78661555c6481dbcbb01de9b"}},{"ruleId":"D1","level":"warning","message":{"text":"XYCutStrategy::detect_narrow_gutter_prose (cyclomatic 25): XYCutStrategy::detect_narrow_gutter_prose 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":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9d15a36dec26ba4ed44be8855e86b18570a37684a7d8002cfc4cd2dffe0473"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::page_renderer::evaluate_type0_multi (cyclomatic 25): xberg_native_pdf::rendering::page_renderer::evaluate_type0_multi 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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8266}}}],"partialFingerprints":{"codehealthFindingId/v1":"087c354e8702edc7b4e4255595e495600b01c219d941145697973fe9aa818fe1"}},{"ruleId":"D1","level":"warning","message":{"text":"FictionBookExtractor::extract_links (cyclomatic 24): FictionBookExtractor::extract_links has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"21678cf8b35fe1589ae2b109a0a677bb73b8601eeac45baf7be5c27ce96e1e54"}},{"ruleId":"D1","level":"warning","message":{"text":"TypstParser::extract_table_content (cyclomatic 24): TypstParser::extract_table_content has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"18570e16dccc53ebd405a0cf17d3e006d1c01745fe2b7e3731b6da4096159a89"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::rtf::metadata::apply_info_segment (cyclomatic 24): xberg::extractors::rtf::metadata::apply_info_segment has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/metadata.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e1215d5e66f98f26c5be038d5f98fed25887c6ee1230c4fd67bf18c670201c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::regions::tables::extract_tables_from_layout_hints (cyclomatic 24): xberg::pdf::structure::regions::tables::extract_tables_from_layout_hints has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/tables.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f0f488497aa3fa2ed33ea619abf1a958a2129461782680a33aab8132bb37c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::text_repair::repair_broken_word_spacing (cyclomatic 24): xberg::pdf::structure::text_repair::repair_broken_word_spacing has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/text_repair.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b874f7718cb9b93fc03c505a1d0676261c3ae652298ee24ae35686c58657f359"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::has_bimodal_line_starts (cyclomatic 24): PdfDocument::has_bimodal_line_starts has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d478aef59c1cdfdb28854302fe9c9714034721e71836c92e4f6a888134e4a8"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::get_page_by_scanning (cyclomatic 24): PdfDocument::get_page_by_scanning has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0726e77820aef5118195e64b8a9d808a63223568fa5259b9c6e65161b5701e0"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::apply_combining_mark_composition (cyclomatic 24): PdfDocument::apply_combining_mark_composition has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 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":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"948a28320c032b1fa0ba7cbbd2d78bc749f93eb96f4281e41cbe0546c0b0a89e"}},{"ruleId":"D1","level":"warning","message":{"text":"TextRasterizer::layout_text (cyclomatic 24): TextRasterizer::layout_text has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69edd3d55e6c3427e9772651c63b2b6c6c3605eafb4571a3efe80e66017664d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::skip_array_raw (cyclomatic 24): xberg_native_pdf::content::parser::skip_array_raw has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: xberg_native_pdf::content::parser::strict_operands (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"012b7cb0e48fab7f8f19acc8be014aae04f04a721444da5013503fc221b00f55"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::decoders::ccitt::decode_row_g4 (cyclomatic 24): xberg_native_pdf::decoders::ccitt::decode_row_g4 has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39ced9ca15c014ed873b547ad75bfdc3c54aa031906cc75f6dece764f143503"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::parser::parse_struct_elem (cyclomatic 24): xberg_native_pdf::structure::parser::parse_struct_elem has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0da0ffc2728ef35bd2b35b78ab2e5875b5ae668f578425f26230ec05cfa9e0"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::group_lines_into_clusters (cyclomatic 24): xberg_native_pdf::structure::spatial_table_detector::group_lines_into_clusters has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"b665d52dc904e1bd3e63dadddad530679f91e85b9a38e66585dc84797f674e1a"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::to_plain_text (cyclomatic 23): Document::to_plain_text has cyclomatic complexity 23 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4052c40588b1113b45715e2a23fb5597c74af2d415091e9c55cfbbccaf0576b"}},{"ruleId":"D1","level":"warning","message":{"text":"EmailExtractor::build_internal_document (cyclomatic 23): EmailExtractor::build_internal_document has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bcbc46c55e5f25a63c1690cd6a9f9bf5179402c9447c471815ba7ea28983fa"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlExtractor::extract_sync (cyclomatic 23): HtmlExtractor::extract_sync has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b5572324f59e13ca5490b99f473581649cac171af0f635d4269db4463af116"}},{"ruleId":"D1","level":"warning","message":{"text":"OdpExtractor::extract_content (cyclomatic 23): OdpExtractor::extract_content has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"60994ca0606e5e476d7c23e4cf4b7548da96807eb5ce17189d1c7f44920257f6"}},{"ruleId":"D1","level":"warning","message":{"text":"OdtExtractor::extract_content (cyclomatic 23): OdtExtractor::extract_content has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"3150da10f5ab97679ea1402c30167bac962c6809e03a20d203f7c51238774527"}},{"ruleId":"D1","level":"warning","message":{"text":"XbergMcp::cache_warm (cyclomatic 23): XbergMcp::cache_warm has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82a87cc8460d2a8dd5902faf315fd18a6f240b8ddf73db517ad57deeb117586"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::core::extractor::file::hash_extraction_config (cyclomatic 23): xberg::core::extractor::file::hash_extraction_config 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":"crates/xberg/src/core/extractor/file.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d4ba360948f8f69c6dd386925a44041538f51380728c08d410863d26255a70"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::core::pipeline::features::execute_chunking (cyclomatic 23): xberg::core::pipeline::features::execute_chunking 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":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a09baa31f009b960630dc9843f38cec99acd75facd919b383b773a9a7fd885f"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::extraction::apply_annotation_text_fallback (cyclomatic 23): xberg::extractors::pdf::extraction::apply_annotation_text_fallback 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":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"62669fb44ecb914c497e766e6f47f0c9b24abf9df07deef0e4cb871b399baa19"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::native::table::source_members::projection::page (cyclomatic 23): xberg::pdf::native::table::source_members::projection::page has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table/source_members/projection.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"417f88775f8fdd7987435a8f111c9fb7d0d4d074d9d0a0e2178303a137f5cf2b"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::density_central_gutter (cyclomatic 23): PdfDocument::density_central_gutter 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d8b2f699c387acca2ac604871290eee8e0e88e671f987810d8bc067bb47707"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::should_insert_space (cyclomatic 23): PdfDocument::should_insert_space has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: PdfDocument::normalize_arabic_presentation_forms (cyclomatic 57) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"504aed14fa45d3efe12fb920d06211ca80585c92a02448d4499c392c7e70e758"}},{"ruleId":"D1","level":"warning","message":{"text":"XYCutStrategy::find_heading_runs (cyclomatic 23): XYCutStrategy::find_heading_runs 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":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f00da6dbe70c0b46a749ca5d473913f3e87da087076a75efc58f908b0f01c30"}},{"ruleId":"D1","level":"warning","message":{"text":"TextRasterizer::render_cid_direct (cyclomatic 23): TextRasterizer::render_cid_direct 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":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"45accd19641a009bc8de7f15e7a160150b2d1911193d9cf1ddf22a4c4111246c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::extractors::xmp::apply_xmp_property_text (cyclomatic 23): xberg_native_pdf::extractors::xmp::apply_xmp_property_text has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/xmp.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c792341ddf628887d4b64d325ae392880dca43277c7ba0315a6187728cbb6a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"HtmlExtractor::walk_nodes (cyclomatic 22): HtmlExtractor::walk_nodes has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95f56b4ecc4119fcdf83a55f970b694b857db0cecb463a77b8a5186db99d648"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::core::pipeline::fold_embedded_image_ocr_text_with_gap (cyclomatic 22): xberg::core::pipeline::fold_embedded_image_ocr_text_with_gap has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d760d1f60f46a18c4aa52b2484a3d9872f8fadb4a5d982bc30fe4b6fef241ead"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::docx::styles::parse_paragraph_properties (cyclomatic 22): xberg::extraction::docx::styles::parse_paragraph_properties has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/styles/mod.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf9ed5192edb402bb7b2267d3269db35c0965d207e32643893af78aafdb83d2"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::mathml::convert_apply (cyclomatic 22): xberg::extraction::mathml::convert_apply has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1620fd9ca4a6245286d7bdabe566d9353e4d8e984bcb3240ef5ce23b3707f7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::build_heading_map (cyclomatic 22): xberg::pdf::structure::pipeline::build_heading_map has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"935ab115a53f8fe959c0dcaca75f2493d746f02dbc38b03dbe7e732ac63dd533"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_images_from_xobject_do (cyclomatic 22): PdfDocument::extract_images_from_xobject_do has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d7d48c648e3bb0c748f5549bf0134dea2023f2d575d8abe089eb61bb0696d0"}},{"ruleId":"D1","level":"warning","message":{"text":"FontInfo::resolve_encoding_fields (cyclomatic 22): FontInfo::resolve_encoding_fields has cyclomatic complexity 22 (threshold 15). Of this number, 20 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. This is NOT this file\u0027s highest cyclomatic complexity: FontInfo::gid_to_standard_glyph_name (cyclomatic 219) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f90ad2b67fad776bce04af881b84034835d14099d7c7e2dec335a07d6012b4"}},{"ruleId":"D1","level":"warning","message":{"text":"XYCutStrategy::is_single_column_region (cyclomatic 22): XYCutStrategy::is_single_column_region has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a79d463897a4e33c41e1250e136601488d14b06687bbb60a277f7f3d9a4c0e"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::apply_smask_after_paint_inner (cyclomatic 22): PageRenderer::apply_smask_after_paint_inner has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":7008}}}],"partialFingerprints":{"codehealthFindingId/v1":"970048c4772c74ae5c9481f6ec87bf736a71dc50ed203e7faf9bf6362853cf77"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::parser::decode_literal_string_escapes (cyclomatic 22): xberg_native_pdf::parser::decode_literal_string_escapes has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4c0a06f87a49a918af5d1b2bc4ab28a835cafe38d92eefa4cc1fb21d482241"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::text::bidi::reverse_rtl_keep_numbers (cyclomatic 22): xberg_native_pdf::text::bidi::reverse_rtl_keep_numbers has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/bidi.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39449dde2cb8299051508518f10118d27ca29209dd2c0a07b4541e07377b1cd"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDestinationViewSettings::view_settings_for_mode (cyclomatic 22): PdfDestinationViewSettings::view_settings_for_mode has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/destination.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83c0b4436b48007b8d7dad39cec4ef1a5774b5f1eb8702f65cc84a81da4c72b"}},{"ruleId":"D1","level":"warning","message":{"text":"FictionBookExtractor::extract_text_content (cyclomatic 21): FictionBookExtractor::extract_text_content has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2eb564cf207b60f50df575682ec09a7e3ef86bf0664730b40c399089c06350"}},{"ruleId":"D1","level":"warning","message":{"text":"JupyterExtractor::extract_data_output (cyclomatic 21): JupyterExtractor::extract_data_output has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"9768be5468856fc2a79ce8be75d84280bd6de967487084340080c18d436c4da5"}},{"ruleId":"D1","level":"warning","message":{"text":"PptxExtractor::push_markdown_content (cyclomatic 21): PptxExtractor::push_markdown_content has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pptx.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cee89f14b2154c762a3cf03e0ecae495d08e70f906865d5aaf740b16c28d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::docx::drawing::collect_txbx_content_text (cyclomatic 21): xberg::extraction::docx::drawing::collect_txbx_content_text has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce20e13509acd3de8772ef812d30035432a6a605da68c5b60e0ed2d7bebe1c9"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::run_ocr_with_layout_pages (cyclomatic 21): xberg::extractors::pdf::run_ocr_with_layout_pages has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a34c5e6d68b8d3d51e1062ff9d88052c1510cf16909d7e54f4dec7417a5a0a"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::assembly::push_paragraph_element_by_kind (cyclomatic 21): xberg::pdf::structure::assembly::push_paragraph_element_by_kind has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab764b8263aa94b18096d96ff6134953f6e065cd36c7220dccc145b516f8c759"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::append_annotated_span (cyclomatic 21): xberg::rendering::comrak_bridge::append_annotated_span has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6ee6dfef10869eacefc3ad132106ff053b46f8039debd7f7bb010ffb9de4e1"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::scan_for_object (cyclomatic 21): PdfDocument::scan_for_object has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c966777446d6cbbc1d5a2a17f80416bc33138b2282921211f15a999336d759"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::merge_drop_cap_initials (cyclomatic 21): PdfDocument::merge_drop_cap_initials has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcad71e9428983e4da43ba96ba311fc28b8b597659418dc0a16d94abec2bdefb"}},{"ruleId":"D1","level":"warning","message":{"text":"XYCutStrategy::detect_two_column_prose (cyclomatic 21): XYCutStrategy::detect_two_column_prose has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"849d748f45d99de93e261037265144b9a32ee021b7147b557e4930a2e47eb121"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::apply_overprint_after_paint (cyclomatic 21): PageRenderer::apply_overprint_after_paint has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6748}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9c20ff1d31d672f4902cebc182a2df540cfe54d7c8694586dc7e6dde887357"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorResolver::resolve_iccbased (cyclomatic 21): ColorResolver::resolve_iccbased has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"164a386fd24089205041c7b38f9e980b1cd44d53005c73bfbe2c025ceccd8a45"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::mesh_shading::decode_patches (cyclomatic 21): xberg_native_pdf::rendering::mesh_shading::decode_patches has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbb42062e96c773ba6ed9f4a3c9379dd154fd5a91f21ae3913237b9524e2b84"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::sidecar::extract_process_paint_cmyk (cyclomatic 21): xberg_native_pdf::rendering::sidecar::extract_process_paint_cmyk has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"8400919735c854a4b991c860996df97d530d9822c60309f7e8a6f075751fe209"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells_visually (cyclomatic 21): xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells_visually has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"d962dd1d0497167b01e4dc6705d864a3626d2b8fd2a224e47da67a70e5098d9b"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::merge_vertically_adjacent_tables (cyclomatic 21): xberg_native_pdf::structure::spatial_table_detector::merge_vertically_adjacent_tables has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4191}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa8d09b3265090b2c6c60abb6d376af17f24de9ac7afd6159f55af9129e6c45"}},{"ruleId":"D1","level":"warning","message":{"text":"TextWalk::open (cyclomatic 20): TextWalk::open 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":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9a8ccc1ed6eea5798b66870604b1fdefa7697242c0dda684fdba8ae406d00b"}},{"ruleId":"D1","level":"warning","message":{"text":"VisibleMarkdown::on_plain (cyclomatic 20): VisibleMarkdown::on_plain 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":"crates/xberg/src/rendering/redaction_projection.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e399d03235a7b5dbdcc42d2af17a1df73b07d520f3048d33e141be5c0e42dae9"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::api::handlers::cache_warm_handler (cyclomatic 20): xberg::api::handlers::cache_warm_handler has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a8541a6781db9cea938f25ba98209e1ef8379058ba1526985574e6bd1eef96"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::insert_recognized_formula_element (cyclomatic 20): xberg::extractors::pdf::insert_recognized_formula_element 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":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd291e338ad165ffeebc8e4bbfc6691ec76b0858c881787d241da6ad562984af"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::hidden_layer::source_audit::audit_hidden_text_image (cyclomatic 20): xberg::extractors::pdf::ocr::hidden_layer::source_audit::audit_hidden_text_image has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/hidden_layer/source_audit.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b92cb132581b0517792a5a2d9fc4ae1e322cd6026fd35bd42d077b6351db6df"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::painting_candidates (cyclomatic 20): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::painting_candidates 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":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea460c298653e170b323ae0372d4126c5aefd8c0371926678ef20909f2aba39"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::mixed_plain::retains_inline_block (cyclomatic 20): xberg::extractors::pdf::ocr::pipeline::mixed_plain::retains_inline_block 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":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d56bda1fc5a32e45d5b96755a9e2f2029cac7627ba6e8188285b07b354dd360"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::paragraphs::numeric_multiplier_end (cyclomatic 20): xberg::pdf::structure::paragraphs::numeric_multiplier_end has cyclomatic complexity 20 (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":"crates/xberg/src/pdf/structure/paragraphs.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec262edf7f204ae2a5377e8874c3873f85e1d1634e17185ac93237aace4c7c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::lift_marginalia_column (cyclomatic 20): PdfDocument::lift_marginalia_column 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5d960493d46b8b525ccf93200e551536164d1fa3f8127677e38c0144f6486b"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::ensure_running_artifact_signatures (cyclomatic 20): PdfDocument::ensure_running_artifact_signatures 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b402e3a4de0aae468d3ca79dab5a7f16e68228f9233ec521844451cb68fe5417"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::page_image_handles (cyclomatic 20): PdfDocument::page_image_handles 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 shape REPEATS in the file: one other method here (PdfDocument::extract_images_filtered) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5708522fd9699043da44d4085f394abb4b3673ad4aac9121945af69f7d2b4bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::extract_images_filtered (cyclomatic 20): PdfDocument::extract_images_filtered 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 shape REPEATS in the file: one other method here (PdfDocument::page_image_handles) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e330c69c6f57567be1bb092a1fe9176b1fea6ba704b508a83619f7389ab16e62"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::get_page_from_tree_inner (cyclomatic 20): PdfDocument::get_page_from_tree_inner 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":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01518800f901a7bfa6aa49168b3d6c1c389141d906ca1cbeac808a78a2ca37"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::merge_rtl_line_to_visual_span (cyclomatic 20): PdfDocument::merge_rtl_line_to_visual_span 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":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9834d2258b11b0737bc6c9598b83aa16fb81b0888d9b3213092757f205a065"}},{"ruleId":"D1","level":"warning","message":{"text":"FontInfo::parse_descendant_fonts (cyclomatic 20): FontInfo::parse_descendant_fonts has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: FontInfo::gid_to_standard_glyph_name (cyclomatic 219) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"b499c44faac297b21d44e402c9663b7f29e7423209897a90bd32610817589cad"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::prescan_text_regions (cyclomatic 20): xberg_native_pdf::content::parser::prescan_text_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. This is NOT this file\u0027s highest cyclomatic complexity: xberg_native_pdf::content::parser::strict_operands (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"685998e28a389e63bb1e6264e9b18bafea657930c7a75799a665bc4c3a59d69a"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::paint_image_to_plates (cyclomatic 20): xberg_native_pdf::rendering::separation_renderer::paint_image_to_plates has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f61df2c15e72006af6feb70dce64eb88132e40ebd5acaf6d0bf8bce5874009"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells (cyclomatic 20): xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":5428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b343faf80e984a2edfc38a92c8c97f11ffa48a45e2e165dfcde785205ffc87b"}},{"ruleId":"D1","level":"warning","message":{"text":"demo.html.processFile (cyclomatic 20): demo.html.processFile has cyclomatic complexity 20 (threshold 15). Of this number, 19 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":"docs-site/public/demo.html"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf66fbf27c7be2689d37a70e377bd36475bfc4b6e9576599875be610e703d82"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::to_markdown (cyclomatic 19): Document::to_markdown has cyclomatic complexity 19 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d9fcf6735e8e1df4654fe7265c1c4edc5f5f972f6bd8239b2791e536beb174"}},{"ruleId":"D1","level":"warning","message":{"text":"AsciiDocParser::parse_block (cyclomatic 19): AsciiDocParser::parse_block has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/asciidoc.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6c1d6fda8a48b355e9eb102b66d64b411b0cf1acb7c9615ebf6ebaa6ddf688"}},{"ruleId":"D1","level":"warning","message":{"text":"FictionBookExtractor::extract_binary_images (cyclomatic 19): FictionBookExtractor::extract_binary_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":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"620c77ef60b6a4f948b90c18e282e8110dd6d9585303c3b8fbd45efbd62f6d7d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::docx::table::parse_table_borders (cyclomatic 19): xberg::extraction::docx::table::parse_table_borders has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d430e9d028736c8b5d11b700af04789e961f29379ca74804b16d7a9fd9c4c8b"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::pptx::parser::parse_paragraph (cyclomatic 19): xberg::extraction::pptx::parser::parse_paragraph 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":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8f5fc42264d9bb45569bc84beecb75e140f7581ad44d3932c580a8c3a1df2a"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::hwpx::collect_section_formulas (cyclomatic 19): xberg::extractors::hwpx::collect_section_formulas has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/hwpx.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e8817cc62a22f074db366f7a19b3c3a8a716efbd6151353495f9a7121bc433"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::image::process_whole_image_ocr (cyclomatic 19): xberg::extractors::image::process_whole_image_ocr has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2364755d66b1afbcb2927bc03d25fd0c471df02942d0c2fcc44b0960f872f883"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::rtf::parser::parse_font_charset_table (cyclomatic 19): xberg::extractors::rtf::parser::parse_font_charset_table has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"d358bf2aa56fc44f30d1051ffe29e917b34f107fb294327af4bdcf20a4fd2fac"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::rtf::parser::control_word::handle_scope_control_word (cyclomatic 19): xberg::extractors::rtf::parser::control_word::handle_scope_control_word has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/control_word.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b33db26805bfbe08ac827e2be9f36c521472b3fcab7d57ac021612aa667fcf"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::classify::refine_heading_hierarchy_inner (cyclomatic 19): xberg::pdf::structure::classify::refine_heading_hierarchy_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ea526d834a4bf74f4f23c0c812bba03af4834fd645a008fa2998826d8ba46"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::classify::mark_cross_page_repeating_short_text (cyclomatic 19): xberg::pdf::structure::classify::mark_cross_page_repeating_short_text has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"668fefbef2e3e2fce86946bfc5cd750e983a850040e5aea98c692b01c683b80f"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::actualtext_actions_for_page (cyclomatic 19): PdfDocument::actualtext_actions_for_page has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7228b19c571840ad38750126e4a4673b39f58d4e9e0d04720e59109fab3d20"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::stamp_char_x_offsets (cyclomatic 19): PdfDocument::stamp_char_x_offsets has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"d967009ab27bd5e7b546eae649acba53be032c22e143053468376e463437643b"}},{"ruleId":"D1","level":"warning","message":{"text":"FontInfo::compute_font_weight (cyclomatic 19): FontInfo::compute_font_weight has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: FontInfo::gid_to_standard_glyph_name (cyclomatic 219) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":5151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2ebbd782db98f887e86b59d0ef42bcebcb074d2bb7544e51181a825734e696"}},{"ruleId":"D1","level":"warning","message":{"text":"XYCutStrategy::partition_indexed_depth (cyclomatic 19): XYCutStrategy::partition_indexed_depth has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aae6ec21b7224b766c66972ad25e29b112f732dd81229f83e8809527b6cf9af"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::build_indexed_color_operator (cyclomatic 19): xberg_native_pdf::content::parser::build_indexed_color_operator 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. This is NOT this file\u0027s highest cyclomatic complexity: xberg_native_pdf::content::parser::strict_operands (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":2552}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bd43929c9e3fb9c4a9e28ae418fe50df16ac16fdd0a5bde0b67c85f09fd1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::parser::parse_stream_data (cyclomatic 19): xberg_native_pdf::parser::parse_stream_data has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cb923e0f7d4fbb6cdb433a00c3ffd059aaad715324532f6f7970e0fe58c2ae"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::redaction::serialize::serialize_color_operator (cyclomatic 19): xberg_native_pdf::redaction::serialize::serialize_color_operator has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/serialize.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2893a5629618e99685d5417a086dd4db7b3ae8a4a5cf968728e21041d0d7b1"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::sidecar::resources_declare_transparency_or_overprint (cyclomatic 19): xberg_native_pdf::rendering::sidecar::resources_declare_transparency_or_overprint has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"3268a93b4c86adf88a8e76f69b9bd41adc00a376a269a935b6abf05010dea666"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::table_extractor::extract_cell (cyclomatic 19): xberg_native_pdf::structure::table_extractor::extract_cell has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda9a8785eea57ffa4f7e66e3e4cc9e871bb4bb2d1a7045bf3a67b3b6753ad0b"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelSelection::for_script_retry (cyclomatic 18): ModelSelection::for_script_retry has cyclomatic complexity 18 (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":"crates/xberg/src/core/extractor/cache_context.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd21b319b7219f865cb6bc085fe4f4f4e4ac44c14457a8c09ec1752b6bf2b97"}},{"ruleId":"D1","level":"warning","message":{"text":"Slide::to_internal_elements (cyclomatic 18): Slide::to_internal_elements has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/elements.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f309abc541e204cf5403ab845c2bf2504de1bd282a14b3964a4b9d110f3aad9"}},{"ruleId":"D1","level":"warning","message":{"text":"LatexExtractor::build_internal_body (cyclomatic 18): LatexExtractor::build_internal_body has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"235d329eebcf39e5ad9a5f498a05b43a07ad8018dcc05baa8046df505779b484"}},{"ruleId":"D1","level":"warning","message":{"text":"DrawingAudit::visit (cyclomatic 18): DrawingAudit::visit has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/latin_rows/source_glyphs.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2468992eee4b0124a2dbaf31b2b947e55bfa61b5037bd357691e8f38ea98b138"}},{"ruleId":"D1","level":"warning","message":{"text":"RstExtractor::is_list_item (cyclomatic 18): RstExtractor::is_list_item has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fb5be159366d370f74d5d1b1d895c52ef8672b9d1b33d04f9378d96838bdd9"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::doctags::push_element_body (cyclomatic 18): xberg::extraction::doctags::push_element_body has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doctags.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc3a8703759c849e01d10863a865253e08994fdf88e607f4417b498914740ea"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::docx::parser::apply_run_formatting (cyclomatic 18): xberg::extraction::docx::parser::apply_run_formatting has cyclomatic complexity 18 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1023c8444c7ba4b7131103682f53870a9040a801fbbd4ba9b8429a3da553890"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::mathml::convert_content_node (cyclomatic 18): xberg::extraction::mathml::convert_content_node has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cb6daadf069a58bd85514a42097243f5f4604ddda9f01915a876bc657f81ee"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::pptx::build_slide_structure (cyclomatic 18): xberg::extraction::pptx::build_slide_structure has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aecad702ac27e91e73002e284242f47d370531cdd8ac1a3baec6d368d49585"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docx::merge_adjacent_annotations (cyclomatic 18): xberg::extractors::docx::merge_adjacent_annotations has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"7669a0835122d3a2203f57e9f2679eeca1aae1e1545b52e0cbd0c15812574f4b"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::assign_formula_slots (cyclomatic 18): xberg::extractors::pdf::assign_formula_slots has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5121902f45127e7360d56284032ac60e3094253d909f4755c508713967df2e"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::recover_page (cyclomatic 18): xberg::extractors::pdf::ocr::layer_token_recovery::recover_page has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"df66c0216c2e910f1391007fe44ecc5b8b8e098b5c7613d3fd235431d4bfbd8f"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::rtf::parser::control_word::handle_table_or_formatting_control_word (cyclomatic 18): xberg::extractors::rtf::parser::control_word::handle_table_or_formatting_control_word has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/control_word.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed47320ad690320d64f2170358a8c1b8fc8a63877a149bfa74dd2fb4d9d5a4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::native::table::open_year_row (cyclomatic 18): xberg::pdf::native::table::open_year_row has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"72029102fe9b7a0ea3ebf5432df7d013d7813bf20ccacc448e196553aa4eb944"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::classify::detect_indentation_based_lists (cyclomatic 18): xberg::pdf::structure::classify::detect_indentation_based_lists has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fac29b6fdcb75a78fc8077130f3092692e7a506fb1a148a2d9dbc158ae16707"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::resolve_overlaps (cyclomatic 18): xberg::pdf::structure::pipeline::resolve_overlaps has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":6210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7020a7931917d31fa0888429aae3cfa046bc902305617370ff2339520d515"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::merge_header_only_column (cyclomatic 18): xberg::pdf::table_reconstruct::merge_header_only_column has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad606ba5f6152b5903b1b73b40f74f9d48b386b102db721810f2a75efbdba7b"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::page_cannot_have_text (cyclomatic 18): PdfDocument::page_cannot_have_text has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"38af4c126e00c329cdf6d8d1346a40b9abc23bb69ea94ae572c58154bd57e8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::identify_multi_row_labels (cyclomatic 18): PdfDocument::identify_multi_row_labels has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbf9128972cfd2dcb566d51a599985258b753b36ea8addfeeff498e29919248"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::render_image_mask (cyclomatic 18): PageRenderer::render_image_mask has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4272}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9d2220187acfbb22000a2b488c47355e1d7dfd97f5aa9f9975651cae07a423"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::mirror_cmyk_paint_into_sidecar (cyclomatic 18): PageRenderer::mirror_cmyk_paint_into_sidecar has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5203}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6c04bf715b888eb12ce14b36ae465101ec69ebfd077fb50b26066ee7c4c09"}},{"ruleId":"D1","level":"warning","message":{"text":"TextRasterizer::render_substituted_cjk (cyclomatic 18): TextRasterizer::render_substituted_cjk has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44967a729fa5a20037129a7572692a169b1411d6c681704ff2d022bfcb7dd9c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::skip_dict_raw (cyclomatic 18): xberg_native_pdf::content::parser::skip_dict_raw has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: xberg_native_pdf::content::parser::strict_operands (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3462}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ac2fbc3069bdb6e4f4e5e3cea9d0377a30044fb8b8e7a40d1e4f46f87782be"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::document::find_objstm_candidates (cyclomatic 18): xberg_native_pdf::document::find_objstm_candidates has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"08220537d17d93dec6064f7882d583ca1413cc5cabfeec3332b7cc4f063cac90"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::document::collect_inks_from_color_space (cyclomatic 18): xberg_native_pdf::document::collect_inks_from_color_space has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef89cc2748130802948de869eebc5641d69fffc1c2392c895527b616c650bff"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::fonts::cmap::line_parsers::parse_bfchar_line (cyclomatic 18): xberg_native_pdf::fonts::cmap::line_parsers::parse_bfchar_line has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ad27e2743e1262ec896fc27208d172173edfdbeb534ee4edf48717891d8033"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::parser::parse_object_at_depth (cyclomatic 18): xberg_native_pdf::parser::parse_object_at_depth has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0398f41828f352bf0886bf84cc14048bc06bf44517908e9dfa9392ba49bc0b09"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::classify_resolved (cyclomatic 18): xberg_native_pdf::rendering::separation_renderer::classify_resolved has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475b05d8e10df9c19610eed16c31a086ff666a625b4bc7aaa3b7ca052fe457e"}},{"ruleId":"D1","level":"warning","message":{"text":"readerMapping.buildMetadata (cyclomatic 18): readerMapping.buildMetadata has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/readerMapping.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f531d687260ef28681270a9246ce7fcf6e3b3034734b24814e8bbe20c612ac2"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtractionConfig::validate (cyclomatic 17): ExtractionConfig::validate 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":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ecd51781c9cb2da846dd77cf0abb18e75923a23adfcc4c07684e2ff9c763d6"}},{"ruleId":"D1","level":"warning","message":{"text":"RstReferences::collect (cyclomatic 17): RstReferences::collect has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca65917919b9b3b695da5f03c237cc6d428eb1842c9ef03b45b6b66142fd1c7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::docx::table::parse_row_properties (cyclomatic 17): xberg::extraction::docx::table::parse_row_properties has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cf4283d77edc3c5a5b639a8387151c488995f3004d21eeb525d049894d3e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::ods::validate_ods (cyclomatic 17): xberg::extraction::excel::table_budget::ods::validate_ods has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/ods.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42d3b3fc103623b22ddd89dcddbf0550ddc80c080506962aaf85c71062c453e"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::ppt::read_table (cyclomatic 17): xberg::extraction::ppt::read_table 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. This is NOT this file\u0027s highest cyclomatic complexity: xberg::extraction::ppt::cp1252_to_char (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"2421de2c742af6a7269a247bab0bde05becfc181b88b5a225bae5e40fe7cc040"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docx::collect_run_annotations (cyclomatic 17): xberg::extractors::docx::collect_run_annotations has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9135b6733c9e807689c56e5a9ef6b7773fbb3cb52c5e2359e732a3ec8743b0"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::odt::parse_odt_tracked_changes (cyclomatic 17): xberg::extractors::odt::parse_odt_tracked_changes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"654e7b6b364c65b32f22b7ffdc36b73eb20a25a39eca7b0047f446837f2864bd"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::odt::extract_node_text (cyclomatic 17): xberg::extractors::odt::extract_node_text has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a47651d9bc56fa365eac6ceb699fbdece5f7ad5fb5393ea66cec26db2f6390"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::restore_discarded_page_reads (cyclomatic 17): xberg::extractors::pdf::restore_discarded_page_reads has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c35fef1b3779eb92567e90501ddb22106a34f7e43feef46fea872fbb9d955d5"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::latin_rows::rewrite_elements (cyclomatic 17): xberg::extractors::pdf::ocr::layer_token_recovery::latin_rows::rewrite_elements has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/latin_rows.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee83bd99023265ae60c531bb34a2d6530ca330b05f8938fb835bddada743a11"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::mixed_plain::check_accepted_ocr_tokens (cyclomatic 17): xberg::extractors::pdf::ocr::pipeline::mixed_plain::check_accepted_ocr_tokens has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"678a934d41a23879e853170b02d8b3c987932f9f426dae3f7cedc1dbcf5ca4ff"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::tall_source::recover (cyclomatic 17): xberg::extractors::pdf::ocr::tall_source::recover has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd30b9b3b0832a3e2e5adae6605684c357aaf66b33f14ec3d846677db0c3e29"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::tall_source::certified_strip_lines (cyclomatic 17): xberg::extractors::pdf::ocr::tall_source::certified_strip_lines has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bad1788e9ea3610efc036fdb3a7a40e073632c0a62236eaca157bab38bc4ec"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::reading_order::plan_segment_groups_by_layout (cyclomatic 17): xberg::extractors::pdf::reading_order::plan_segment_groups_by_layout 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":"crates/xberg/src/extractors/pdf/reading_order.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a2f381b640fd7e312e7f700fe15be2081c665ae4780970ca935000e581214c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::rtf::formatting::normalize_whitespace (cyclomatic 17): xberg::extractors::rtf::formatting::normalize_whitespace has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/formatting.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70d8cf2bfdca5825d28ac1cbc0c31cbfc9845e28db109797efe0c04bd004cbe"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::ocr::processor::execution::should_apply_default_preprocessing (cyclomatic 17): xberg::ocr::processor::execution::should_apply_default_preprocessing 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":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"354fb4f1f19e6baea058f03d66af949b1c7b2ff8e038611d9a6064637eb73f85"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::paragraphs::embedded_bullet_positions (cyclomatic 17): xberg::pdf::structure::paragraphs::embedded_bullet_positions 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":"crates/xberg/src/pdf/structure/paragraphs.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7ad0d0c30e5b33864006321e6998f094276100a8b38de4ae2fdf59d2f16d6e"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::accepts_detached_list_marker (cyclomatic 17): xberg::pdf::structure::pipeline::accepts_detached_list_marker 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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e7e9cc6906767fa83443ed93aa22d0bdc312aca87d72190f521cb1afacc7c7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::regions::table_recognition::recognize_tables_slanet (cyclomatic 17): xberg::pdf::structure::regions::table_recognition::recognize_tables_slanet has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7928b685ddf0a84de9bf992a3a5b1382f6cfd01093892093fb099f283048163c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::looks_like_short_columned_prose (cyclomatic 17): xberg::pdf::table_reconstruct::looks_like_short_columned_prose has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bdf30437373f44dd79990d90ed75d7c609cbe2f94d9563ef5ad7362b2b3b77"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::keep_code_literal (cyclomatic 17): xberg::rendering::comrak_bridge::keep_code_literal has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eb97fd5a91eed222e15b5a6cd37579f667cc3f52fabe8535f8828061022f87"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::utils::quality::normalize_whitespace_ascii (cyclomatic 17): xberg::utils::quality::normalize_whitespace_ascii has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/utils/quality/mod.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"b733b13f9f679191ecd495a577f8002456ccace610265d45baffde66a2e816f3"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::has_clean_column_gutter (cyclomatic 17): PdfDocument::has_clean_column_gutter has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e00694da9df0ce4e769cc4089b6ffb8375f805fba57ed38f274bad40b190b72"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::font_identity_hash_cheap (cyclomatic 17): PdfDocument::font_identity_hash_cheap has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89e03d72aae9f5c8727491517c18dd7c45712ec4ed7b1c2ef6f4cc5bf7d564a"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::collect_all_pages (cyclomatic 17): PdfDocument::collect_all_pages has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe18c6ffcf9f36aa0fbd83bbd70fdb2c3c6e6f53c3cec8836a5414fee008539"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::may_contain_text (cyclomatic 17): PdfDocument::may_contain_text has cyclomatic complexity 17 (threshold 15). Of this number, 16 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":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a5b10a80bf122631ff8f44032ad5bd2c068bfc18e2c50ab21d1e9fb34d23e9"}},{"ruleId":"D1","level":"warning","message":{"text":"XYCutStrategy::find_horizontal_split_indexed (cyclomatic 17): XYCutStrategy::find_horizontal_split_indexed 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":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced40e0c64907ebf59d9829c5f2f50dcb8a35ef00f1021e574f0905417a56a1c"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::render_xobject (cyclomatic 17): PageRenderer::render_xobject has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a22f0265479df8a89556104efeb5000d2a78349002653c7c125bdf20b98105d"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorResolver::resolve_separation_or_devicen (cyclomatic 17): ColorResolver::resolve_separation_or_devicen has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ad5c5f8ad6383920ab72bfa5212d13f023d21723859f910bef8f1561df501a"}},{"ruleId":"D1","level":"warning","message":{"text":"WordBoundaryDetector::is_word_boundary (cyclomatic 17): WordBoundaryDetector::is_word_boundary has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/word_boundary.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4498184c23fb0f2ed54b980c5e74938487013d5f5af940597d91dd19f4a8eb"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_and_execute_text_only (cyclomatic 17): xberg_native_pdf::content::parser::parse_and_execute_text_only 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. This is NOT this file\u0027s highest cyclomatic complexity: xberg_native_pdf::content::parser::strict_operands (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b33542a667a278bd5ad1b26cb3eb1ba9a003e742bea7dfeb3d6c8d8f7a938c"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::converters::whitespace::dehyphenate_line_breaks (cyclomatic 17): xberg_native_pdf::converters::whitespace::dehyphenate_line_breaks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/converters/whitespace.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ef88ce901798783a851d82411655c3003c5343282074ad03b0b12b912ba912"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::decoders::ccitt::decode_g3 (cyclomatic 17): xberg_native_pdf::decoders::ccitt::decode_g3 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdcd3f61c1bec8ce111797c3cb187ba1a6d897897772b91e07e2ac6d60a605a"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::extractors::images::parse_color_space (cyclomatic 17): xberg_native_pdf::extractors::images::parse_color_space has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"4810de0fe47bc214474e3a1d2b36157f18ea2975f907da27bed9c3079b99a083"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::fonts::type1_encoding::parse_dup_entry (cyclomatic 17): xberg_native_pdf::fonts::type1_encoding::parse_dup_entry has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/type1_encoding.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e02b9e6ec1fd53af4459b727ef44cdf26538a3feda832561acf77f422840a09"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::parser::parse_dictionary (cyclomatic 17): xberg_native_pdf::parser::parse_dictionary has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5acbef231152a7aec9e9a008a690c8f8977ff385deeb903f1b8d3cba547c22"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::sidecar::extract_paint_spot_inks (cyclomatic 17): xberg_native_pdf::rendering::sidecar::extract_paint_spot_inks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"4737d8dd5a51ccbc3630f66ab8042b2cd29d7fc0814176102741f902beefdb17"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::rendering::sidecar::initial_colour_for_space (cyclomatic 17): xberg_native_pdf::rendering::sidecar::initial_colour_for_space has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ebf1e98a1a42c7fb63799a1c333429e5e024d7edf97ca83c85f4c50e9f8637"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::looks_like_prose_paragraph (cyclomatic 17): xberg_native_pdf::structure::spatial_table_detector::looks_like_prose_paragraph has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9b267a6bc1adfb0d4cbae1e2c1f98dbbf633ed95127400ada6232294074165"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_text_edge_columns (cyclomatic 17): xberg_native_pdf::structure::spatial_table_detector::detect_text_edge_columns has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"941fa68cda34ede731614731e94b88e8da12da64c6cd222502ca52b121d2b5ef"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericCache::is_valid (cyclomatic 16): GenericCache::is_valid has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cache/core.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fd95c580cc15094db9462dc2ea5215eb50b932b33117be06cba9ba1d66e12b"}},{"ruleId":"D1","level":"warning","message":{"text":"FictionBookExtractor::extract_footnote_text (cyclomatic 16): FictionBookExtractor::extract_footnote_text has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbff9943eec64ac4cd838401134ea516c8188a4341cd5e344d28e8e662934e2f"}},{"ruleId":"D1","level":"warning","message":{"text":"JupyterExtractor::build_internal_document_with_budget (cyclomatic 16): JupyterExtractor::build_internal_document_with_budget has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"369643de4a7bcf53b2d8815e6b939fecadabffaf27f33bf6ab73540cb3ae7cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"LatexParser::process_environments (cyclomatic 16): LatexParser::process_environments has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/parser.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b772fd32d85eb71efc15f45f9eec7394896d87c181602e64a8d81e2f2f9701"}},{"ruleId":"D1","level":"warning","message":{"text":"OrgModeExtractor::parse_inline_markup (cyclomatic 16): OrgModeExtractor::parse_inline_markup has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"240633d01ac92dfcfd156394cc633650f8aef7a8c14e7e5ea34b43c3cefa2ece"}},{"ruleId":"D1","level":"warning","message":{"text":"OrgModeExtractor::is_structural_start (cyclomatic 16): OrgModeExtractor::is_structural_start has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcaffa1ad34c4abb18b2a86b95048cdec5e9fd83e6c3e1a6e662bd2cf1bfb56"}},{"ruleId":"D1","level":"warning","message":{"text":"PlainWords::reconcile_writers (cyclomatic 16): PlainWords::reconcile_writers has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a570484a2bc8439cd38978c32b539320eec937c29b78ef33a67ebd363ad05b5"}},{"ruleId":"D1","level":"warning","message":{"text":"TextParser::handle_skipped_control_word (cyclomatic 16): TextParser::handle_skipped_control_word has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/text_extract.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cd840d6256db890eb3454eee420880ba5ef4283cab763b30b2db80a2c9b4fc"}},{"ruleId":"D1","level":"warning","message":{"text":"VisibleMarkdown::inline_math (cyclomatic 16): VisibleMarkdown::inline_math has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/redaction_projection.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eaa482b9a01abb01c186929e7eb2e322fa98f387a51451d1cf67838a4166db"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::core::pipeline::features::attach_chunk_vectors (cyclomatic 16): xberg::core::pipeline::features::attach_chunk_vectors has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"279c1c448fe0b0a4f2d38cc29827597373f1592799f3485af6bb28cb4a5a6de7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::derive::compute_formatted_content_observed (cyclomatic 16): xberg::extraction::derive::compute_formatted_content_observed has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: xberg::extraction::derive::element_to_node_content (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf67024ead1b34832bcfaff3f6af6be31bda81ff5eba1eec32ea0b182e019cf"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::docx::table::parse_cell_margins_element (cyclomatic 16): xberg::extraction::docx::table::parse_cell_margins_element has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"786198c3cca5e1b5027d666c6d5f7199ab3bdd126decb4a3ea1b14b136a0bcaf"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::ods::drop_skipped_sheets (cyclomatic 16): xberg::extraction::excel::table_budget::ods::drop_skipped_sheets has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/ods.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"758eebcf91887d0dc7ba195b65ba45ebb14e1afff43176074afa7dc826974fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::image::tiff_pixel_density_dpi (cyclomatic 16): xberg::extraction::image::tiff_pixel_density_dpi has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2304f6aa2b9b1af913a7638de40a977b4f3263b7ddf725ae98a2ec407782db8"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::image_format::detect_image_format (cyclomatic 16): xberg::extraction::image_format::detect_image_format has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_format.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee38e595568f42791ecfef5d4cbfb9e43cbf39312fc56ca90323a89e0e1ae7ac"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::image_ocr::embedded_rows::assemble (cyclomatic 16): xberg::extraction::image_ocr::embedded_rows::assemble has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_ocr/embedded_rows.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8612f0adbcbb66ae5839f09688bd482041b4e67be48d922665dec5fc428b2a75"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extraction::mathml::render::render_text_content (cyclomatic 16): xberg::extraction::mathml::render::render_text_content 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. This is NOT this file\u0027s highest cyclomatic complexity: xberg::extraction::mathml::render::script_mark (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml/render.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee693e9c2223b9b088c37b569c4acb2da6ecb36e29a3a3523d7c82c7a95f80"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docbook::collect_id_titles (cyclomatic 16): xberg::extractors::docbook::collect_id_titles has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"22165001d033d301e3261daf355d5bb3373fa5ed7536693d3a645ec43617c78f"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::docbook::extract_figure_with_caption (cyclomatic 16): xberg::extractors::docbook::extract_figure_with_caption has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c7f778261a7c07530649e8d9a971e07ee849044dccd3df5df14214d3a6bf97"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::epub::content::strip_html_tags (cyclomatic 16): xberg::extractors::epub::content::strip_html_tags has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"98649e4463a43fc5dda18fc492894008d6b9c0ba3794febb1c78527f9bff9be7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::odt::build_style_map (cyclomatic 16): xberg::extractors::odt::build_style_map has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d52fe8d93056cbeb06df7800917df59961ae24a1ef63133bba3d7e50e31b57a"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::inline_khmer_anchor (cyclomatic 16): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::inline_khmer_anchor has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1892f785c322b005be87566149d9ac1270699cf5206f3843af75c73a136ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::line_insertion (cyclomatic 16): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::line_insertion has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ea7bd03c5da223943d2073643f7be1599737f257a436ee79b41ec7566671b7"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::tall_source::samples::decode_source_gray (cyclomatic 16): xberg::extractors::pdf::ocr::tall_source::samples::decode_source_gray has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source/samples.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe18545d95dcaab74bafd878071002e457be69268fc56a81391474109738988"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::rtf::parser::control_word::handle_u_control_word (cyclomatic 16): xberg::extractors::rtf::parser::control_word::handle_u_control_word has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/control_word.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f2540fa3360bf00295371d075484966a2525f4a3253e1f5f7f14bf2fea0e1f"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::extractors::structured::scan_geojson_geometry (cyclomatic 16): xberg::extractors::structured::scan_geojson_geometry has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/structured.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe9e63185a7489d28861048e4327c036d7d7375dd50a2d3aa6273a1c913b45d"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::layout::postprocessing::heuristics::pick_removal (cyclomatic 16): xberg::layout::postprocessing::heuristics::pick_removal has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/postprocessing/heuristics.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"06427d234513b893f1ecdbf20046770adb903619ecf5a310800f3dbfda16b2a1"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::ocr::preprocessing::preprocess_pix (cyclomatic 16): xberg::ocr::preprocessing::preprocess_pix has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/preprocessing.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04b11adf0f19e2fdc3e8900dea7b7bb78b39bda1409398c66b8d4a1c2a5b6ad"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::assembly::assemble_internal_document (cyclomatic 16): xberg::pdf::structure::assembly::assemble_internal_document has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"696465ac89bfbeb788bfc3d46fee32ca7158b981f9ec25576af323dfd2010776"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::assembly::reconcile_certified_table_paragraphs (cyclomatic 16): xberg::pdf::structure::assembly::reconcile_certified_table_paragraphs has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4a1c4c6e5ca491a591fb6392100c28ac3322071a57029640cecf8a9d34f413"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::classify_isolated_folio_header (cyclomatic 16): xberg::pdf::structure::pipeline::classify_isolated_folio_header has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7461}}}],"partialFingerprints":{"codehealthFindingId/v1":"706b8f0810ba70fd863b6ebd82a9f0977e6d7b851cfc2ff57af0b282ba049d31"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::prose_two_column_gutter (cyclomatic 16): PdfDocument::prose_two_column_gutter has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd9eab9e7698ddd545c9327d16c70a28f4e63ee8be497afccf9e5dcf8567b16"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfDocument::walk_form_xobject_tree_for_inks (cyclomatic 16): PdfDocument::walk_form_xobject_tree_for_inks has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d00eae61c5f6bbf254fd84cde8f6ea8bce5a7a774d8450786c247f3ce2b399"}},{"ruleId":"D1","level":"warning","message":{"text":"TjBuffer::append (cyclomatic 16): TjBuffer::append has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2537bd1ded4ca4139589a67851d16dfe34ba71735ddf0c14532b091324c237"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::capture_cmsy_witness (cyclomatic 16): TextExtractor::capture_cmsy_witness has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1f59901f0cc5e6c535228bc24d34a4adf93fbf4629a2448dc8cdc2a606ee78"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::apply_set_fill_color_n (cyclomatic 16): TextExtractor::apply_set_fill_color_n 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. This shape REPEATS in the file: one other method here (TextExtractor::apply_set_stroke_color_n) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/operators.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a59a36a14c221c918959bebacc37a98ae7d140419a1443420f6887fa93e89ed"}},{"ruleId":"D1","level":"warning","message":{"text":"TextExtractor::apply_set_stroke_color_n (cyclomatic 16): TextExtractor::apply_set_stroke_color_n 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. This shape REPEATS in the file: one other method here (TextExtractor::apply_set_fill_color_n) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/operators.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"32264b4951484c07471051d70e2ff6add7ab9b4beba46facc2d137a930298f77"}},{"ruleId":"D1","level":"warning","message":{"text":"PageRenderer::mirror_cmyk_paint_into_sidecar_with_coverage (cyclomatic 16): PageRenderer::mirror_cmyk_paint_into_sidecar_with_coverage has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8463caed4be896cdf0d99cdddb2b8973123c61e9737dbc79041cad86d9f618db"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::decoders::ccitt::decode (cyclomatic 16): xberg_native_pdf::decoders::ccitt::decode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfff776360f7074078dc023300f8b3d505c9d2a2f1674549721772b36900ef74"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::fonts::cff_encoding::parse_cff_gid_mapping (cyclomatic 16): xberg_native_pdf::fonts::cff_encoding::parse_cff_gid_mapping has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc143deca675a7e8056cbfac0ef8d1abe08257fbeda23e3000d12f069935e8"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::has_split_modal_column_groups (cyclomatic 16): xberg_native_pdf::structure::spatial_table_detector::has_split_modal_column_groups has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca33fb70c5c726885bb37bda2903794a2d3a286545761b7692be7c6a3904b30"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_header_row_above (cyclomatic 16): xberg_native_pdf::structure::spatial_table_detector::detect_header_row_above has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0bb8d143bd2d2f305d4e8b4c56442e0603898094acd32b74dae3810f38c095"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_with_unmodified_paths (cyclomatic 16): xberg_native_pdf::structure::spatial_table_detector::detect_with_unmodified_paths has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4932}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7263dc8523efb535fe8a04aa51cb54b95b91240e2212318d9e47f695befdce"}},{"ruleId":"D1","level":"warning","message":{"text":"xberg_native_pdf::text::bidi::wrap_rtl_isolates (cyclomatic 16): xberg_native_pdf::text::bidi::wrap_rtl_isolates has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/bidi.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d7784327acb014f790ec14d748598f820dbfc2b1594b4a018934294fb31d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"_Index.shape (cyclomatic 16): _Index.shape 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":"tools/benchmark-harness/caption_export/src/caption_export/subblock.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45a2323bbd2b319c042b460210ffe6003886a89346412775cb83dd8e2e34320"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::extract_mixed_ocr_native_with_layout_inputs (cognitive 634): xberg::extractors::pdf::ocr::pipeline::extract_mixed_ocr_native_with_layout_inputs has cognitive complexity 634 (threshold 15). Drivers by points: if/else 175 (442 pts), boolean chains 73, loops 34 (68 pts), match/switch 18 (51 pts) (nesting depth added 334). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3a154ce43d07b9c58141f8160aceaa3d786e7534fdfadee8a7f1916a725604"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::extract_with_ocr_for_page (cognitive 566): xberg::extractors::pdf::ocr::pipeline::extract_with_ocr_for_page has cognitive complexity 566 (threshold 15). Drivers by points: if/else 181 (413 pts), boolean chains 95, loops 22 (42 pts), match/switch 7 (16 pts) (nesting depth added 261). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":5138}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4608accbb8812154799137808b4517a2078caa5db82f991ec91df8a5435a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownExtractor::build_internal_document_with_jsx (cognitive 466): MarkdownExtractor::build_internal_document_with_jsx has cognitive complexity 466 (threshold 15). Drivers by points: if/else 172 (414 pts), boolean chains 29, match/switch 7 (21 pts), loops 2 (nesting depth added 256). Of this number, 465 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":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecca1dc9ca51060ffb80fbbbc4301952177d8d096e28180cc001e0d98c370145"}},{"ruleId":"D2","level":"warning","message":{"text":"RstExtractor::build_internal_document_within (cognitive 417): RstExtractor::build_internal_document_within has cognitive complexity 417 (threshold 15). Drivers by points: if/else 103 (272 pts), loops 27 (81 pts), boolean chains 64 (nesting depth added 223). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6cb174bb8902dee00f02b4803933c3404acbf278bbacd678a578ee6190fa95"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::execute_operators_with_backdrop (cognitive 399): PageRenderer::execute_operators_with_backdrop has cognitive complexity 399 (threshold 15). Drivers by points: if/else 114 (355 pts), match/switch 10 (31 pts), boolean chains 12, loops 1 (nesting depth added 262). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c63c8b88d18220c96894f87a8c78899db78dc630cefff8fe3a28fa0c050444a"}},{"ruleId":"D2","level":"warning","message":{"text":"DocxParser::parse_body_elements (cognitive 395): DocxParser::parse_body_elements has cognitive complexity 395 (threshold 15). Drivers by points: if/else 84 (307 pts), loops 9 (49 pts), match/switch 6 (20 pts), boolean chains 19 (nesting depth added 277). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"564d09e92fd03c39ce8a690311c67a1c18a58527cacd7d494a64843c42c1cec9"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfExtractor::extract_core_native_with_layout_pages (cognitive 332): PdfExtractor::extract_core_native_with_layout_pages has cognitive complexity 332 (threshold 15). Drivers by points: if/else 121 (232 pts), match/switch 12 (35 pts), loops 17 (34 pts), boolean chains 31 (nesting depth added 151). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"c261a929ae67ffa9c5054a0d14872f4616cb91d3d808608a65e7ce12b53f05e9"}},{"ruleId":"D2","level":"warning","message":{"text":"DjotExtractor::build_internal_document (cognitive 329): DjotExtractor::build_internal_document has cognitive complexity 329 (threshold 15). Drivers by points: if/else 138 (313 pts), boolean chains 8, match/switch 3 (7 pts), loops 1 (nesting depth added 179). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9bd88dde47a786b5b0ac9062a6216240b0c8b141b658fe1a521368bfa4f978"}},{"ruleId":"D2","level":"warning","message":{"text":"OrgModeExtractor::build_internal_document (cognitive 324): OrgModeExtractor::build_internal_document has cognitive complexity 324 (threshold 15). Drivers by points: if/else 74 (242 pts), loops 15 (45 pts), boolean chains 32, match/switch 1 (5 pts) (nesting depth added 202). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92c70fe9f4da7828bad90c42679a8bf64877a1064b4edc24955a8e4eecdc280"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::assemble_text_from_spans (cognitive 311): PdfDocument::assemble_text_from_spans has cognitive complexity 311 (threshold 15). Drivers by points: if/else 71 (206 pts), loops 21 (80 pts), boolean chains 22, match/switch 1 (3 pts) (nesting depth added 196). Of this number, 282 points are the body\u0027s own statements and 29 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/text_assembly.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1040f23409ab33add53ba8384a243382ffc85da69cc8cb902c7bf28f34fa45a7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docx::build_internal_document (cognitive 262): xberg::extractors::docx::build_internal_document has cognitive complexity 262 (threshold 15). Drivers by points: if/else 54 (167 pts), loops 22 (78 pts), match/switch 4 (10 pts), boolean chains 7 (nesting depth added 175). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"166fa40fa971e689f6320238ab6312c2ae69489b590b87a270f0e70020a1f87b"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_image (cognitive 262): PageRenderer::render_image has cognitive complexity 262 (threshold 15). Drivers by points: if/else 47 (161 pts), loops 8 (53 pts), match/switch 8 (42 pts), boolean chains 6 (nesting depth added 193). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3654}}}],"partialFingerprints":{"codehealthFindingId/v1":"881a74e0c4bc4c6f52e51565dc220877a2c327a3e9c2180948644e82b13e4b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::execute_operator_with_paint_restarts (cognitive 209): TextExtractor::execute_operator_with_paint_restarts has cognitive complexity 209 (threshold 15). Drivers by points: if/else 61 (175 pts), match/switch 6 (15 pts), boolean chains 12, loops 2 (7 pts) (nesting depth added 128). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/operators.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d71841d670d0197b6400a0f17f799823709a83b290d399d32c6d097767d6d4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::post_process_table_inner (cognitive 202): xberg::pdf::table_reconstruct::post_process_table_inner has cognitive complexity 202 (threshold 15). Drivers by points: if/else 75 (144 pts), boolean chains 34, loops 13 (24 pts) (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a048e1563a4c4873f0153270dcb4f5ab634494fa7d5a67988e297dc0b3cd351d"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::char_to_unicode_uncached (cognitive 200): FontInfo::char_to_unicode_uncached has cognitive complexity 200 (threshold 15). Drivers by points: if/else 64 (162 pts), boolean chains 34, match/switch 3 (4 pts) (nesting depth added 99). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":4376}}}],"partialFingerprints":{"codehealthFindingId/v1":"38851c7d088e5f9f69e8af0d0b6a576747c0a571b92b2f8dba12ff22c1304e50"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::build_document_structure_with_native (cognitive 199): xberg::pdf::structure::pipeline::build_document_structure_with_native has cognitive complexity 199 (threshold 15). Drivers by points: if/else 63 (154 pts), loops 14 (28 pts), match/switch 3 (11 pts), boolean chains 6 (nesting depth added 113). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cac23e62353ddae0d39790bb4b895c8014b88a0518030da97be4ef18871742a"}},{"ruleId":"D2","level":"warning","message":{"text":"TypstExtractor::build_internal_document (cognitive 192): TypstExtractor::build_internal_document has cognitive complexity 192 (threshold 15). Drivers by points: if/else 55 (146 pts), loops 7 (20 pts), match/switch 8 (18 pts), boolean chains 8 (nesting depth added 114). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cefad4371faf516ac16fe6205fb6b64cda4def32b5aa5e43a772cb046d04965"}},{"ruleId":"D2","level":"warning","message":{"text":"TextRasterizer::render_unicode_text (cognitive 183): TextRasterizer::render_unicode_text has cognitive complexity 183 (threshold 15). Drivers by points: if/else 59 (165 pts), boolean chains 10, loops 3 (8 pts) (nesting depth added 111). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf958ff9aecf26c4e705934a9a2038bdac6c0361b0b95a32ec9022998e8d12c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::jats::elements::extract_jats_all_in_one (cognitive 175): xberg::extractors::jats::elements::extract_jats_all_in_one has cognitive complexity 175 (threshold 15). Drivers by points: if/else 34 (128 pts), loops 6 (21 pts), match/switch 5 (17 pts), boolean chains 9 (nesting depth added 121). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3091f2793aafe797aebd374d1caf9112fee6ecee25c1d8eb68fbf50cc285852"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::execution::perform_ocr (cognitive 175): xberg::ocr::processor::execution::perform_ocr has cognitive complexity 175 (threshold 15). Drivers by points: if/else 75 (128 pts), match/switch 13 (26 pts), boolean chains 19, loops 1 (2 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"307f1353100473f7196d74c0c34c4007cba60bd641d0fb7b4350bb7b49f301a5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::build_comrak_ast_with_table_mode (cognitive 170): xberg::rendering::comrak_bridge::build_comrak_ast_with_table_mode has cognitive complexity 170 (threshold 15). Drivers by points: if/else 48 (120 pts), match/switch 8 (26 pts), boolean chains 12, loops 6 (12 pts) (nesting depth added 96). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef83f78a9110f914b754a7db6bb4f181b88140f135706fd319cc015ca2cabb2"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::append_advance_buffer (cognitive 168): TextExtractor::append_advance_buffer has cognitive complexity 168 (threshold 15). Drivers by points: if/else 36 (117 pts), loops 9 (43 pts), boolean chains 8 (nesting depth added 115). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb3fe21da4784c325fa5e3fad86d18de2490ef6157fc28a72e20d7306eee586"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::build_internal_elements (cognitive 158): xberg::extractors::odt::build_internal_elements has cognitive complexity 158 (threshold 15). Drivers by points: if/else 24 (104 pts), loops 12 (42 pts), match/switch 3 (11 pts), boolean chains 1 (nesting depth added 118). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3d889b863ba0e36ff4fbf0441de2f899aa9cd5477ff8b7e2c7a873ce6645c8"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::extract_metadata (cognitive 149): FictionBookExtractor::extract_metadata has cognitive complexity 149 (threshold 15). Drivers by points: if/else 40 (127 pts), loops 4 (12 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 100). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3bc5ea596b8d9462e4218b5097ef42762a05d44703f54d807cc5d24b91e61e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docbook::parse_docbook_single_pass (cognitive 147): xberg::extractors::docbook::parse_docbook_single_pass has cognitive complexity 147 (threshold 15). Drivers by points: if/else 33 (127 pts), boolean chains 8, match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 101). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edbc7475dedd441635a17aa7dfc48fbdfdbba5ae0820c6999c80c8ff7803755"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::jats::build_jats_internal_document (cognitive 145): xberg::extractors::jats::build_jats_internal_document has cognitive complexity 145 (threshold 15). Drivers by points: if/else 23 (97 pts), loops 6 (22 pts), match/switch 5 (17 pts), boolean chains 9 (nesting depth added 102). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9cae6fd39bc304f175666255e1498dc6e83ae10767c647b1505ac6ef33816c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::execute_separation_operators (cognitive 138): xberg_native_pdf::rendering::separation_renderer::execute_separation_operators has cognitive complexity 138 (threshold 15). Drivers by points: if/else 46 (125 pts), match/switch 5 (10 pts), boolean chains 2, loops 1 (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39c946b8b55015281601d32568f5279ca5dd78330ae770fc71838f9551cd5b3"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::append_and_advance (cognitive 135): TextExtractor::append_and_advance has cognitive complexity 135 (threshold 15). Drivers by points: if/else 26 (86 pts), loops 9 (41 pts), boolean chains 8 (nesting depth added 92). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bc844e4d266e1dc052d6c1b9db87f3a16b3dad3fddeeeec34903367ca8c3ff"}},{"ruleId":"D2","level":"warning","message":{"text":"RstExtractor::extract_text_from_rst (cognitive 131): RstExtractor::extract_text_from_rst has cognitive complexity 131 (threshold 15). Drivers by points: if/else 28 (84 pts), loops 8 (24 pts), boolean chains 23 (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af96c02127d9d6c0e779636a78b19872e4ec93f936fa29ded9d2fc7925b9547"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::merge_adjacent_spans (cognitive 129): TextExtractor::merge_adjacent_spans has cognitive complexity 129 (threshold 15). Drivers by points: if/else 38 (96 pts), boolean chains 28, match/switch 2 (4 pts), loops 1 (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_merging.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6600a37b3e69d4fbdef2e5af8c289eefe508abe710b9529e30a63572076199"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::process_xobject (cognitive 124): TextExtractor::process_xobject has cognitive complexity 124 (threshold 15). Drivers by points: if/else 40 (95 pts), boolean chains 17, match/switch 7 (12 pts) (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/xobjects.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"911f195209e8dfb9e476de4d08a67137603d68478aa52de76489f24ef5575ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::load_fonts (cognitive 122): PdfDocument::load_fonts has cognitive complexity 122 (threshold 15). Drivers by points: if/else 29 (89 pts), loops 5 (19 pts), match/switch 3 (11 pts), boolean chains 3 (nesting depth added 82). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"270743571fa97f49392ef2bed5fc7fe79eca0eddac2aa539b46c144a099c9509"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_widget_spans (cognitive 119): PdfDocument::extract_widget_spans has cognitive complexity 119 (threshold 15). Drivers by points: if/else 23 (59 pts), match/switch 21 (48 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"319248c26af3a59551fab3912748faa198b45a7bd816555b7c4e996ccbfc7229"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexExtractor::build_internal_document (cognitive 118): LatexExtractor::build_internal_document has cognitive complexity 118 (threshold 15). Drivers by points: if/else 29 (98 pts), boolean chains 11, loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 74). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3464e24eb559faf0d1afb35a203f8b4f432d2abbee61394ea220c0f73d026fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docbook::extract_para_with_annotations (cognitive 114): xberg::extractors::docbook::extract_para_with_annotations has cognitive complexity 114 (threshold 15). Drivers by points: if/else 20 (70 pts), loops 8 (28 pts), match/switch 3 (10 pts), boolean chains 6 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d75936fea4989da7f50b25eaadaedac8b30937f65bcad07fa92388560af3df"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_embedded_fonts_with_unicode_maps_and_widths (cognitive 114): PdfDocument::extract_embedded_fonts_with_unicode_maps_and_widths has cognitive complexity 114 (threshold 15). Drivers by points: if/else 23 (68 pts), loops 9 (32 pts), match/switch 4 (13 pts), boolean chains 1 (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"739ce80ea1c092a3cff507e4383910137c864a668194408fd5f33d6395e45462"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::build_internal_document (cognitive 113): FictionBookExtractor::build_internal_document has cognitive complexity 113 (threshold 15). Drivers by points: if/else 26 (59 pts), match/switch 7 (26 pts), boolean chains 17, loops 5 (11 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c987f334d185a488cc727a1c56d5bf303be9ecb66b01c4f9fcfc194b16c9421b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docbook::extract_element_text_with_inline (cognitive 109): xberg::extractors::docbook::extract_element_text_with_inline has cognitive complexity 109 (threshold 15). Drivers by points: if/else 20 (65 pts), loops 7 (28 pts), match/switch 3 (10 pts), boolean chains 6 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c128fb074cc7f3bbf15a5c64f87d00e2f95240e6499df60f83eb65c3fd2dd29f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::classify_paragraphs (cognitive 109): xberg::pdf::structure::classify::classify_paragraphs has cognitive complexity 109 (threshold 15). Drivers by points: if/else 41 (77 pts), boolean chains 29, loops 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e34ba074bb78d6a25de7670d715503a8753a43082db48b0445479b476241c"}},{"ruleId":"D2","level":"warning","message":{"text":"EpubExtractor::build_internal_document (cognitive 106): EpubExtractor::build_internal_document has cognitive complexity 106 (threshold 15). Drivers by points: if/else 29 (83 pts), match/switch 4 (10 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b2cd196ef85a9804399b192c71810227dd57d170e4cd995c8b9d06c259611d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::djot::render_djot (cognitive 105): xberg::rendering::djot::render_djot has cognitive complexity 105 (threshold 15). Drivers by points: if/else 32 (77 pts), loops 6 (12 pts), match/switch 4 (12 pts), boolean chains 4 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"366c9bfbdb75e84b047c870793b120989af9be3bfd7ab52472fd9e418ed3ac3a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docbook::build_docbook_internal_document (cognitive 101): xberg::extractors::docbook::build_docbook_internal_document has cognitive complexity 101 (threshold 15). Drivers by points: if/else 19 (76 pts), loops 4 (13 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4139fa04bedb8575c598f8a2c2d6c61564b758db232ac962216d83f25ca73c59"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::extraction::extract_all_from_native_document (cognitive 98): xberg::extractors::pdf::extraction::extract_all_from_native_document has cognitive complexity 98 (threshold 15). Drivers by points: if/else 37 (56 pts), boolean chains 21, match/switch 5 (11 pts), loops 4 (10 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6422398f543a8525179d7db291bb28cee8dd9ec3bea8ca57386476e0cbc542b7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::jats::parser::extract_citation_text (cognitive 88): xberg::extractors::jats::parser::extract_citation_text has cognitive complexity 88 (threshold 15). Drivers by points: if/else 28 (67 pts), match/switch 4 (13 pts), loops 2 (5 pts), boolean chains 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":"crates/xberg/src/extractors/jats/parser.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ed44d296d6d114ddb56fb7ca0c534a8a89f99f0fc9ef65453344135cde1a36"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::hocr_parser::parse_paragraph (cognitive 87): xberg::ocr::hocr_parser::parse_paragraph has cognitive complexity 87 (threshold 15). Drivers by points: if/else 44 (76 pts), boolean chains 8, loops 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebb08608c9159f2c872df230619c5c24741419ded3359b7c88d54191a5b21c9"}},{"ruleId":"D2","level":"warning","message":{"text":"RtfExtractor::build_internal_document (cognitive 86): RtfExtractor::build_internal_document has cognitive complexity 86 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 13 (39 pts), boolean chains 5 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f10cb4e40c3fa1e1db9be95234a644de6bb9b884990ea345f7dd01cf297f18d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::functions::execute (cognitive 86): xberg_native_pdf::functions::execute has cognitive complexity 86 (threshold 15). Drivers by points: if/else 25 (64 pts), match/switch 6 (13 pts), boolean chains 8, loops 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/functions/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"617d23fd23ab3b5b08007c5b795885bbaee0e90b43835a7985a3d7b70a7139ee"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_page_tables (cognitive 84): PdfDocument::extract_page_tables has cognitive complexity 84 (threshold 15). Drivers by points: if/else 25 (57 pts), boolean chains 11, loops 2 (10 pts), match/switch 3 (6 pts) (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad69babe06df83a45701e36655a99186d2a1e897211bfe152b458672f77e14d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::hwpx::build_hwpx_internal_document (cognitive 83): xberg::extractors::hwpx::build_hwpx_internal_document has cognitive complexity 83 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 7 (24 pts), match/switch 2 (9 pts), boolean chains 4 (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":"crates/xberg/src/extractors/hwpx.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a36d6c034aabef7d8245958b878ae85e9f8034fc6b18d4b3c83a04e2517834b"}},{"ruleId":"D2","level":"warning","message":{"text":"DocxExtractor::extract_content (cognitive 82): DocxExtractor::extract_content has cognitive complexity 82 (threshold 15). Drivers by points: if/else 45 (58 pts), loops 6 (16 pts), boolean chains 6, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd33bda46ecb06071add83832bf0494dacd7d65e8da8eca3057b97104ffa4190"}},{"ruleId":"D2","level":"warning","message":{"text":"RstExtractor::parse_inline_markup (cognitive 82): RstExtractor::parse_inline_markup has cognitive complexity 82 (threshold 15). Drivers by points: if/else 23 (65 pts), boolean chains 16, loops 1 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf91bd3bac317a787f2e75c5a68e3be052ef32d9f39402ba4603d7c68120321"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexExtractor::process_content_line (cognitive 81): LatexExtractor::process_content_line has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (60 pts), loops 5 (14 pts), boolean chains 7 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9d5f875c79ed9205e3cbde6624e6053c54f0b6740a3a968dd87d5c208d1d92"}},{"ruleId":"D2","level":"warning","message":{"text":"XfaParser::parse_template (cognitive 81): XfaParser::parse_template has cognitive complexity 81 (threshold 15). Drivers by points: if/else 18 (63 pts), match/switch 4 (13 pts), boolean chains 4, loops 1 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xfa/parser.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a717d33507f5bd57482f0467a078f1ae6f8aa3048f5e184406c8856e7ace9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_xobject (cognitive 80): PageRenderer::render_xobject has cognitive complexity 80 (threshold 15). Drivers by points: if/else 16 (73 pts), match/switch 1 (7 pts) (nesting depth added 63). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3b47287b3fdf5d7b9bef4363d405095e41d118cdc20f88819169cae1ddd5e8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::forward_scan_ctm (cognitive 79): xberg_native_pdf::content::parser::forward_scan_ctm has cognitive complexity 79 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 8 (19 pts), boolean chains 12, match/switch 2 (7 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8852f6b78877a0bf56e5d14112fc4d4685eff8fe30f642b498a9d795a985148"}},{"ruleId":"D2","level":"warning","message":{"text":"TypstParser::extract_content (cognitive 78): TypstParser::extract_content has cognitive complexity 78 (threshold 15). Drivers by points: if/else 24 (59 pts), boolean chains 7, loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9170109036defc6277d8b75ac3dbd01679e6b6cb71f9851109bd8f1c670fa711"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::text::should_insert_space (cognitive 78): xberg_native_pdf::extractors::text::should_insert_space has cognitive complexity 78 (threshold 15). Drivers by points: if/else 37 (57 pts), boolean chains 21 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccbf2e6979008e556e000cd2d3935f3cb357211f745aeec15ed0ee29142de64"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_text_structure_order_cached_with_spans (cognitive 77): PdfDocument::extract_text_structure_order_cached_with_spans has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (58 pts), loops 7 (13 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f68f1cf6f02d661ade55803785e19a790ffa659980e5ed6f8cf9da60b6052"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::images::extract_image_from_xobject (cognitive 77): xberg_native_pdf::extractors::images::extract_image_from_xobject has cognitive complexity 77 (threshold 15). Drivers by points: if/else 37 (59 pts), boolean chains 10, match/switch 3 (8 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91ec138b0275f5c82d4867ab37f6d52a7819a3f456b8ae438b26f5c6a4949f4"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::topological_block_order (cognitive 76): PdfDocument::topological_block_order has cognitive complexity 76 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 14 (19 pts), boolean chains 13 (nesting depth added 24). Of this number, 75 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30485449e78a17ebc2441ade0c76ec8301ef9bd9a94111c8c0a925045d76428"}},{"ruleId":"D2","level":"warning","message":{"text":"Paragraph::runs_to_markdown_with_math (cognitive 75): Paragraph::runs_to_markdown_with_math has cognitive complexity 75 (threshold 15). Drivers by points: if/else 21 (60 pts), loops 4 (9 pts), boolean chains 6 (nesting depth added 44). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d983677cc1ddeb7322e5f3982856730e36250c521754352de70d64292ff3bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_text_operator_fast (cognitive 75): xberg_native_pdf::content::parser::parse_text_operator_fast has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (46 pts), match/switch 4 (13 pts), boolean chains 10, loops 3 (6 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":4175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2d2884618bc197c56c09f6908716773c62e41c271abced0c16f239b6d1052f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::scan_graphics_region (cognitive 75): xberg_native_pdf::content::parser::scan_graphics_region has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (41 pts), match/switch 5 (16 pts), boolean chains 9, loops 4 (9 pts) (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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":4367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e616b9e9c4b28f33dca37a0b8a2c103a21b5e91268cc64d3e108f9e3c7dc3e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::latex::commands::process_command (cognitive 74): xberg::extractors::latex::commands::process_command has cognitive complexity 74 (threshold 15). Drivers by points: if/else 26 (58 pts), loops 4 (11 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 40). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/commands.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f1e397183e990ef8a9c6708c42b34c00229bddba7a92006e946470b92d3444"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::run_ocr_pipeline_stages (cognitive 73): xberg::extractors::pdf::ocr::pipeline::run_ocr_pipeline_stages has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (56 pts), boolean chains 8, loops 3 (6 pts), match/switch 2 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":9815}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cddf7fa80d4324899b9933c172a13d4ee1e089f0099f73e32bceead51b6c73"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::from_dict (cognitive 73): FontInfo::from_dict has cognitive complexity 73 (threshold 15). Drivers by points: if/else 41 (54 pts), match/switch 5 (11 pts), boolean chains 8 (nesting depth added 19). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4335c9dfb81091792076697d18b7bcdb235f209c174ee0c81f2498dc9a6fab8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_tables_in_cluster (cognitive 73): xberg_native_pdf::structure::spatial_table_detector::detect_tables_in_cluster has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 8 (25 pts), boolean chains 9 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aabd75c1dcf8642485d8244ecc9c3574dbc0961c885d99fdb01b5b61178142"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::extract_paragraph_with_annotations (cognitive 70): FictionBookExtractor::extract_paragraph_with_annotations has cognitive complexity 70 (threshold 15). Drivers by points: if/else 11 (41 pts), match/switch 4 (13 pts), loops 4 (11 pts), boolean chains 5 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a67c43051d88ff84dc529e724b2248106a675feefde4936aad8cc1ced4c0b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::ppt::extract_texts_from_records (cognitive 69): xberg::extraction::ppt::extract_texts_from_records has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (51 pts), match/switch 3 (9 pts), boolean chains 6, loops 3 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d2ea2020486a3e33e5627ee8193850a3c009aaca27dc31605993a898a72912"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::split_rows_by_text_positions (cognitive 69): xberg_native_pdf::structure::spatial_table_detector::split_rows_by_text_positions has cognitive complexity 69 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 12 (29 pts), boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44708c832df715e7af826968d25c5dfa955b7a566a651035855f279103d1dba"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::process_form_xobject_paths (cognitive 68): PdfDocument::process_form_xobject_paths has cognitive complexity 68 (threshold 15). Drivers by points: if/else 28 (48 pts), match/switch 9 (15 pts), loops 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":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7999cdecad647e37784c19921164f800c93d1d7d06b71a1157d70204427fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::merge_sub_superscript_spans (cognitive 68): PdfDocument::merge_sub_superscript_spans has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (44 pts), boolean chains 13, loops 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"32201bd745670bfbb93f29f1de4f7f710006c55c47206a3246478f3fbceb19c8"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_form_xobject_with_invocation (cognitive 68): PageRenderer::render_form_xobject_with_invocation has cognitive complexity 68 (threshold 15). Drivers by points: if/else 32 (59 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52d7f2389d33c884d02af2940070586f974ec8001eeafdc95e81dac8a1eba00"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::append_non_widget_annotation_text (cognitive 67): PdfDocument::append_non_widget_annotation_text has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (45 pts), match/switch 9 (16 pts), boolean chains 5, loops 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a9067c22b1aa001e35aa766315c8396dab59ee4e5b1bbcca3601074c02bf93"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_content_stream_paths_only (cognitive 66): xberg_native_pdf::content::parser::parse_content_stream_paths_only has cognitive complexity 66 (threshold 15). Drivers by points: if/else 10 (27 pts), match/switch 7 (23 pts), loops 4 (9 pts), boolean chains 7 (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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd45e588b0050f4c95d8e5240f71648cdac2f1dc3b1c8c128001a3048419ad00"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::resolve_overlaps (cognitive 64): xberg::pdf::structure::pipeline::resolve_overlaps has cognitive complexity 64 (threshold 15). Drivers by points: if/else 15 (59 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":6210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96863ece7ddd816abde969609398b1ad1f496703dd632abca803d6700f8e43d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::parser::parse_k_children (cognitive 63): xberg_native_pdf::structure::parser::parse_k_children has cognitive complexity 63 (threshold 15). Drivers by points: if/else 10 (36 pts), match/switch 8 (24 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 43). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8edbeda4dc20d5552083853efbaad242ebd42714d84485c5b4a0fdd724745c4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_horizontal_rules (cognitive 63): xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_horizontal_rules has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 6 (10 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85f07489efc1c8a1c2ea43d6e8ecc14ffa54a22a20d1ecc9765a6a6a6443a0e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::run_pipeline_impl (cognitive 62): xberg::core::pipeline::run_pipeline_impl has cognitive complexity 62 (threshold 15). Drivers by points: if/else 31 (35 pts), match/switch 5 (13 pts), boolean chains 10, loops 1 (4 pts) (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a01849e508867ebd91bb5d7fb2805d8b4bfea52e34059e20f94fdafe14f9d09"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::resolve_encoding_fields (cognitive 62): FontInfo::resolve_encoding_fields has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (47 pts), loops 3 (10 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 35). Of this number, 59 points are the body\u0027s own statements and 3 belong 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":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c14c7b866dcb6bd0c598f9ffa5a20a5e3f1d6da8e1901845f6121ff83f5addc"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::is_well_formed_table_core (cognitive 60): xberg::pdf::table_reconstruct::is_well_formed_table_core has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 12, loops 4 (11 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":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c22e0f6ed7bfddef164447c0bc8860d8b5e9faae87b15f2909aa16e644a7743"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::show_text (cognitive 60): TextExtractor::show_text has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (49 pts), boolean chains 8, loops 2 (3 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":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a629b2f607fd6e2d175b2d4cf095b6a3c5d2d616f3923083318bb1f8de16e0"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::blocks_to_paragraphs (cognitive 59): xberg::pdf::structure::pipeline::blocks_to_paragraphs has cognitive complexity 59 (threshold 15). Drivers by points: boolean chains 33, if/else 14 (25 pts), loops 1 (nesting depth added 11). 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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6061b7689e871837ae30d6c9a7f6b8b7324a697a33ee6fa4e3e4c03f62cfdd"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::assemble_positioned_words (cognitive 59): PdfDocument::assemble_positioned_words has cognitive complexity 59 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 11, loops 6 (11 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cb2c9b98624184364d3369971f5494a6861fc2f390418b74767cb4484cd047"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_text_lines_inner (cognitive 59): PdfDocument::extract_text_lines_inner has cognitive complexity 59 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 9 (16 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1d86e3362e1959fa68036a96c707567eb3f2a78980c30f12da51958e6f0a72"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::extract_links (cognitive 58): FictionBookExtractor::extract_links has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (40 pts), loops 3 (9 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"225a60fd0fa16d19919152a945e5fc9c40c1459b6ded71ae111617af60de7eae"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::recognize_pdf_formula_page_inputs (cognitive 58): xberg::extractors::pdf::recognize_pdf_formula_page_inputs has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (41 pts), boolean chains 9, loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"031304e85494aedee8ee6dd6073f525b0986a92d736f165bfee408d2be8974ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::render_text (cognitive 58): Table::render_text has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 9 (13 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":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"00609fb36efd317028765612965e6098ae8a7599a5abdd2cf75cb876a8f50d77"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexExtractor::strip_inline_commands_with_symbols (cognitive 57): LatexExtractor::strip_inline_commands_with_symbols has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 4 (13 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":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab5bb6c41779bfb6a8382ca452bb481212afab81efa81dcddcf64756b0ae601"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::jats::extract_para_with_annotations_jats (cognitive 57): xberg::extractors::jats::extract_para_with_annotations_jats has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (40 pts), match/switch 3 (10 pts), loops 2 (5 pts), boolean chains 2 (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":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4ff6d66e587cf43e957f094fb6fab5b0c914883dc51f495bf9a3f136697c03"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells (cognitive 57): xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 8 (20 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":5428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f8ed9ae632c8f55d8b1d2dd62a3e954705674386e78bbb7192784f98786a40"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::features::execute_chunking (cognitive 56): xberg::core::pipeline::features::execute_chunking has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 2 (8 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9513f86ea3a5123ec222d45be507f0fc97ff15c431dea760077180b4d4ed0d0"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::jats::parser::extract_fig_content (cognitive 56): xberg::extractors::jats::parser::extract_fig_content has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 3 (9 pts), match/switch 3 (9 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/parser.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dae7853e240cbe350d435a4c4931dfa0f33d2666361113a1dbdeddc239e3ba7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::assembly::extract_text_with_glyph_offset (cognitive 56): xberg::pdf::structure::assembly::extract_text_with_glyph_offset has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (41 pts), match/switch 2 (7 pts), loops 3 (5 pts), boolean chains 3 (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":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f171a9d36a56ce107e63b1dbe02d5db28383b689b4752330f64b0115f2da7f"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::reorder_rowspan_labels (cognitive 56): PdfDocument::reorder_rowspan_labels has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (35 pts), loops 8 (14 pts), boolean chains 7 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae5b74c5309c527256e3f5660ae365d49112c60d5f9f1b1d51f232d6f3809be"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::group_lines_into_clusters (cognitive 56): xberg_native_pdf::structure::spatial_table_detector::group_lines_into_clusters has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 10 (19 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a55187e901d5d5d63bd3284a15617e3a4e20ba17bede9b76f1c1757628a23f0"}},{"ruleId":"D2","level":"warning","message":{"text":"JupyterExtractor::terminal_text (cognitive 55): JupyterExtractor::terminal_text has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 6 (12 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 30). Of this number, 47 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3443df4dec09d6be298ee9cb5b323170833775db962a1c861e5bc79b3dface7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells_visually (cognitive 55): xberg_native_pdf::structure::spatial_table_detector::detect_merged_cells_visually has cognitive complexity 55 (threshold 15). Drivers by points: loops 10 (28 pts), if/else 9 (24 pts), boolean chains 3 (nesting depth added 33). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a498e54061b46b400497af38aa05e5bbc1b0521c0ea636d6e8161a1473da9a"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::annotation_content_spans (cognitive 53): PdfDocument::annotation_content_spans has cognitive complexity 53 (threshold 15). Drivers by points: match/switch 13 (28 pts), if/else 10 (19 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cd0301799ee93d56844b644d65bf0c69041fdd4f594f68b71a91ac14207da4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::build_cells_from_intersections (cognitive 53): xberg_native_pdf::structure::spatial_table_detector::build_cells_from_intersections has cognitive complexity 53 (threshold 15). Drivers by points: if/else 7 (24 pts), boolean chains 18, loops 5 (11 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"3000b783f316617f16b8a1ddce3bdabd8abb7d4ec3e63be8c1c931ef9935903b"}},{"ruleId":"D2","level":"warning","message":{"text":"JupyterExtractor::extract_data_output (cognitive 52): JupyterExtractor::extract_data_output has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 2 (5 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67e385ca7d0a00b6b800cc74cb403d6c2d3fa79af04f82b04b838891a99a4cb"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_images_from_form_xobject (cognitive 52): PdfDocument::extract_images_from_form_xobject has cognitive complexity 52 (threshold 15). Drivers by points: if/else 25 (45 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"72815f0c97653602a50357f5facd462ee96d7bac69ef20699b37cd7201111298"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::reverse_rtl_visual_order_runs (cognitive 52): PdfDocument::reverse_rtl_visual_order_runs has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 9 (15 pts), boolean chains 8 (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":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"774289de8e3308e01c2bac834978b459bbdad2f29cc5b49e01ddea63f32eac4f"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_annotations (cognitive 52): PageRenderer::render_annotations has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (51 pts), loops 1 (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":7260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d100d756042d110ec0dee4340c7be7eed3a6698c27ee68219cc9fd2cd954b12"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::to_plain_text (cognitive 51): Document::to_plain_text has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 4 (8 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 30). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"74538d058fb287e94a37da0b47270dc0b6e9bea79934f5ac71b6569cc47a2614"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::split_table_at_section_dividers (cognitive 51): xberg_native_pdf::structure::spatial_table_detector::split_table_at_section_dividers has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 6, loops 4 (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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef1389db6b40e29f52eb0feb88154e81c165eece103856d616c9937c66e8cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"PptxExtractor::push_markdown_content (cognitive 50): PptxExtractor::push_markdown_content has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pptx.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7a0c4e9a90a09a210bdc3f0dd43b3b96704ae5e531e67bc2a4c1721a431d66"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::page_renderer::evaluate_type0_multi (cognitive 50): xberg_native_pdf::rendering::page_renderer::evaluate_type0_multi has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (37 pts), loops 7 (10 pts), boolean chains 2, match/switch 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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8266}}}],"partialFingerprints":{"codehealthFindingId/v1":"482fe101ee109cad55f9855189e844908d17921d883e7a2872b86e1a8baeaeb6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::xref::parse_xref_stream (cognitive 50): xberg_native_pdf::xref::parse_xref_stream has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (35 pts), loops 5 (8 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aaaf7e798f6e57724807312f19949df453f7b5d8aeed5ce69323685002430b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::mime::detect_mime_type_from_bytes_with_inspection (cognitive 49): xberg::core::mime::detect_mime_type_from_bytes_with_inspection has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 10 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/mime.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"6838e9cd1f41c2ccfc3af07b7a7f2862962ba96a5b6774243a612645b0d8f2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::collect_inline_run (cognitive 49): xberg::extractors::odt::collect_inline_run has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (37 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c81e5aca0a87e02aa7f9a05de0caa56c147d549c62c41880aa337e3cdabb9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::adapters::reattach_ocr_layout_list_markers (cognitive 49): xberg::pdf::structure::adapters::reattach_ocr_layout_list_markers has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 6 (14 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd58efca5bde941896eb4bd14797d7c648b6abe8ad7d5658276c9111bbd6d44e"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::collect_image_handles_from_form_xobject (cognitive 49): PdfDocument::collect_image_handles_from_form_xobject has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (41 pts), match/switch 4 (6 pts), boolean chains 1, loops 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":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf2e9cb27c357adf049f3eb1810db2edd99b14d7a65138dcd7d0661bddeeea5"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::get_page_by_scanning (cognitive 49): PdfDocument::get_page_by_scanning has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (36 pts), boolean chains 8, loops 4 (5 pts) (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"854ec316de1f6541f1154c91b509ae7dc7684300d6e63245b1d03e1b89db61f9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::merge_vertically_adjacent_tables (cognitive 49): xberg_native_pdf::structure::spatial_table_detector::merge_vertically_adjacent_tables has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5 (19 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1e1ae4a66df5c4e81ef3b963246dd68ec48657056364cc7ee4d00f0adfed4f"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::read_uncompressed_object (cognitive 48): PdfDocument::read_uncompressed_object has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 12, match/switch 4 (7 pts), 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":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e757ca644de5a9e244abb806b983e35af652f0ec5a999ebd28972b60054eaf2a"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::short_line_central_corridor_prose (cognitive 48): XYCutStrategy::short_line_central_corridor_prose has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 9 (13 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":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc32c1b5c1224ff3316d4e5143324687878d505ca6148ca503cbb77be36acfc9"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::fill_with_tiling_pattern (cognitive 48): PageRenderer::fill_with_tiling_pattern has cognitive complexity 48 (threshold 15). Drivers by points: if/else 26 (28 pts), loops 7 (10 pts), boolean chains 6, match/switch 4 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4701}}}],"partialFingerprints":{"codehealthFindingId/v1":"f410f7612618c5ec0525a76f74202de92b1ee9d377addc6d15ea9aa8430d4eab"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::build_heading_map (cognitive 47): xberg::pdf::structure::pipeline::build_heading_map has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81ff25addb8439ad1e3b427551db453070c5d39740a2c7c83d01bc28061af8b"}},{"ruleId":"D2","level":"warning","message":{"text":"PaddleOCRVLModel::get_rope_index (cognitive 47): PaddleOCRVLModel::get_rope_index has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 2 (6 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aca570627524ff1f53c5c85f73e8ae9ee526a59a46d890177bafbd93c583b8"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::has_persistent_gutter_corridor (cognitive 47): PdfDocument::has_persistent_gutter_corridor has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 8 (11 pts), boolean chains 9 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"145620d43846dd34b03ee0602700f42da200c075ab72634b997135b37c891375"}},{"ruleId":"D2","level":"warning","message":{"text":"TextRasterizer::render_cid_direct (cognitive 47): TextRasterizer::render_cid_direct has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (39 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (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":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"beddd114557990a8b7b979b0dda5e427643b2906108254b5291cb61c1157c5d1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::xref::parse_traditional_xref (cognitive 47): xberg_native_pdf::xref::parse_traditional_xref has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (30 pts), match/switch 3 (9 pts), boolean chains 4, loops 3 (4 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":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8810cbfd8ce4253a9dd42941a27eaefde6af832ace87764fa4c96423abbf179"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::parse_odt_tracked_changes (cognitive 46): xberg::extractors::odt::parse_odt_tracked_changes has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (31 pts), match/switch 2 (8 pts), loops 3 (7 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d36cebea5f5301fee4407cde8237b745fc796187555ab274f2e4eda0d03cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::table::source_members::projection::page (cognitive 46): xberg::pdf::native::table::source_members::projection::page has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 6 (10 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table/source_members/projection.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"983d4c625ca66249c8d0c3c017b276c2625b933e051f507dfbcfdd72d4eeaf55"}},{"ruleId":"D2","level":"warning","message":{"text":"TextRasterizer::layout_text (cognitive 46): TextRasterizer::layout_text has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d4db90f9e55509c93390f1a04067a345b92dade845f895bc0883ada0a9f11c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::strip_form_numbering_artifacts (cognitive 46): xberg_native_pdf::structure::spatial_table_detector::strip_form_numbering_artifacts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 7 (24 pts), boolean chains 13, loops 5 (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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3024}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1672f8f9ac3c81ec25eda4516021dfcb9fb072c1178372dc750512fc67562f"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::extract_binary_images (cognitive 45): FictionBookExtractor::extract_binary_images has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (9 pts), match/switch 2 (7 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb60fc9c5708afc0f359832faadc5b75125d2b0a89393af5683ad053eb7f6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::sidebar_body_reading_order (cognitive 45): PdfDocument::sidebar_body_reading_order has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 8 (11 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c66faf270f67e629631eb801ebadecfb89a80756198b5e3e877994f84082937"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::actualtext_actions_for_page (cognitive 44): PdfDocument::actualtext_actions_for_page has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 6 (13 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddad6dfc5b18e743b33d7128e3640997d746d8aa9bc7a25fb4c7e4c599b92e36"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cmap::line_parsers::parse_bfchar_line (cognitive 43): xberg_native_pdf::fonts::cmap::line_parsers::parse_bfchar_line has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2d9d598d80febc69b32c0bd6cd5547c85fcbf560fc83a8b8509ca2c2a8c5f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::to_markdown (cognitive 42): Document::to_markdown has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 25). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb1f7e206e20171287b64269c628998e56c5a6d145460f96b2e15d881cc54e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SlanetModel::recognize (cognitive 42): SlanetModel::recognize has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 5 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f37378d108f39719896a611a6b3bd79ef11b3da3c5dc972dfd5ea9412606ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::mark_cross_page_repeating_short_text (cognitive 42): xberg::pdf::structure::classify::mark_cross_page_repeating_short_text has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d86fcad58d179290d342e1aa3a98d2694d623088b712f42ff1e4ca1157aa28"}},{"ruleId":"D2","level":"warning","message":{"text":"TextPostProcessor::normalize_leader_dots (cognitive 42): TextPostProcessor::normalize_leader_dots has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (17 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/converters/text_post_processor.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fa172b9f16520afd3a896ae72bc6a7f9e4d681ee8f5af6a078acc9c3f41814"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::parser::parse_struct_elem (cognitive 42): xberg_native_pdf::structure::parser::parse_struct_elem has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), match/switch 5 (10 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfa5645c0f71a15ba100817dc4bf9780f6df041baddef7c3f3ca6882c28ee9a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::table_extractor::extract_cell (cognitive 42): xberg_native_pdf::structure::table_extractor::extract_cell has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 4, loops 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd434b5fcaedb3c0962496c0537c6bec035f23bddb49aeb062f6bc3ee73f4e59"}},{"ruleId":"D2","level":"warning","message":{"text":"RedactionPass::redact_format_metadata (cognitive 41): RedactionPass::redact_format_metadata has cognitive complexity 41 (threshold 15). Drivers by points: loops 14 (30 pts), if/else 5 (10 pts), match/switch 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2320098588f28361aa43705306ffba9b698c8d3af2d0e08aaf99faac5c56d425"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::extraction::apply_annotation_text_fallback (cognitive 41): xberg::extractors::pdf::extraction::apply_annotation_text_fallback has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d4380ed34084edc0841acc8c215a890632968d5a280ac107c528ed0cefe3ce"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::execution::render_inline_ocr_table_content (cognitive 41): xberg::ocr::processor::execution::render_inline_ocr_table_content has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 7, match/switch 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":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f85290206b874d55f9ea47bb7023baeb947aa2abd7935a42c5878e2ccae074b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::text_repair::repair_broken_word_spacing (cognitive 41): xberg::pdf::structure::text_repair::repair_broken_word_spacing has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 9, loops 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/text_repair.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ceb29a2077a57c9697ce8546ce4bee8f24d4e1f5393c869cb67f57945993567"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::page_image_handles (cognitive 41): PdfDocument::page_image_handles has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 3 (4 pts), loops 1 (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. This shape REPEATS in the file: one other method here (PdfDocument::extract_images_filtered) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"878f0b80c31d8ae0a25df0e489977f96001a7e181d583d4d80ded67b4db417ab"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_images_filtered (cognitive 41): PdfDocument::extract_images_filtered has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 3 (4 pts), loops 1 (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. This shape REPEATS in the file: one other method here (PdfDocument::page_image_handles) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"f226779eb7bacecad344b31c640d28243ef53827c4f685d8cbc9d5ade7e62fa7"}},{"ruleId":"D2","level":"warning","message":{"text":"TextRasterizer::load_font_data (cognitive 41): TextRasterizer::load_font_data has cognitive complexity 41 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 15, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbae1c2cd60013f4b4acd571e5765926da442deef6ddf0ce903f44346c65892"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::parser::parse_dictionary (cognitive 41): xberg_native_pdf::parser::parse_dictionary has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (27 pts), match/switch 3 (9 pts), boolean chains 4, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b42c1ec649e6c6d26792ddb8380f01f9fdfae04a4e8157806ef92b6b444893"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::mesh_shading::decode_patches (cognitive 41): xberg_native_pdf::rendering::mesh_shading::decode_patches has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 6 (16 pts), loops 5 (12 pts), if/else 7 (11 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea6e0638ffe44405c2ea0d937b4cdcf4b80ff66e12f5b1fe365d10753ada595"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexExtractor::build_internal_list_items (cognitive 40): LatexExtractor::build_internal_list_items has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"791c0badb4f124226645da2d0ecc67a6a2206e8e139867c74e6f124fc006d87f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::regions::tables::extract_tables_from_layout_hints (cognitive 40): xberg::pdf::structure::regions::tables::extract_tables_from_layout_hints has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/tables.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ee56b6a03bd3488f1cf240cf2885ad4f61671ae8ad003defcb03723694b0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_cli::main (cognitive 40): xberg_cli::main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 7 (13 pts), loops 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":"crates/xberg-cli/src/main.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"042446ad9b6b5a382f9c476095b866077d32c2184f34bcb527b27bf943d0e438"}},{"ruleId":"D2","level":"warning","message":{"text":"TextRasterizer::render_substituted_cjk (cognitive 40): TextRasterizer::render_substituted_cjk has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 2, loops 1, match/switch 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":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c326e954202a9b934d45d8908fac529203b1f97b74c267f664d7c7cf828e63"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::resolution::color::evaluate_type0_sampled (cognitive 40): xberg_native_pdf::rendering::resolution::color::evaluate_type0_sampled has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (27 pts), loops 6 (8 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b5feb11cb5da4a22ac9c141aa3c8ab352b1229c7a330e410d8e1d50102474"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::tint_for_ink (cognitive 40): xberg_native_pdf::rendering::separation_renderer::tint_for_ink has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"0465752c91e7a72675e0971d0ed22a6a7cf0012cea9626b13acdbd945ec3e43f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::parser::parse_font_charset_table (cognitive 39): xberg::extractors::rtf::parser::parse_font_charset_table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (31 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c881b9b0d7a73c01c0e6221d867719b36d6a3c795187f56c6e8da213c6613aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::djot::escape_block_prefix (cognitive 39): xberg::rendering::djot::escape_block_prefix has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 12, match/switch 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d37dd45a70c5fd51db09130774393bd645e306715acbb209d880003e15b27c"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::apply_overprint_after_paint (cognitive 39): PageRenderer::apply_overprint_after_paint has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (32 pts), match/switch 2 (4 pts), boolean chains 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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6748}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1480a6658f758c176d8810704fa254193756a217f3d5e38420f476703bf7da"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::text::bidi::reverse_rtl_keep_numbers (cognitive 39): xberg_native_pdf::text::bidi::reverse_rtl_keep_numbers has cognitive complexity 39 (threshold 15). Drivers by points: loops 9 (18 pts), if/else 8 (14 pts), boolean chains 7 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/bidi.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"7987a83e4ff7fd5f28a40768afedacf78ccc636bf3871bf0d1e1070ca565b9d6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::plan (cognitive 38): xberg::extractors::pdf::ocr::layer_token_recovery::plan has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 9, loops 5, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d73a88983574a8e20a3535f72217238a8bc311be5a125adabb48b64cd4fbd2f"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_images_from_xobject_do (cognitive 38): PdfDocument::extract_images_from_xobject_do has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 4 (7 pts), boolean chains 5 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b4da15bfb632895b84268a88c1e6f8aeddc352966acc6c1b4f80957e588a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::rasterise_image_xobject_coverage (cognitive 38): PageRenderer::rasterise_image_xobject_coverage has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (38 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85b8823e3e7c2f22bd6a767bffc4431b7e4aedc6352b2ce68ed572ba5075a3f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::decoders::ccitt::decode_row_g4 (cognitive 38): xberg_native_pdf::decoders::ccitt::decode_row_g4 has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 4 (10 pts), boolean chains 5, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"529205a2b9cff205c37f0ed917ee1ec7d207fd2a8d7fb0c54c684104913f9d55"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_page_columns (cognitive 38): xberg_native_pdf::structure::spatial_table_detector::detect_page_columns has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 5 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"445d7c765dadcf1511ac5e3fa9111d60a5d3f406a7fca91c5b5c8e8935d54c41"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_spans (cognitive 38): xberg_native_pdf::structure::spatial_table_detector::detect_tables_from_spans has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 8 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b2bfa35a7dd5469a125da4be4d06f184af8c69197ccf43ce9b05f24683c1c5"}},{"ruleId":"D2","level":"warning","message":{"text":"PlainWords::reconcile_writers (cognitive 37): PlainWords::reconcile_writers has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (32 pts), boolean chains 4, loops 1 (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":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a795526730bb2872682b390afc40d33fb9b246f8faafe88a50b88c12d2770995"}},{"ruleId":"D2","level":"warning","message":{"text":"VisibleMarkdown::on_plain (cognitive 37): VisibleMarkdown::on_plain has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (15 pts), boolean chains 6 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/redaction_projection.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"659d7dcd0b9f77556dc8412652db2d907df5c45746f7408217c35e507ebbfd89"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::text_repair::repair_contextual_ligatures_mapped (cognitive 37): xberg::pdf::structure::text_repair::repair_contextual_ligatures_mapped has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 8, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/text_repair.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8ec5d62dff25a79b7b607368c48fc0ede6fd138a92999f0e0955f144f1625c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_and_execute_text_only (cognitive 37): xberg_native_pdf::content::parser::parse_and_execute_text_only has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (6 pts), match/switch 2 (5 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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"f376863a60a6ae1bccad45a6e4a223aec9db9d1474316c29548e6eeb213f767c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::looks_like_prose_paragraph (cognitive 37): xberg_native_pdf::structure::spatial_table_detector::looks_like_prose_paragraph has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"6624183fdf972d987fd0aa3f69435ca7fa1e1686ef511d02f2be48f0b751c4c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionConfig::with_file_overrides (cognitive 36): ExtractionConfig::with_file_overrides has cognitive complexity 36 (threshold 15). Drivers by points: if/else 36. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50f06667f7479f80b72e020ede6f0b3149cb461a0dcc8e40afc2ca088d892bd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::build_style_map (cognitive 36): xberg::extractors::odt::build_style_map has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (9 pts), boolean chains 3 (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":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbfcbc03f72a25471f813dd435b5bd9b7cbd016b85926da93756a2f440a7c74"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::layout_classify::apply_hint_to_paragraph (cognitive 36): xberg::pdf::structure::layout_classify::apply_hint_to_paragraph has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 20, if/else 10 (15 pts), match/switch 1 (nesting depth added 5). 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":"crates/xberg/src/pdf/structure/layout_classify.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d00551e39c74ef121bf87feffbff00b8c3a8933a5b46df034798356eabaf26"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::is_multi_column_page (cognitive 36): PdfDocument::is_multi_column_page has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 4, loops 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1004eaeb4819e950219f2f8f2352e456d70f95c61eff33aee8081fb336670b98"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::page_cannot_have_text (cognitive 36): PdfDocument::page_cannot_have_text has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"955a01c105331763e818bcb9297438218a05e4d574a29f3f1b7f0631213848e3"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::postprocess_spans (cognitive 36): PdfDocument::postprocess_spans has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 5 (7 pts), boolean chains 4, match/switch 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":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82bc3e8a271511c3da223ec4b441246fdc8e8f468e11e78f002c00f70c1f266"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::stamp_char_x_offsets (cognitive 36): PdfDocument::stamp_char_x_offsets has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (11 pts), boolean chains 2, 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":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"776a8d3ed506bc7d58269a16971ff182ee5fca3bd305e6dbe3054c13851b6ffc"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::is_single_column_region (cognitive 36): XYCutStrategy::is_single_column_region has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 7 (10 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":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d6bcf47fcdf176c4a9b7f2e44caf97172579c7da5c4c2c8869628351e99848"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::parser::decode_literal_string_escapes (cognitive 36): xberg_native_pdf::parser::decode_literal_string_escapes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (3 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":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c34f5ac2a52a4c6b6ae7d89f40ba0738211fe8a374877f58dfe926e83178f2"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::sidecar::resources_declare_transparency_or_overprint (cognitive 36): xberg_native_pdf::rendering::sidecar::resources_declare_transparency_or_overprint has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73546f746ad20e9e4f8a2bb834a41252432a2fcea3961b5d317dd941a502847"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::fold_embedded_image_ocr_text_with_gap (cognitive 35): xberg::core::pipeline::fold_embedded_image_ocr_text_with_gap has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51fe476d24bd6520e7e39b313281eb279716568bca1d2deb87724fd42e7e047"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::assembly::push_paragraph_element_by_kind (cognitive 35): xberg::pdf::structure::assembly::push_paragraph_element_by_kind has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (31 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":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6508f1239eb520a4906ff9ac7e056188cbc7f5edca687d633b088f76bf3123f8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::merge_header_only_column (cognitive 35): xberg::pdf::table_reconstruct::merge_header_only_column has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (13 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":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"431d7f4c9ea4dd888dabd4827b18a5bc5091d9b05a02db588c0a284f40a3b9dc"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::classifier_column_gutter (cognitive 35): PdfDocument::classifier_column_gutter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 9, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fcf4662ed0140e3048ef2b60c73271f7444bb58b90b985f671d47493aa2ae8"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::advance_position_for_string (cognitive 35): TextExtractor::advance_position_for_string has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fa3138da82fcab88a96118cc7734019f2c391feb0f40c0a6ed30e9aa481202"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::functions::parse_body (cognitive 35): xberg_native_pdf::functions::parse_body has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/functions/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d96242caadf11701d3c6458dbdab708d6a4a2de0513db6ae1c7ac3a25132dd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::text_rasterizer::measure_text_bytes (cognitive 35): xberg_native_pdf::rendering::text_rasterizer::measure_text_bytes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"403f86849de977ddb8c6393ef5e930815f0999536162176baef70449dad81912"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::to_markdown (cognitive 34): Run::to_markdown has cognitive complexity 34 (threshold 15). Drivers by points: if/else 28 (30 pts), boolean chains 4 (nesting depth added 2). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"839868ee73b18d6197781479a005249b6e2b32a2617df561dfbff3287cbaafbf"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::extract_text_content (cognitive 34): FictionBookExtractor::extract_text_content has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1373f854663989ff1d7e8d385d90436b06481823ed8f9e99da356346270d63"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexExtractor::build_internal_body (cognitive 34): LatexExtractor::build_internal_body has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (26 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"10db850696c0dedfb15b4b4f9799aa6670ed19ebb0641b86a120aee730d59226"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::hocr_parser::parse_title_properties (cognitive 34): xberg::ocr::hocr_parser::parse_title_properties has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 1 (2 pts), loops 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":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"df41c745cc6dc058ba2b2b613e429ed1b60497d6e7f252388fb25c861ab2de1b"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::ensure_running_artifact_signatures (cognitive 34): PdfDocument::ensure_running_artifact_signatures has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (9 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa95cb9c3a29bae4e2be0d7a60dd7cc8d40a71364b6963c6c3b36d906b382438"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::cached_page_content (cognitive 34): PdfDocument::cached_page_content has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 3 (6 pts), loops 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfbca5b3682ea16aa5af8dcb73ec6c1f3708476a57519df2770ca35e2109ece"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::merge_rtl_line_to_visual_span (cognitive 34): PdfDocument::merge_rtl_line_to_visual_span has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (9 pts), boolean chains 6 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0ce8e73891354469b4aa03217a52e506d5c1b2f93bae355835d03ec857fd73"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::apply_differences_array (cognitive 34): FontInfo::apply_differences_array has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2927}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa3fd93ea463cd4dc0e7565385e04cd1a718761dcd5c41e4648a4bb80e9f98e"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::load_resources (cognitive 34): PageRenderer::load_resources has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (8 pts), match/switch 1 (5 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2082b7c1deda1762ef87aa7106c91ad7605f5ab1ffc441390dd23937476ea164"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::skip_array_raw (cognitive 34): xberg_native_pdf::content::parser::skip_array_raw has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (10 pts), boolean chains 7, match/switch 2 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5608da9b232f799d49c34c3cf497a9071c10d8dd87baa92eedfc992a18db53ec"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::parser::parse_structure_tree_inner (cognitive 34): xberg_native_pdf::structure::parser::parse_structure_tree_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (6 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d0ad4f403d8ac34ca75ead396ad40c032532f481c0c8620e0a52f31ef1868c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextWalk::open (cognitive 33): TextWalk::open has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 3, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb013a1f04efb935f1167c2fada1c980b0e53ddb77cebfbd1485ad8a1f85098c"}},{"ruleId":"D2","level":"warning","message":{"text":"RstReferences::collect (cognitive 33): RstReferences::collect has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 4, loops 2 (4 pts), 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":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1c82b88c0b6771bf4870dedcdaa6f9b0ba489e814f14ca0a25d66469be5556"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::email::process_node (cognitive 33): xberg::extractors::email::process_node has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (15 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9aca8e4e3abb31b045fe2d625e654fbab195e6e4615ce2858cf8d91f2095c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::detect_indentation_based_lists (cognitive 33): xberg::pdf::structure::classify::detect_indentation_based_lists has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9713bbddd4f84e2f0812c7c4bbc69d4590b1b627858531a9122784dda0a47a"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::prefetch_xobject_subtypes (cognitive 33): PdfDocument::prefetch_xobject_subtypes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 6 (13 pts), loops 3 (5 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":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce659875289313af311dc5358bb3d1c989e74ca60eaca3f734ff5e99190fc579"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::get_page_from_tree_inner (cognitive 33): PdfDocument::get_page_from_tree_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 5 (8 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"56dd7f27891724fd130285a1766ca521e0fcf6efff412d31a61bc7814accf07e"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::find_heading_runs (cognitive 33): XYCutStrategy::find_heading_runs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 5, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5bcabcfbe1969211b846cfb27d98489af2416c0d2e1c52159084402e3ba5273"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::sidecar::extract_process_paint_cmyk (cognitive 33): xberg_native_pdf::rendering::sidecar::extract_process_paint_cmyk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (26 pts), match/switch 3 (5 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":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"275af5a1188e22f5e7485a3c728bb7f8f473d3057bd25935df4cb6cbe2029067"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_with_unmodified_paths (cognitive 33): xberg_native_pdf::structure::spatial_table_detector::detect_with_unmodified_paths has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4932}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c08a50efe3f42821b8767dd11324afc1a363b2cf4d0a2570cc10b52f4a7c7"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericCache::is_valid (cognitive 32): GenericCache::is_valid has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cache/core.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e80b1d20a2c113a566f62f28b20a4e2bfdb51ebbb2e51b2086eacdf10a61a6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::build_internal_list (cognitive 32): xberg::extractors::odt::build_internal_list has cognitive complexity 32 (threshold 15). Drivers by points: if/else 4 (19 pts), loops 3 (9 pts), match/switch 1 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f858b53a3e67f3dd048dab4b2f8d9cd9f266504d378a21eaefe1e841c0ca613"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::assign_formula_slots (cognitive 32): xberg::extractors::pdf::assign_formula_slots has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a1b881f93dee6b8060fa0911550e98fdd73df50e2fc88580ab06571ad0f62b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::mark_cross_page_repeating_text (cognitive 32): xberg::pdf::structure::classify::mark_cross_page_repeating_text has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 5 (9 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d750c7ed692b945a4c5d6ee1d0a8eab8587050c968c62fda74b2bc1d3257c3"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::lift_marginalia_column (cognitive 32): PdfDocument::lift_marginalia_column has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8ebb81b5f35d3a9e60c9c511fa71dc9047249fc79a26073c7494442732c377"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::detect_narrow_gutter_prose (cognitive 32): XYCutStrategy::detect_narrow_gutter_prose has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 8 (11 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78ccfd23775291e8ffd9b842db97f12f8d78f82f230cd2bca9c1811e267bf8b"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::apply_smask_after_paint_inner (cognitive 32): PageRenderer::apply_smask_after_paint_inner has cognitive complexity 32 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 9 (11 pts), match/switch 5 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":7008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f044e10f283d648fb7b18e0233d161b9b969f713aa5e4c4478f14d00dfc50b9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_region_text_only (cognitive 32): xberg_native_pdf::content::parser::parse_region_text_only has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 3 (4 pts), match/switch 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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db09b8ba0373d10df5b988b26181d08cdc55fa0b980dda7dd43694c44771f30"}},{"ruleId":"D2","level":"warning","message":{"text":"EmailExtractor::build_internal_document (cognitive 31): EmailExtractor::build_internal_document has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (24 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3e318c529998d81b88a56f8a37a11205d8def3a6c4da4721c2ce186566f953"}},{"ruleId":"D2","level":"warning","message":{"text":"TypstParser::process_line (cognitive 31): TypstParser::process_line has cognitive complexity 31 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 5 (13 pts), match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdfcbd65d9e5f5a16c0e3fe6017307eb92ca2923970a95bd5f2cb50b8541ca9"}},{"ruleId":"D2","level":"warning","message":{"text":"XbergMcp::cache_warm (cognitive 31): XbergMcp::cache_warm has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 7, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"469580c50bf01789f924df4bcad305f70d83feab18cc22c0086e25b7e3d5ee08"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::extractor::file::hash_extraction_config (cognitive 31): xberg::core::extractor::file::hash_extraction_config has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/file.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"9097fcd699874b0b9e0b8243adabbc2565f7c7cf97fc785830d62b070bc29df8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::mixed_plain::check_accepted_ocr_tokens (cognitive 31): xberg::extractors::pdf::ocr::pipeline::mixed_plain::check_accepted_ocr_tokens has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 3 (7 pts), boolean chains 3, 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":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3da7ca10713051771f38f55f3400fdb53765f71b91357f9c32bcb57fdf19d86"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::refine_heading_hierarchy_inner (cognitive 31): xberg::pdf::structure::classify::refine_heading_hierarchy_inner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b68ed4798ebf5a32041f74dcdd8a790963107189cb32fea8f486cede9b95523"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::utils::quality::normalize_whitespace_ascii (cognitive 31): xberg::utils::quality::normalize_whitespace_ascii has cognitive complexity 31 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 6 (10 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/utils/quality/mod.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"347a903e9277a404953c01d815092d2c937b84c7a0251bb8bd6008ac90ad4276"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::has_bimodal_line_starts (cognitive 31): PdfDocument::has_bimodal_line_starts has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, loops 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc911d2711ad20a1c70561ed43ce7e7ccac8fdd8efdb0e8e2f0bb3e29158a94f"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorResolver::resolve_iccbased (cognitive 31): ColorResolver::resolve_iccbased has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 3, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b5a441348ca4fd2de6c47b37d76745a07145fdf4e05fcecacf66886f4c16c5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::converters::whitespace::dehyphenate_line_breaks (cognitive 31): xberg_native_pdf::converters::whitespace::dehyphenate_line_breaks has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 8, loops 3 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/converters/whitespace.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ad676668e69907eed8fab175730b2f620d08c079352dccc2fd86b7f6341c66"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlExtractor::walk_nodes (cognitive 30): HtmlExtractor::walk_nodes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 2, match/switch 1 (2 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":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bdc08ebb3d434a4168724f47d1e8b555dc34ac160a2971802139a642d32413"}},{"ruleId":"D2","level":"warning","message":{"text":"JupyterExtractor::build_internal_document_with_budget (cognitive 30): JupyterExtractor::build_internal_document_with_budget has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (8 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0ead5a78347875ae247b07d8bea7d0f5726d1b6e88a75d357e8e96c15db8ef"}},{"ruleId":"D2","level":"warning","message":{"text":"TypstExtractor::parse_inline_annotations (cognitive 30): TypstExtractor::parse_inline_annotations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 1 (2 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":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"87500524490a165ea35e50b2d906e1d31ff2063f567e2e33768b2a0a582074ed"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docx::collect_run_annotations (cognitive 30): xberg::extractors::docx::collect_run_annotations has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (29 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":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9d4fcc1a3f3c263b197623272f2da11d13ab488fdeac6ced8a8fcdf7958392"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::run_ocr_with_layout_pages (cognitive 30): xberg::extractors::pdf::run_ocr_with_layout_pages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3603750a142ca9414a5a179f1806c5d3adddb3364a32425e88ad9b3c90936c"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::scan_for_object (cognitive 30): PdfDocument::scan_for_object has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 8, loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"477028529ff7b8cf939bd1e518a840d1b2afed4fdcbfe11a9ebd01e5eab765ad"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::find_object_header_backwards (cognitive 30): PdfDocument::find_object_header_backwards has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 3 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e45fe2a3d67d627ffe868de3fe11360f78b6fb3da07a327492ea63c6917f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::merge_drop_cap_initials (cognitive 30): PdfDocument::merge_drop_cap_initials has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, 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":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8532bfc8b3a18444b4f5fe5d7ca68218a2530ec578e3ebdfdbc01cca2d82ccb8"}},{"ruleId":"D2","level":"warning","message":{"text":"TextChunks::binary_search_next_chunk (cognitive 29): TextChunks::binary_search_next_chunk has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/text_splitter/splitter.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c295762dbfc1202ca17bd7712232110571a9c14f5790e5c25a51c297964fdee1"}},{"ruleId":"D2","level":"warning","message":{"text":"DocxParser::parse_notes (cognitive 29): DocxParser::parse_notes has cognitive complexity 29 (threshold 15). Drivers by points: loops 5 (19 pts), match/switch 2 (6 pts), if/else 1 (3 pts), boolean chains 1 (nesting depth added 20). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":4227}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ffd9afa9720ac86e7e29e2d3c9540f2c9806a16879668748dbe3b7b46db943"}},{"ruleId":"D2","level":"warning","message":{"text":"JatsExtractor::extract_content (cognitive 29): JatsExtractor::extract_content has cognitive complexity 29 (threshold 15). Drivers by points: if/else 23, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ea8340964631259b80ffc40198b9c194a961bb55085839eb1983592fe63bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::engine::extract_impl::run_shared_url_group (cognitive 29): xberg::engine::extract_impl::run_shared_url_group has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 4 (8 pts), loops 4 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c878a75a9f94d329625d5a309e211f0c409af58032f757b5dc025fbdd1c6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::epub::content::strip_html_tags (cognitive 29): xberg::extractors::epub::content::strip_html_tags has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 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":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f46e9ede2a088ff97682d2ca6c3a650c009577b26430fa90b46199da812f979"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::latin_rows::rewrite_elements (cognitive 29): xberg::extractors::pdf::ocr::layer_token_recovery::latin_rows::rewrite_elements has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 6 (12 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/latin_rows.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d0489cc594ee829a7e322e4b231adacb7ecdff2b82c6544957fb644602346f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::deduplicate_paragraphs (cognitive 29): xberg::pdf::structure::pipeline::deduplicate_paragraphs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":8067}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b74d378f07d6573373cde8574e17819a46208d6a034d9dd2645343315970ae6"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::walk_form_xobject_tree_for_inks (cognitive 29): PdfDocument::walk_form_xobject_tree_for_inks has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 10 (19 pts), if/else 4 (9 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"179435cc045bf93c3872031977c09ef7f21802344e06bcf570c9e377d8cc4128"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::font_identity_hash_cheap (cognitive 29): PdfDocument::font_identity_hash_cheap has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 2 (7 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"829ce305b47890cd2c1a6c5b8abaa99b57800f19ef49d7090a09471791fc254f"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::collect_all_pages (cognitive 29): PdfDocument::collect_all_pages has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (7 pts), boolean chains 2, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fc22bce7d72dadf5c9b4c2e3036dbd0601de57b7e1eb886ffa484ec7a4e748"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::may_contain_text (cognitive 29): PdfDocument::may_contain_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (17 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 13). Of this number, 28 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":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a46812e0f6312902481d57fa0fac52ee784c47c65b3b364a9aa24226d6dcd2"}},{"ruleId":"D2","level":"warning","message":{"text":"TjBuffer::append (cognitive 29): TjBuffer::append has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":2226}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03e6cc20dc2c5a00067acdcfc397d3f032834453ad10788b01e39fa32641f76"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::parse_descendant_fonts (cognitive 29): FontInfo::parse_descendant_fonts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (21 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"12d01c63b62817c3a894be6b02f90778e12ab4c834ec205e24178d2363621de3"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::detect_two_column_prose (cognitive 29): XYCutStrategy::detect_two_column_prose has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1448}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34132de943e21ac289d7177f272c70e9c518da67f7b136546b7bf30e10799fe"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::mirror_cmyk_paint_into_sidecar (cognitive 29): PageRenderer::mirror_cmyk_paint_into_sidecar has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4ad3808e6dc2374c643379e25ead8ed63eb237b4d2115c2268d2e6d9d83639"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_content_stream_text_only (cognitive 29): xberg_native_pdf::content::parser::parse_content_stream_text_only has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 1 (3 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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"1445b30e8587f444b3484be0e02328a24fee8f839e9d40967bf5b718337fedab"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cff_encoding::parse_cff_gid_mapping (cognitive 29): xberg_native_pdf::fonts::cff_encoding::parse_cff_gid_mapping has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (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":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"363d7b2d3855af543eb47f6d2fed5df50246e318c526cbba9913ad05976cd0a8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::parser::parse_stream_data (cognitive 29): xberg_native_pdf::parser::parse_stream_data has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 6 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c5303f7e33dd1ab69e06116a230ff6e95600ecf7e3726af8dda56e3673d85a"}},{"ruleId":"D2","level":"warning","message":{"text":"Slide::to_internal_elements (cognitive 28): Slide::to_internal_elements has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/elements.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e2882a8ef5bbec6034f3d589adbd93e74352d912d9e10bbbdeb9c5d547686f"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::extract_footnote_text (cognitive 28): FictionBookExtractor::extract_footnote_text has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"8204536c0a37d380ad9cc2fa92b2e9dba3fc39a2cfbf1c3dc913aa7b9c2dadf1"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageExtractor::extract_with_ocr_pass (cognitive 28): ImageExtractor::extract_with_ocr_pass has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 9, match/switch 3 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"40193d25fffd5d93d06188c9b9718c0c6b50df51936e5cbdfb4f695b0d27d768"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::hwpx::collect_section_formulas (cognitive 28): xberg::extractors::hwpx::collect_section_formulas has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 3 (11 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/hwpx.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff65d4f7357aeb5076e56355d320c2a428e1bd70d01a153b37c565a2d06971b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::rendering::reject_pooled_noise (cognitive 28): xberg::extractors::pdf::ocr::rendering::reject_pooled_noise has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (13 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7edf5f337998966700d01bd1f472d66f74cddf8f7af0837e2c44dea7232f03a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::finalize_paragraph (cognitive 28): xberg::pdf::structure::pipeline::finalize_paragraph has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 15, if/else 11 (13 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9340110f923215556f7b5b729771828bcd39b9b3a90008e329a328374652bdd"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::density_central_gutter (cognitive 28): PdfDocument::density_central_gutter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 7, 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"9573379ab04cccda14326574e730e352f581f1d00c97835412014c1b062c012b"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::order_extracted_spans (cognitive 28): PdfDocument::order_extracted_spans has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (11 pts), match/switch 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":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a31dea75bb99c3199784f80c2bfe0bd561b418fea57753f406b30414b984f7"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_embedded_fonts (cognitive 28): PdfDocument::extract_embedded_fonts has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 3 (8 pts), loops 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":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"71876193b2a48c793321c80c58fb06cc6aeac73eb090f1d5f75bca35fc6c0687"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::parse_cid_vertical_metrics (cognitive 28): FontInfo::parse_cid_vertical_metrics has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3783f168d2a123c1a3ac5e7f9494ee14a32c15bc3e1c9ba3aa693acff6fac8f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::prescan_text_regions (cognitive 28): xberg_native_pdf::content::parser::prescan_text_regions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (5 pts), boolean chains 4, loops 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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7403244ea51a75b489d767787c4334624bc43627467037e07a28fdd2b99cecf9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cff_encoding::parse_top_dict_with_charstrings (cognitive 28): xberg_native_pdf::fonts::cff_encoding::parse_top_dict_with_charstrings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 1 (3 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":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7176debceebe3b722cdf4a05a5a0163815dd2428375616464dc5bee0267bf9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"TypstParser::extract_table_content (cognitive 27): TypstParser::extract_table_content has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (8 pts), match/switch 3 (5 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":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3060fb06e92a5cdbe2b2dc9f64d9b60eb1152d3916309b5cdbf91a893d2caaa"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::drawing::collect_txbx_content_text (cognitive 27): xberg::extraction::docx::drawing::collect_txbx_content_text has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (8 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":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"46236870eb99bf87034d82bce6d57c7c6cf9c96e894895cd82ad29ae9911539b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::parser::control_word::handle_u_control_word (cognitive 27): xberg::extractors::rtf::parser::control_word::handle_u_control_word has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/control_word.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"f892288b0259b0ae3695e8d8d0d19ea054a23ac0a75e504d989ee293f8cb333a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::assembly::reconcile_certified_table_paragraphs (cognitive 27): xberg::pdf::structure::assembly::reconcile_certified_table_paragraphs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f85155077556cc621641278bde686a29592d71aa8d1e7aea9cbb2d1170ce08"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::detect_monospace_code_blocks (cognitive 27): xberg::pdf::structure::classify::detect_monospace_code_blocks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b835a6c3efc2085f748a87a8859ca9385ea7d816006a8ea07a60ac0af173018"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::consolidate_paragraphs (cognitive 27): xberg::rendering::comrak_bridge::consolidate_paragraphs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490d9d92e8a66e0b72cab15355444b665e52fef8b7bba0769607d6cae680e46"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::pdf::writer::text_operations (cognitive 27): xberg::rendering::pdf::writer::text_operations has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/pdf/writer.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8219470c80dc182d75984a4a3b9f3e3002f163c2873b984cddc1b5b1f3fe83c"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::extract_embedded_font_from_descriptor (cognitive 27): FontInfo::extract_embedded_font_from_descriptor has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (11 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":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda61fc96dc41e4cd5370f62adbc465098dec2864ff67ac5f8a8f2062b301a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::apply_cmyk_compose_after_paint (cognitive 27): PageRenderer::apply_cmyk_compose_after_paint has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5827}}}],"partialFingerprints":{"codehealthFindingId/v1":"812d369d31911f4ee50a9e510d3cb654d38567d1737476dbf2b3317a794e59de"}},{"ruleId":"D2","level":"warning","message":{"text":"XfaParser::apply_dataset_values (cognitive 27): XfaParser::apply_dataset_values has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (11 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":"crates/xberg-native-pdf/src/xfa/parser.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"553bfdbfe541d663fa2429b5e0fc8379d6ae3dcd4ab5ae10bb4ff32e8dd68767"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::skip_dict_raw (cognitive 27): xberg_native_pdf::content::parser::skip_dict_raw has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (7 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3462}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b8ad66bd80576b50dea3b8c9204cfdff84a1a01aaa3ac62d9bcb52a4a04177"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cff_encoding::parse_charset (cognitive 27): xberg_native_pdf::fonts::cff_encoding::parse_charset has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 5 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0509d37d914eec2e53ed47a15f3448ad19f99f6174efedb1acb6046ff19c43d2"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_text_edge_columns (cognitive 27): xberg_native_pdf::structure::spatial_table_detector::detect_text_edge_columns has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 8 (10 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"450d4e55ce3dcee5bb4e56f9e03a9e3011cda626aa09c7290a3a47a533a908ec"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::finalize_intersection_tables (cognitive 27): xberg_native_pdf::structure::spatial_table_detector::finalize_intersection_tables has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (12 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3733}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3f262727b32ce7ced97625e145f25e98b7bae1a6e3ec6ee17a2a40f366e0b9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::html::structure::tag_handlers::find_head_end (cognitive 26): xberg::extraction::html::structure::tag_handlers::find_head_end has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure/tag_handlers.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"74676887c6e723f815fcb79a86249ac5b3cff9c41ceff0119eeb9cc2a76d4f92"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::formatting::normalize_whitespace (cognitive 26): xberg::extractors::rtf::formatting::normalize_whitespace has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 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":"crates/xberg/src/extractors/rtf/formatting.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cac91c8fa14ed323930c2ac4d90287c98b6dcb7f0f54bfb0bd9c71c6e4d73f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::hocr_parser::parse_hocr_document_with_policy (cognitive 26): xberg::ocr::hocr_parser::parse_hocr_document_with_policy has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6524e9bcb6e822bae48fe081853f9a2f36285ed88dae923a7ba1d2be25f04871"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::build_inlines (cognitive 26): xberg::rendering::comrak_bridge::build_inlines has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"6529381f41e23c6ecb280c9978dc84b9873d13deb8a3ec58b06359526f5e2e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"PolicyMode::default_decision (cognitive 26): PolicyMode::default_decision has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/crypto/policy.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5de169628ded10a93667b166229e28dc0ac12427d2401f3d3d132194fb9eeb"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_image_mask (cognitive 26): PageRenderer::render_image_mask has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (5 pts), match/switch 3 (4 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4272}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d39b9d58bb2055880e7c69e7192e2745e4bf72b916b3bd7b6f700d73b993a43"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::decoders::ccitt::decode_g3 (cognitive 26): xberg_native_pdf::decoders::ccitt::decode_g3 has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb325da5236d85199457f1e8c4ecb30f22b0c3c7bf2661d63e3ec4a7b741b63"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::document::find_objstm_candidates (cognitive 26): xberg_native_pdf::document::find_objstm_candidates has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b30239dd2a2f030d68a837ad22a4fa0c21206e32e2fec3c60db91f8a59c065e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cff_encoding::parse_encoding_table (cognitive 26): xberg_native_pdf::fonts::cff_encoding::parse_encoding_table has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b872707971b91beb2985bfd67fbbeb01c608819d849279c6063c77aeabaf547"}},{"ruleId":"D2","level":"warning","message":{"text":"OdpExtractor::extract_content (cognitive 25): OdpExtractor::extract_content has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 1 (2 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":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b4e3138428f521b007f6c1dee7518b4ca260d841574052780fe6793333d8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"OdtExtractor::extract_content (cognitive 25): OdtExtractor::extract_content has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 1 (2 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":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd928d4e8b22b184bb9c406dfd39dbed34d424b167030c00ba1b8e209e8aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"RedactionPass::redact_pages (cognitive 25): RedactionPass::redact_pages has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"f582508313133bf9ea515cf4cd896878dc9fa576704f87457180ed993928cd07"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::api::handlers::cache_warm_handler (cognitive 25): xberg::api::handlers::cache_warm_handler has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5b07113fac5632eb1fba07278e4ad8a8ee2dbf5bd93f323b0bea1f7b3e30b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::replace_embedded_image_markdown_with_ocr (cognitive 25): xberg::core::pipeline::replace_embedded_image_markdown_with_ocr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e09e77a462db7eef86f27580496bcd3356cb747eebc9009b335be966b66b22"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::append_embedded_image_ocr_text (cognitive 25): xberg::core::pipeline::append_embedded_image_ocr_text has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5284653a5d58ca6a41183dc786913f8e91a0503411b7f3610f71621005db8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::office_art::find_blip (cognitive 25): xberg::extraction::office_art::find_blip has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (6 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":"crates/xberg/src/extraction/office_art.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3b9feaf4412b6fc17c878b623098a72b83565c69f5db5b9e80bdf2a5d7030b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::opml::parser::collect_feed_urls (cognitive 25): xberg::extractors::opml::parser::collect_feed_urls has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/opml/parser.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3ff68b8e3e166ae3fe043d435d82e665870949e690f32e83dedd8824dcd09c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::line_insertion (cognitive 25): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::line_insertion has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd5a0a9e98950db04755d4b10a26f81d2637f15397bb6dc36482c104ec45a56"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::keywords::yake::preprocessor::find_sentence_end (cognitive 25): xberg::keywords::yake::preprocessor::find_sentence_end has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/keywords/yake/preprocessor.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c217017f788796728d9e672eacf7878a6410842073455cf50458be75f94b6126"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::images::page_ocr_fallback_image_bytes (cognitive 25): xberg::pdf::native::images::page_ocr_fallback_image_bytes has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 4 (7 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/images.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bf096da553e857ed32ff3e79d746295b7203e41234b0c5659ea3b2cc1967b4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::assembly::assemble_internal_document (cognitive 25): xberg::pdf::structure::assembly::assemble_internal_document has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 6 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"007e9d4dcd910d9299064b4296464536d449f83afaea2280ca3c3c877cbef479"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::dehyphenate_paragraph_lines (cognitive 25): xberg::pdf::structure::pipeline::dehyphenate_paragraph_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7880}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e46aa596d74d16185abb32b0f1d5b46ba8a689cbcfa645309ff31ebe08fd998"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::inherit_widget_parent_fields (cognitive 25): PdfDocument::inherit_widget_parent_fields has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/annotations.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"288ab415dfeb71399f1a47e58f0291a0710dc00c517361417cc4910f0fd74805"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::resolve_inherited_da (cognitive 25): PdfDocument::resolve_inherited_da has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (9 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":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d98b4be026cad446179b9594e92f372bd3262a162e4d11721c811df05022c5"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::compute_invisible_text_ratio (cognitive 25): PdfDocument::compute_invisible_text_ratio has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/classify.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7405587d7dd0ba3f6af6a9419c9160dd3c96dff0b88ad5c7926eff047e74ea"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::placed_pdf_text_dominates (cognitive 25): TextExtractor::placed_pdf_text_dominates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/marked_content.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"245e93123d6e04ebc2b169cdb7782065c0b8db3ba0a0829d2bc9d0571dfe08a7"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::resolve_base_encoding_map (cognitive 25): FontInfo::resolve_base_encoding_map has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9976aef25302cf193f4a8c409d7ff0bf25e0dba7e3218becfc34e563919b0b5"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::partition_indexed_depth (cognitive 25): XYCutStrategy::partition_indexed_depth has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bdd49b8a77527589adbf0a2bd36135b409e969c14571625aa86c3c3f4112c8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::images::resolve_image_color_space_object (cognitive 25): xberg_native_pdf::extractors::images::resolve_image_color_space_object has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fb0a8fa5cd62bdbaef1909694e82be660ae1d09bda9fe91d3777762e113f82"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::redaction::sanitize::sanitize_catalog (cognitive 25): xberg_native_pdf::redaction::sanitize::sanitize_catalog has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, loops 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":"crates/xberg-native-pdf/src/redaction/sanitize.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"360ee2c46d017be312e7d6a3c43d9510d2b4158659d15b622b7e6db4fe1f04ad"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::sidecar::extract_paint_spot_inks (cognitive 25): xberg_native_pdf::rendering::sidecar::extract_paint_spot_inks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 6 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a123d902dd8e94e609048063c3675e0088cbed6ca8d7488642fb8defe4f16ce"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::xref::parse_xref_iterative (cognitive 25): xberg_native_pdf::xref::parse_xref_iterative has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"c306653e323f325b0dfaecd70083746dbedd2b3487c3b1493f23d2c779440059"}},{"ruleId":"D2","level":"warning","message":{"text":"demo.html.processFile (cognitive 25): demo.html.processFile has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (nesting depth added 7). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-site/public/demo.html"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6104b25cafafb33e543d841b2f5637cb9e32389e10d1de8b839b1cc8a570ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"DocxParser::parse_header_footer_relationship_targets (cognitive 24): DocxParser::parse_header_footer_relationship_targets has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (10 pts), loops 2 (4 pts) (nesting depth added 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":4160}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d24b0cca2a46b87d1ad2193f522d1ae86ef2036a9974f345b66d2a381319fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentBuilder::add_table (cognitive 24): ContentBuilder::add_table has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 5 (7 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/content_builder.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bcf293f3e49f224b70d480c03a3992b550e0a45fbfc07be4721ef932d3cde7"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlExtractor::extract_sync (cognitive 24): HtmlExtractor::extract_sync has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 4 (7 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"720bad234e6d12a61071ec6a162bf1a08e6d169f6bb0fd604fc79181cd1e7496"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexParser::process_environments (cognitive 24): LatexParser::process_environments has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/parser.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39469832c2083cd642e9695171e68aa78fe3900109204ddce5f24e0734a1b6f"}},{"ruleId":"D2","level":"warning","message":{"text":"TypstParser::extract_keywords (cognitive 24): TypstParser::extract_keywords has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41aca93769af7756a9cf06298cb0b65bd93f970d0ab0df9ebbe04648e858775"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::parser::apply_run_formatting (cognitive 24): xberg::extraction::docx::parser::apply_run_formatting has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd73df3a6cc001e8c6931f64d7bcc217f2e598e0ae108441e997c96a7de3aeb3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::parser::insert_missing_inline_drawing_page_breaks (cognitive 24): xberg::extraction::docx::parser::insert_missing_inline_drawing_page_breaks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":2658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c591d2d38ff24af396b5e2bcc283f8ed67cda29d7eaf605161e5722dc3f48b61"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docbook::extract_element_text (cognitive 24): xberg::extractors::docbook::extract_element_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"481e571e8da62674ce0c3dafb4bd77093d594334b28640a15ff05145285e3793"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::latex::environments::process_list (cognitive 24): xberg::extractors::latex::environments::process_list has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/environments.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"148e8428c493c60506cd4c673ee6e123bdbb694cae16ca7e5b2fca1a70d17390"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::document::split_document_global_ocr_structure_by_page (cognitive 24): xberg::extractors::pdf::ocr::document::split_document_global_ocr_structure_by_page has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":4629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5276465183807dc563e8a1768ca999cfc56b60fd04db13a145c4e9e73107e77"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::painting_candidates (cognitive 24): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::painting_candidates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, 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":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d669c8e4b5c1353a04705dc07ab5579c5eeda8717d9f7be9b9ca261191378c9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::undo_result_rotation (cognitive 24): xberg::extractors::pdf::ocr::pipeline::undo_result_rotation has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":10747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5525322120491b542ce15155ee8aa1751b5803b586929e5080049563cefa4714"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::tall_source::recover (cognitive 24): xberg::extractors::pdf::ocr::tall_source::recover has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e9af94e9cce9eb596f420e0269340cafc6f41ff6f1ee5f3e53158b80271159"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::assembly::join_line_texts_plain (cognitive 24): xberg::pdf::structure::assembly::join_line_texts_plain has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"59817b358765471fbe1893f20e47ee1136da78288e9fdd275a6af73cca3a4535"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::regions::table_recognition::recognize_tables_slanet (cognitive 24): xberg::pdf::structure::regions::table_recognition::recognize_tables_slanet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bf9921135f79c7fae5028a888a0ccd2fd180dbee91ad1e1e49a0a8437e32d1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::text_repair::collapse_spaced_hyphens (cognitive 24): xberg::pdf::structure::text_repair::collapse_spaced_hyphens has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/text_repair.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3985fda31561eca0f34e2c6cfaf62b4beb74cb931465ed6d4fbaa90fd9843c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::looks_like_short_columned_prose (cognitive 24): xberg::pdf::table_reconstruct::looks_like_short_columned_prose has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a6c0cac39ed823b9fe871bf980761c24fa2cc842583952311813ae93c85014"}},{"ruleId":"D2","level":"warning","message":{"text":"DeepseekOCRModel::forward (cognitive 24): DeepseekOCRModel::forward has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec147bb100ea3ce081087d8d02cd6668a7be67ff19c86ffe95ddf41886cfd0e"}},{"ruleId":"D2","level":"warning","message":{"text":"TextPostProcessor::compose_combining_marks (cognitive 24): TextPostProcessor::compose_combining_marks has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 13). Of this number, 23 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":"crates/xberg-native-pdf/src/converters/text_post_processor.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"219bc2afc04447a77f028d6f922f1ebcd15586017b97be8ff07340a84cb53e51"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::get_layers (cognitive 24): PdfDocument::get_layers has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3a929ba46412c276395cedbf3cca0fdee0047b8474273170b6a29e9593314a"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::identify_multi_row_labels (cognitive 24): PdfDocument::identify_multi_row_labels has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 4 (7 pts), boolean chains 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":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"79741817632c5e8cbba6cbf3eac08fc3ebdef92c86a896c108d5eab07917adee"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::document::collect_inks_from_color_space (cognitive 24): xberg_native_pdf::document::collect_inks_from_color_space has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (6 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"889d7d63385666c54cb6e9aa9bdc3e0ba43b3fe70a635c4a87290177c7963212"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cff_encoding::parse_top_dict (cognitive 24): xberg_native_pdf::fonts::cff_encoding::parse_top_dict has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bd89a23930794aaa2d939592138ef3aad27241815a93b06758b85757d23cfc"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::font_dict::standard_encoding_lookup (cognitive 24): xberg_native_pdf::fonts::font_dict::standard_encoding_lookup has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 7 (11 pts), boolean chains 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":6186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d677aaf25d0329dddf62a8adf262c8f6e1895bc615aaf36a2f67638c851c5e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::ligature_components::ligature_rules (cognitive 24): xberg_native_pdf::fonts::ligature_components::ligature_rules has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (10 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/ligature_components.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24d0a519a0183a5f2a34abccaa9531302cbec2b4ccf9525e51802a1b6ccdba8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::inks_from_space (cognitive 24): xberg_native_pdf::rendering::separation_renderer::inks_from_space has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"497a91de74f7530ee39d5732ed53a0ea48f97879f2148dc51701eb6e15d60478"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::has_split_modal_column_groups (cognitive 24): xberg_native_pdf::structure::spatial_table_detector::has_split_modal_column_groups has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (7 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"caad9fe6a56aff9a39512d24bc81ec7c8dbc7ce25a4ecb8ac14f0575fb872a01"}},{"ruleId":"D2","level":"warning","message":{"text":"SlideIterator::resolve_graphic_frame_text (cognitive 23): SlideIterator::resolve_graphic_frame_text has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 2 (6 pts), loops 1 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/container.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1877d4bc75010333280e3df53e2b38f9f3a5348c4dca4167c8f6734d3ae16938"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexParser::parse (cognitive 23): LatexParser::parse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 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":"crates/xberg/src/extractors/latex/parser.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"439d827fdfc36e34eefc29bf9b049eed8a580690b181316ae91d45b561012de6"}},{"ruleId":"D2","level":"warning","message":{"text":"OrgModeExtractor::parse_inline_markup (cognitive 23): OrgModeExtractor::parse_inline_markup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 4, match/switch 1 (4 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":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a89edeffc431bed5106a67af6d4a33c1c4594134fe81aa2fc6b02f2c56f8fa"}},{"ruleId":"D2","level":"warning","message":{"text":"RstExtractor::is_list_item (cognitive 23): RstExtractor::is_list_item has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb83be80a9cf51fc4dc3dfa65c32797ec44685e55ae3873dce7129ed18a2f577"}},{"ruleId":"D2","level":"warning","message":{"text":"Layouter::draw_line (cognitive 23): Layouter::draw_line has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/pdf/layout.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4d8bf269c9d56725bc6dc71c2961d7e3bf1c6043d4947688a253d13b4f85d2"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::mime::count_unique_extensions (cognitive 23): xberg::core::mime::count_unique_extensions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (10 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/mime.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55a965f3a752bbcf9243c9690206469ceab7a210177a40d8eb7894d70cda0d5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::derive::pages::build_pages (cognitive 23): xberg::extraction::derive::pages::build_pages has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 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":"crates/xberg/src/extraction/derive/pages.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04d96e02a7ab661ef807a328ea20a5cb037d336aa647319725287f577c17e16"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::doc::piece_table::collect_story_subdocuments (cognitive 23): xberg::extraction::doc::piece_table::collect_story_subdocuments has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/piece_table.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b19058a1330bf038caebcc43228b0546109018f0cef76065d51e16ff6883f1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::ods::validate_ods (cognitive 23): xberg::extraction::excel::table_budget::ods::validate_ods has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/ods.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b4c58887f4885af32d68b734a7f6fdc9be3b02942323a83c21e072e739a24b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docbook::collect_id_titles (cognitive 23): xberg::extractors::docbook::collect_id_titles has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe30aaa579730123a745b29e0adfe08335557a2e157288598eb187ba0d02d47"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::html::push_link_uris_from_annotations (cognitive 23): xberg::extractors::html::push_link_uris_from_annotations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, loops 1 (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":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"203942a464394d03c717398ca80184a05c0708bec1c99dfc891e4600663a119f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::html::normalize_html_markdown_body (cognitive 23): xberg::extractors::html::normalize_html_markdown_body has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d478329ef297f350aa643cd08974f0b82286bbedac1f2d69baedb36040b9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::walk_own_line (cognitive 23): xberg::extractors::odt::walk_own_line has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (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":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c3e66b3fdcb4f4992bd8bca0272ebf51e58747d95c5c929cfca6d4bceec639"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::complete_formula_assignment (cognitive 23): xberg::extractors::pdf::complete_formula_assignment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"49920cf114e064b73c65d84d957475780f0e0b9c00f1971de36f775f4f8dfe08"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::insert_recognized_formula_element (cognitive 23): xberg::extractors::pdf::insert_recognized_formula_element has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09dfa8e72d07b0e0ca4a6c561d9fe053938eae49eb3d8446bff445f3e30d4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::restore_discarded_page_reads (cognitive 23): xberg::extractors::pdf::restore_discarded_page_reads has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc0e0aebd8ba00bd3f4906ea1bfa6a883435dbd13c8fa6ce674d7690d3868b4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::table::open_year_row (cognitive 23): xberg::pdf::native::table::open_year_row has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa92dac8eca75aacd1aaa46aab4a77aa274579cab0a3a3c33ef09bde00343ab"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::regions::table_recognition::build_tatr_grid_table (cognitive 23): xberg::pdf::structure::regions::table_recognition::build_tatr_grid_table has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 5 (11 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52ac42673fd60f8254113c7408825de863eade155eef4b70308c83a4e21bc80"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::compute_output_intent_cmyk_profile (cognitive 23): PdfDocument::compute_output_intent_cmyk_profile has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 11 (20 pts), if/else 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/catalog.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1b5ee02772bf2ebeb4c7fa74fdbc3f32ad430725439ea2c91d8534aedf5d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::apply_combining_mark_composition (cognitive 23): PdfDocument::apply_combining_mark_composition has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 9). Of this number, 22 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":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"007f2769e24bf04766ec59da0086ab33ecc99b7c35fc47ed51d52d522490bee5"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::should_insert_space (cognitive 23): PdfDocument::should_insert_space has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 9, match/switch 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8856c8d3866dedf37c82a6005e6f7bb0de596530189310a32e6b887d8543a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::mirror_spot_paint_into_sidecar_with_coverage (cognitive 23): PageRenderer::mirror_spot_paint_into_sidecar_with_coverage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (3 pts), match/switch 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6610}}}],"partialFingerprints":{"codehealthFindingId/v1":"449bef851047cdeb62da8f1722743b08ed66bdd150d269b6e6ae7a661ace6029"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::ccitt_bilevel::try_decode_with_fax (cognitive 23): xberg_native_pdf::extractors::ccitt_bilevel::try_decode_with_fax has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/ccitt_bilevel.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9d615da11e6d1711fa333fb95270eecd7ebb2d362df7d4ce0f12a340a5b774"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::mesh_shading::fill_gouraud_triangle (cognitive 23): xberg_native_pdf::rendering::mesh_shading::fill_gouraud_triangle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae876483015600cb29bcfe5cf00f93e30090ca7889c951836e3af9bb0a34537d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::mesh_shading::eval_type0 (cognitive 23): xberg_native_pdf::rendering::mesh_shading::eval_type0 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"506a0acc5acf9fe0df12ceeed609b3736c3b8c90c71de034a75fdf5d7ba712ae"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::build_grid_from_lines (cognitive 23): xberg_native_pdf::structure::spatial_table_detector::build_grid_from_lines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d7c7ae04686be9ba4e4bd40b9c56e15a19481d5178ae316f877a445f0300e6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::assign_spans_to_intersection_grid (cognitive 23): xberg_native_pdf::structure::spatial_table_detector::assign_spans_to_intersection_grid has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1840714ee71ebe8dda1a9b1fb22c71a3cd9d13295ed68d6f0517f7cc79f6a047"}},{"ruleId":"D2","level":"warning","message":{"text":"DocxParser::parse_comments (cognitive 22): DocxParser::parse_comments has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (16 pts), match/switch 2 (6 pts) (nesting depth added 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":4288}}}],"partialFingerprints":{"codehealthFindingId/v1":"937b0af44179bff6e76a0d069bf56ed80cfa661404c06eb90900fe0151881263"}},{"ruleId":"D2","level":"warning","message":{"text":"AsciiDocParser::substitute_attributes (cognitive 22): AsciiDocParser::substitute_attributes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 7, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/asciidoc.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eab8c3681631ec5964de9cc77d9d7ff9d842f19efdf27445f006fc9171a9caf"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::enrich::caption_images_onto (cognitive 22): xberg::enrich::caption_images_onto has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/enrich.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dabe35601d6715fd6a4c327e93b77ab15e3703028f71dd601391237b80a8f3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::diagram::svg::geometry::collect_geometry_at (cognitive 22): xberg::extraction::diagram::svg::geometry::collect_geometry_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/svg/geometry.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6773a7c5798225a11cb5921750e207ed1b4c12f5e4120184fa04776265baa971"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::ppt::read_table (cognitive 22): xberg::extraction::ppt::read_table has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 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":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb544e03fa6bff373bb95fdb89ad5d77b7fb7422463d36213526532c5e0f099"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::pptx::runs_to_text_and_annotations (cognitive 22): xberg::extraction::pptx::runs_to_text_and_annotations has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0befe774e35a318a0d49299308abb86d8a9ebd0cde53e9314ed4dbe68a92a8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::archive::build_archive_doc (cognitive 22): xberg::extractors::archive::build_archive_doc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/archive.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"61863df926f17fb77ab34551e83fff016568d25e3d950c68a157153e73f2e209"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::csv::parse_csv_rows (cognitive 22): xberg::extractors::csv::parse_csv_rows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/csv.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfc3464a913cb536f8e059e63b0af96143bb4293166008f0d37b2cb0afca09e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::csv::infer_column_types (cognitive 22): xberg::extractors::csv::infer_column_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), 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":"crates/xberg/src/extractors/csv.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f493919cea9c5e5f488356d74c06f75d38c89dd114e0fdcea8d4d02ae3549bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::excel::scan_for_dde_warnings (cognitive 22): xberg::extractors::excel::scan_for_dde_warnings has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"e619af68e1987f05943fe54caa340181ad3afae26fe5acb992f6ecc8a72c09d5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::extract_odt_internal_headers_footers (cognitive 22): xberg::extractors::odt::extract_odt_internal_headers_footers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c9ae319fd03094af3608f5ef151a80f696f0b4f12d9337cba193ae07ac5f96"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::mixed_plain::retains_inline_block (cognitive 22): xberg::extractors::pdf::ocr::pipeline::mixed_plain::retains_inline_block has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f266484a6759e866fc54c91b54f043559e0a21ea62586da062260c7f5e681564"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::metadata::decode_pdf_string (cognitive 22): xberg::pdf::native::metadata::decode_pdf_string has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/metadata.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b832aa16e4d2ca708eed2f83906adf488998972cf4ebb63e411863107df78f8e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::demote_heading_runs (cognitive 22): xberg::pdf::structure::classify::demote_heading_runs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad06bdd9f204d49a20e0a7fe491a5592c2129369911aceee985486a44d39a477"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::merge_consecutive_h1s (cognitive 22): xberg::pdf::structure::classify::merge_consecutive_h1s has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db67abac24dbe6ce050a483a695e0587b574b6b20808ecb88592b05594f2bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::regions::table_recognition::compute_col_gap_for_word_refs (cognitive 22): xberg::pdf::structure::regions::table_recognition::compute_col_gap_for_word_refs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9c1b3d001f26c85fbfb52ce0dbb7f68fc5e2bffa09fb058678311484ca1634"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::regions::tables::compute_adaptive_column_gap (cognitive 22): xberg::pdf::structure::regions::tables::compute_adaptive_column_gap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/tables.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"056f64cd43ff1a7ec174f2a415485ff7480f4cfef75d348611e8e28d9e3cd0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::common::build_footnote_ref_to_def_anchor (cognitive 22): xberg::rendering::common::build_footnote_ref_to_def_anchor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/common.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15bb8b29d345cb26272e2b837e04ed83925da319c5bf2febb5973c906f7dba7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::append_annotated_span (cognitive 22): xberg::rendering::comrak_bridge::append_annotated_span has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b94170cfc35d1d1ae0db378e407ca5ca7771c377f66eeded28f7061d0235a86"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::source_lists::paragraph_items (cognitive 22): xberg::rendering::comrak_bridge::source_lists::paragraph_items has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge/source_lists.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ce07cf1101e558654490f2148d83c91f5055212926af1fdda0028a82fd26ee"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::sparse_embeddings::engine::splade_pool (cognitive 22): xberg::sparse_embeddings::engine::splade_pool has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/sparse_embeddings/engine.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"627beb9fe56a0d0ad1140a7a41b473f6bd5ef32b28fb4e466c91b5563079c1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_candle_ocr::models::deepseek_ocr::utils::masked_scatter_dim0 (cognitive 22): xberg_candle_ocr::models::deepseek_ocr::utils::masked_scatter_dim0 has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/utils.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3c3ab589109ca61224316ffb1ff8f468e88cdfbd8e156ef90e88d179499863"}},{"ruleId":"D2","level":"warning","message":{"text":"TextPostProcessor::rejoin_hyphenated_words (cognitive 22): TextPostProcessor::rejoin_hyphenated_words has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 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":"crates/xberg-native-pdf/src/converters/text_post_processor.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffd9700d25f9bf5f4eef9f21b44eb70acef1a6eadcdc3c557c7e036f0656c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::extract_paths (cognitive 22): PdfDocument::extract_paths has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (10 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4466499571ac58e129a22e727d4dffca952e4285363bbeffb4d1ec241e88aae6"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::compute_font_weight (cognitive 22): FontInfo::compute_font_weight has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4 (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":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":5151}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4186e2e0ef911bd56521e9c6a94d261c68c3c4175701bd2e19263c30f7707a3"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_type3_text (cognitive 22): PageRenderer::render_type3_text has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 4, boolean chains 1, loops 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ea06f7fd0d76f5009d0a1c9ff2747eae7cf6e853afff34f034063eb2ce1ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_content_stream_images_only (cognitive 22): xberg_native_pdf::content::parser::parse_content_stream_images_only has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (14 pts), if/else 5 (7 pts), loops 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e461be7299a604cc50dd735447aea888a877749ac2f55481e06c6f10073d054"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::images::decode_indexed_pixels (cognitive 22): xberg_native_pdf::extractors::images::decode_indexed_pixels has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cf30537da7bbb8ee3915290af63606a6b5463233ee87fa329c62b9ae2b79b5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::page_renderer::project_iccbased_to_rgb (cognitive 22): xberg_native_pdf::rendering::page_renderer::project_iccbased_to_rgb has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8597}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd211c5335124ff2f0010d767e8f9572c0c63be2da6b9386e8cb200e897f1cf"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::painted_double_rule_grid::owns_words (cognitive 22): xberg_native_pdf::structure::spatial_table_detector::painted_double_rule_grid::owns_words has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector/painted_double_rule_grid.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3daf56bc03a87b7361fb97cb7af4ee38d531cd88de44572b99eb2616ac2f24"}},{"ruleId":"D2","level":"warning","message":{"text":"downloader._safe_extract (cognitive 22): downloader._safe_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (6 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":"cli-proxy/pypi/xberg_cli/downloader.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e8a4a629102622f083af22fa7d660833a1c53ac387c92c70d9c9638417ac85"}},{"ruleId":"D2","level":"warning","message":{"text":"TextChunks::update_next_sections (cognitive 21): TextChunks::update_next_sections has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/text_splitter/splitter.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e0d8071dfcace9ec692b0377b2adb9610239f19337798ca1c76de540954434"}},{"ruleId":"D2","level":"warning","message":{"text":"ScriptIndex::read_page (cognitive 21): ScriptIndex::read_page has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/chpx.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02e91fd9468125f0d5db3fe33b73d25bb308882ee75a26a44775d167c97b571"}},{"ruleId":"D2","level":"warning","message":{"text":"ExcelExtractor::build_internal_document (cognitive 21): ExcelExtractor::build_internal_document has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bd4e63aa6bf6bfdae40aebd99e2553e8538bf956bc64ce4d95790bf2d64de3"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeTextStats::compute (cognitive 21): NativeTextStats::compute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 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":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb95fe24e1543e705ef0af1d1958bc912013bfac4589b1b6e91abda0908d3722"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::engine::structured::chunk::batch_pages (cognitive 21): xberg::engine::structured::chunk::batch_pages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/structured/chunk.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"355200b984e4b12892034b5fc875975a4346186c7b5ca0e7c9981a304e891a5a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::doc::piece_table::decode_piece_chars (cognitive 21): xberg::extraction::doc::piece_table::decode_piece_chars has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/piece_table.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f5fddc70ca65a6678f9f7d9169ab59da9fef93b375ede4bd3b26edf5c31d87"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::email::maybe_transcode_utf16 (cognitive 21): xberg::extraction::email::maybe_transcode_utf16 has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5c8e42881a9ff8fdd545040922fcfa04e7352cfcb13f967b9a5beeb01d216f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::hwp::equation::tokenize (cognitive 21): xberg::extraction::hwp::equation::tokenize has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/hwp/equation.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"872e6ca0e8637963ccdbbc9262dee2a2b3e84e6dc558c2c9d7f9418ea96a24b6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::pptx::collect_slide_hyperlinks (cognitive 21): xberg::extraction::pptx::collect_slide_hyperlinks has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a202084aa8068c8d09beab28be87b7caaa5001e4c24c31dac0b244d587d08a42"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::docbook::extract_figure_with_caption (cognitive 21): xberg::extractors::docbook::extract_figure_with_caption has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5d54fda890441640e47aa9b0e720372232d0e9af0352ad19593056552bcc71"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::epub::collect_annotation_uris (cognitive 21): xberg::extractors::epub::collect_annotation_uris has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"0408a54d71a0f336e70a5831afb7543453a3e4234b56cd81fd1207834c29da73"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::extract_frame_description (cognitive 21): xberg::extractors::odt::extract_frame_description has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 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":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f3757dc2ef5043142021df5aac2f37f09f63c21c70add607b1da4e692ac937"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::latin_rows::plan_row_edits (cognitive 21): xberg::extractors::pdf::ocr::layer_token_recovery::latin_rows::plan_row_edits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/latin_rows.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae845c0c85b90573f826366b3271ae60d2244dfa324b45f35be467d4a61a5a61"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::inline_khmer_anchor (cognitive 21): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::inline_khmer_anchor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6dabb0df6b3c050f433fe7c369a0b5ab149ce445619f76638fa10c60342ada"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::scoring::normalize_markdown_for_scoring (cognitive 21): xberg::extractors::pdf::ocr::scoring::normalize_markdown_for_scoring has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a1cf0fe6a1d67b75172441651010b74143e18b9bed0398a380fdd0cbce6524"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::tall_source::certified_strip_lines (cognitive 21): xberg::extractors::pdf::ocr::tall_source::certified_strip_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, 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":"crates/xberg/src/extractors/pdf/ocr/tall_source.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"24212b8f0b4be31bf46268dfcde1af1431dbc4d24584a88df93029ef59480c44"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::picture_layer::merge_retained_picture_pages (cognitive 21): xberg::extractors::pdf::picture_layer::merge_retained_picture_pages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/picture_layer.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8190420c0fe1f13f79a03a7310c536a192fa7395ff06e60392a58debd08042d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::expand_binary_payloads (cognitive 21): xberg::extractors::rtf::expand_binary_payloads has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"13136c725b9b2a1a72bd37fd121861ba03de63d9a91b943f025597f583088fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::structured::scan_geojson_geometry (cognitive 21): xberg::extractors::structured::scan_geojson_geometry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 1 (3 pts), match/switch 2 (3 pts), boolean chains 2 (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":"crates/xberg/src/extractors/structured.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6029f614c8898e561737ac81e14eb4866551bbb4f11e532f0712cae0cc2bec11"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::embedded_files::collect_from_name_tree (cognitive 21): xberg::pdf::embedded_files::collect_from_name_tree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/embedded_files.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b5c955666712c9ebf1c28aa7fd7a68845cb733fc0480f5a85a83aa94d49134"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::assembly::assemble_page_elements_with_tables (cognitive 21): xberg::pdf::structure::assembly::assemble_page_elements_with_tables has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 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":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fd3c95be0de7bece2332d3b67b92072076f1325ca7ed2ffd336c3d84c82fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::classify_running_margin_regions (cognitive 21): xberg::pdf::structure::pipeline::classify_running_margin_regions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7575}}}],"partialFingerprints":{"codehealthFindingId/v1":"215004eb860edf0a7dc97be2901fa4bd8062c7d4ce29de050fa19a7d0de0ded6"}},{"ruleId":"D2","level":"warning","message":{"text":"PaddleOCRVLModel::forward (cognitive 21): PaddleOCRVLModel::forward has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (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":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27dd73449b6bf35b50122860ce4f818a5fdade1472e9e1fac094c53fbdd4cbd"}},{"ruleId":"D2","level":"warning","message":{"text":"EncodedInput::from (cognitive 21): EncodedInput::from has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/preprocess.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7480b8d897a854b902e7b83934f388efb66bc68ae57f44596c0b4c6873caf0b"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::mark_running_artifact_spans (cognitive 21): PdfDocument::mark_running_artifact_spans has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfbfa281f78c2a3ef78fba31fcc1e3faa2a061914693fdb952ff7ba937dedad"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::std14_width (cognitive 21): FontInfo::std14_width has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 6 (10 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":3405}}}],"partialFingerprints":{"codehealthFindingId/v1":"893cdb0f460803c4ce053a1f2eb774e3d84a3adbea2c320f148d88d837dfe2f1"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::peel_full_width_line_bands (cognitive 21): XYCutStrategy::peel_full_width_line_bands has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a95860c00f96d6131e302ec1093e996fce14b5f3ac92d6e00cba0ee7b75c24"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_shading (cognitive 21): PageRenderer::render_shading has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e368683009b301c7659bee9e0e34b6d9bcdb72dea8bcb63652a91572b603c3c4"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::mirror_cmyk_paint_into_sidecar_with_coverage (cognitive 21): PageRenderer::mirror_cmyk_paint_into_sidecar_with_coverage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, boolean chains 5, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6405}}}],"partialFingerprints":{"codehealthFindingId/v1":"af201b83143d9eabb733731ffce743263a1031cdfaf128482e6a80184d40670f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::decoders::ccitt::decode (cognitive 21): xberg_native_pdf::decoders::ccitt::decode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dacd248994cfcabd872cd819230762e460ece14154c7d78f7b37bfbde1f55c5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::images::scan_app14_color_transform (cognitive 21): xberg_native_pdf::extractors::images::scan_app14_color_transform has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"551dd2707a51ffb8588fa35b03d2e6fbcba56f08dd8cc181dbe1c4bf40e937b7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::pipeline::reorder_rtl_word_runs (cognitive 21): xberg_native_pdf::pipeline::reorder_rtl_word_runs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5afcdc2e65a6248254f6ee8e2758ea9f6500f0b722baa2b26d9b377c80c89d6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::text::bidi::wrap_rtl_isolates (cognitive 21): xberg_native_pdf::text::bidi::wrap_rtl_isolates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/bidi.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f30ea6761925c1a1886dde0ad137c08e69cd3f359786a39f2a6aa1d9c610472"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_pdfium_render::pdf::document::page::text::filter_generated_spaces_direct (cognitive 21): xberg_pdfium_render::pdf::document::page::text::filter_generated_spaces_direct has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 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":"crates/xberg-pdfium-render/src/pdf/document/page/text.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b724113b766439aa38c7e997a9bd9abd1c4a500841da8188f6dc2bbea88f33"}},{"ruleId":"D2","level":"warning","message":{"text":"TesseractAPI::get_textlines (cognitive 21): TesseractAPI::get_textlines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5c48d75c3eee261d99142f4e27e7bbebbc5ce12f5e716b64b90c8434309969"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::resolve_heading_level (cognitive 20): Document::resolve_heading_level has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5334d803f83386a3ac9d44048bbba9bf471f30f5711a5e61e13b51a45178898"}},{"ruleId":"D2","level":"warning","message":{"text":"JupyterExtractor::extract_notebook_value (cognitive 20): JupyterExtractor::extract_notebook_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f4aa5987ab79e65632a33a81b0181e18e64f682a3d5bb49f7f79f2ab10d341"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentState::strip_new_comment (cognitive 20): CommentState::strip_new_comment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/utilities.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6410f6062b344f4f6718fce20f1d658cdec28cf53e545ceaa258e8ed046698d"}},{"ruleId":"D2","level":"warning","message":{"text":"OrgModeExtractor::is_structural_start (cognitive 20): OrgModeExtractor::is_structural_start has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e7a6e5e821770cf5e64f1ba59201626b1ce1cee6ca5b92287472aa936ae3d4"}},{"ruleId":"D2","level":"warning","message":{"text":"ZipBombValidator::validate (cognitive 20): ZipBombValidator::validate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/security.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"82eed34e4895f90df4eae5496d270ba6637b17c2a3d3ea4244ac20cbe9ac76ca"}},{"ruleId":"D2","level":"warning","message":{"text":"VisibleMarkdown::inline_math (cognitive 20): VisibleMarkdown::inline_math has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/redaction_projection.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cff450c280e1bc4ed15c600e2854879c01a508f98a8564b6bce84f3c8474dd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::derive::validated_table_grid_occupancy (cognitive 20): xberg::extraction::derive::validated_table_grid_occupancy has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc21265b1506b31d9463bbe077210c668fbf30fdbd00d3ee386c63bb6d3ad36"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::derive::compute_formatted_content_observed (cognitive 20): xberg::extraction::derive::compute_formatted_content_observed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"3051b9d51da9d91080441965913fcc4cb9f9bda5efbf79dc952849c57a577d00"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::derive::pages::render_observed_page (cognitive 20): xberg::extraction::derive::pages::render_observed_page has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/pages.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab668659187aa4141c04563aabb8ffb6b7cc37058f2d9882b154988543bc1fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::diagram::matching::find_gridlines (cognitive 20): xberg::extraction::diagram::matching::find_gridlines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/matching.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddb9d54a44efcaa739b881fb8acfe085fa58752e76b9d5008e19114bf1227ef"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::doc::images::extract_pictures (cognitive 20): xberg::extraction::doc::images::extract_pictures has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 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":"crates/xberg/src/extraction/doc/images.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"207cf8bf98adaf0d90e51bd90873c3729a8da1ebf2a454c96dcf4ba4a5083c11"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::ods::drop_skipped_sheets (cognitive 20): xberg::extraction::excel::table_budget::ods::drop_skipped_sheets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/ods.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9743b501b663a058755cf8305f28aad29a50efd8ec8865493335f359a3143b5b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::image_ocr::embedded_rows::assemble (cognitive 20): xberg::extraction::image_ocr::embedded_rows::assemble has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_ocr/embedded_rows.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda9755cb61c67df4e9bc50c9e54e5135c7ad802f76e7ad5b0389a3476f54e48"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::image::recognize_assembled_formula_regions (cognitive 20): xberg::extractors::image::recognize_assembled_formula_regions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3e7bc8c42be0bb6086df9ca746dfec449ea6575516b5ae61626e137600ebc3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::image::apply_numeric_repair_to_standalone_image_ocr (cognitive 20): xberg::extractors::image::apply_numeric_repair_to_standalone_image_ocr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (8 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":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":3024}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7178f6a8fd1b247635c8941dd4367ca449da45bb1e22b0dcc56fd5c8d72c21"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::iwork::pages::build_pages_internal_document (cognitive 20): xberg::extractors::iwork::pages::build_pages_internal_document has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 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":"crates/xberg/src/extractors/iwork/pages.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3897b07f8283a04c9bb92285685c98efec0b72e2a0f7c91370dacc3e368b963"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::latex::commands::process_line (cognitive 20): xberg::extractors::latex::commands::process_line has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/commands.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c864627773123e4248b267a27f5f001ce7f460691fa5243fc22b357efaec17fc"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odp::build_internal_document (cognitive 20): xberg::extractors::odp::build_internal_document has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (9 pts), match/switch 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e0cbe13d7150c8c1177e5b4060bbf9afd814d3b9b4a715a6bd613b6c25245e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::handle_odt_frame (cognitive 20): xberg::extractors::odt::handle_odt_frame has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c84ef9a0fd76d96aa4c45c51cbadc06c9476a8806ff36fe32bc6c9be122dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::build_internal_document (cognitive 20): xberg::extractors::odt::build_internal_document has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"9582b39d9ec8ba602f9234218e0c37c16fceedb4d101401df00248973f6eeea7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::document::reindex_structured_ocr_page (cognitive 20): xberg::extractors::pdf::ocr::document::reindex_structured_ocr_page has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":3380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebfe19eb114d043418d8c927a8cc02a089dc7c317937b8ce17a9643e4d77ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::recover_page (cognitive 20): xberg::extractors::pdf::ocr::layer_token_recovery::recover_page has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb9d534294409b49d93145f7a1e109c43995ab378402d618188f15643797016"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::tall_source::augmentation::read_tiles (cognitive 20): xberg::extractors::pdf::ocr::tall_source::augmentation::read_tiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (2 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":"crates/xberg/src/extractors/pdf/ocr/tall_source/augmentation.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d27fdb10032d5d9fdb4bb709e943f9f9badba4319ee119eb30a6fe917c92b89"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::reading_order::plan_segment_groups_by_layout (cognitive 20): xberg::extractors::pdf::reading_order::plan_segment_groups_by_layout has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/reading_order.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd974db14bc6954b42549c07eab97f417ffe62b0cbf217f6711111127ece43db"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::rotation::append_run (cognitive 20): xberg::extractors::pdf::rotation::append_run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 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":"crates/xberg/src/extractors/pdf/rotation.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88d111868970cdecc9c62e88765050a4371d4eeec148dff3567b35ed5047c43"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::metadata::apply_info_segment (cognitive 20): xberg::extractors::rtf::metadata::apply_info_segment has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/metadata.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f7c8f1df3168550ea6c4e72eb13e1fd984660445c15e7a798b9b1180c70375"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::script_retry::matched_primary_occurrences (cognitive 20): xberg::ocr::processor::script_retry::matched_primary_occurrences has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/script_retry.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea5f5207fa12b846b5d2072afb65d96ebc4992eda43bc117adbb97ba6f580bb"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::shaded_rows::padded_dark_band (cognitive 20): xberg::ocr::shaded_rows::padded_dark_band has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/shaded_rows.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed3783f0609ec99d9b0d6194f5e2d6ecfc4cfe18667e1ae166f1d86b94038fd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::annotations::extract_annotations_matching (cognitive 20): xberg::pdf::native::annotations::extract_annotations_matching has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/annotations.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ef458bdf8de6273d37df83e0077795b5872e9a5d8a1f9b64b62dbc135e702f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::text::page_low_occupancy_corridors (cognitive 20): xberg::pdf::native::text::page_low_occupancy_corridors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f7f7732d8ddf26bd02d426ad03f859675c214498cd877fc352d194184b6201"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::paragraphs::embedded_bullet_positions (cognitive 20): xberg::pdf::structure::paragraphs::embedded_bullet_positions has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (8 pts), loops 1 (nesting depth added 4). 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":"crates/xberg/src/pdf/structure/paragraphs.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea3540908ee88cdd39cad8e207be1027708f2dbab371fd165fd155843e3b04a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::dehyphenate_hyphen_only (cognitive 20): xberg::pdf::structure::pipeline::dehyphenate_hyphen_only has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7969}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a1a42e2b87fc4bdf32db6f32eb599a000d245183976526c5b2391f93261fbb"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::table_reconstruct::fold_column_into_neighbour (cognitive 20): xberg::pdf::table_reconstruct::fold_column_into_neighbour has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb56deee81b2cadacd2d600defe6f3265d127a1cfa2685adcc7660644ba8168"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::plain::render_body_plain (cognitive 20): xberg::rendering::plain::render_body_plain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/plain.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a413ec089e149f2c6426caaa0d33d84a32057e1f7f3b163e498fa5b65d39b61a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::text::summarization::textrank::pagerank_scores (cognitive 20): xberg::text::summarization::textrank::pagerank_scores has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (11 pts), if/else 4 (9 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/summarization/textrank.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29ae086a8b74f05d2b758966a2870610f16b86200b7a9864b5fb05f0fc58714"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::text::token_reduction::filters::general::remove_stopwords (cognitive 20): xberg::text::token_reduction::filters::general::remove_stopwords has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/token_reduction/filters/general.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4870e85915695f3529c6b1f4dded4a2fff67a077bd0c3a84ca83442710cb937d"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::try_assemble_vertical_cjk (cognitive 20): PdfDocument::try_assemble_vertical_cjk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/text_assembly.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa51df98384db3cf7919981ca625d40c1f0be50a9e3e8c4661b47224435c1380"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::flush_tj_span_buffer (cognitive 20): TextExtractor::flush_tj_span_buffer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7c3e483eaf266a6487ace9800bd95b02af8034f996dfa6f79f2e42fd5c9b08"}},{"ruleId":"D2","level":"warning","message":{"text":"XYCutStrategy::find_horizontal_split_indexed (cognitive 20): XYCutStrategy::find_horizontal_split_indexed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaff151f12c93d3dd3a528ddffa4b499847e5ac2a09ea3f19bf48248fc1951ef"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_tj_array_fast (cognitive 20): xberg_native_pdf::content::parser::parse_tj_array_fast has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3726}}}],"partialFingerprints":{"codehealthFindingId/v1":"711cbdbbd666e825e290e26a0db27ac5ff7083816ef6043e5b47e72e7971fb21"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cid_cmap::parse_cid_cmap (cognitive 20): xberg_native_pdf::fonts::cid_cmap::parse_cid_cmap has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cid_cmap.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"202f4f68a2906e5c99d037123a5b2a8dad79f94b81f7ad82072f4598485296cf"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cmap::line_parsers::decode_bfrange_array_entry (cognitive 20): xberg_native_pdf::fonts::cmap::line_parsers::decode_bfrange_array_entry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, 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":"crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ed436a09ea95000b828d0ab34253c9a5623fe00b714437b5da7b70067ed07a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::font_dict::decode_cjk_raw_charcode (cognitive 20): xberg_native_pdf::fonts::font_dict::decode_cjk_raw_charcode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":6488}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0deb22f1a53b468ecd28d0452d6b3d8a6a3c4b0787571463214dead5366311"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::traversal::walk_actualtext (cognitive 20): xberg_native_pdf::structure::traversal::walk_actualtext has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/traversal.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cefe93007775cbc8fc6e272ef7e3bc7bcb09a5756760069f457b3728520e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::xref_reconstruction::reconstruct_minimal_trailer (cognitive 20): xberg_native_pdf::xref_reconstruction::reconstruct_minimal_trailer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref_reconstruction.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e301f9a52b7cf9fcd88d9d4009fc92ab0b18b9c2ba2c6d5fa8bc0cbf5b4d040"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfRenderConfig::compute_output_dimensions (cognitive 20): PdfRenderConfig::compute_output_dimensions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/render_config.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"b978144d759cc20fdf03165df9dd1e9fd43edd3938cc36a454286e155ebffde3"}},{"ruleId":"D2","level":"warning","message":{"text":"Pdfium::new_with_config (cognitive 20): Pdfium::new_with_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdfium.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3954b097b83588810d5e29a246a38bada6971d512d6bd2188b86add8c7fe177"}},{"ruleId":"D2","level":"warning","message":{"text":"Element::sections (cognitive 19): Element::sections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/text_splitter/splitter/markdown.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"70211cc216fc70571970cb0fd324ed87cc17ccef362012913456a6cfc40fb7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"AsciiDocParser::parse_inline (cognitive 19): AsciiDocParser::parse_inline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/asciidoc.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"416eac778c71ff71538ea1af185ecdfb345b6f0a3732a64ac8b7b5b9a118a177"}},{"ruleId":"D2","level":"warning","message":{"text":"CodeExtractor::extract_with_language (cognitive 19): CodeExtractor::extract_with_language has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), loops 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":"crates/xberg/src/extractors/code.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4738f2675204505f7ce29eeb79b8d4dd078f43e674e4420093aef1557ace766a"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexExtractor::collect_heading_source (cognitive 19): LatexExtractor::collect_heading_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd20232bde18ce18fdf16247ff2914feec1cc83dac1cae9ba6c0e40ec98cd58"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::cache::cleanup::cleanup_cache (cognitive 19): xberg::cache::cleanup::cleanup_cache has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cache/cleanup.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8164152e72ce43ce5126b4848b0a0dab7a3069be06e13f5c6b0edf7768b1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::chunking::core::inject_table_headers (cognitive 19): xberg::chunking::core::inject_table_headers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1, loops 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 4 function items inside it that branch (extract_table_header, is_separator_cell, is_table_separator, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/core.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"89073ef8c123e506c0997938236f04176cdc8ca5724b5ccecb9c910858b01e81"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::run_pipeline_sync (cognitive 19): xberg::core::pipeline::run_pipeline_sync has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, match/switch 2 (5 pts), boolean chains 2 (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":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d32ad86d2cbedb9f25edc2a8e1b968aa1a57317912d10c5190554e7e7fec6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::execution::execute_processor_stages (cognitive 19): xberg::core::pipeline::execution::execute_processor_stages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/execution.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ca745d7ed7d12f0eb2c93234d5c69f5c60695160c8a3b6f3477ec6b4e02bfd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::doc::images::picture_offset (cognitive 19): xberg::extraction::doc::images::picture_offset has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/images.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"8234f95cdc039f2401a31adbee1af84d70d7bf91faf89e8e0085baee01bdf3be"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::math::elements::collect_group_chr_pr (cognitive 19): xberg::extraction::docx::math::elements::collect_group_chr_pr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 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":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50f5f9b56849c3fc18347a6f054594ea6dd24ce1240f4ca2235d48b71c0496a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::theme::parse_font_family (cognitive 19): xberg::extraction::docx::theme::parse_font_family has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/theme.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72be7fc153ba23a188ac2357af1d28cdb7bef2f0f6f4acdfba0fe48a26280aa"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::email::eml::extract_raw_headers (cognitive 19): xberg::extraction::email::eml::extract_raw_headers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/eml.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6170728f0ccaabfbf634c41dc66980fb53b12e42f1bd002657934c772299cd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::image::bounded_jpeg::read_frame (cognitive 19): xberg::extraction::image::bounded_jpeg::read_frame has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image/bounded_jpeg.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"987d41dda9aff9cf6ae027346d9eee2268244dc367cdfb3da3eaf1f92d9e362c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::pptx::build_slide_structure (cognitive 19): xberg::extraction::pptx::build_slide_structure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"f228edef1a95f40014da903275c36cf3e933d86a262801feca54a16df06a81c3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::pptx::parser::parse_paragraph (cognitive 19): xberg::extraction::pptx::parser::parse_paragraph has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1531a805daf3f048a306b84c9383db4f4124ded9255068c32de41f30d6288c7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odt::extract_node_text (cognitive 19): xberg::extractors::odt::extract_node_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"da02b5df37ffcdec78fb83fc502aa0f8d6abb982da499e15defe7733236ebb5d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::document::layer_lines_missing_and_owned (cognitive 19): xberg::extractors::pdf::ocr::document::layer_lines_missing_and_owned has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea645b3c9b71ba6c59ea4cb5cae952f6f9e90d63882e0bdfeafbb417f129d280"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::mixed_plain_tables::record_typed_table_occurrences (cognitive 19): xberg::extractors::pdf::ocr::pipeline::mixed_plain_tables::record_typed_table_occurrences has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain_tables.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b455a6a57e6d959d2016f98e59f1ad1f5721e2a632f17ade56850f2271626047"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::layout::postprocessing::heuristics::pick_removal (cognitive 19): xberg::layout::postprocessing::heuristics::pick_removal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/postprocessing/heuristics.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc81b8424c19b88d5c314ec1ac8ad8a2778cbc15e3660b6075150ad70d5c6a98"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::preprocessing::preprocess_pix (cognitive 19): xberg::ocr::preprocessing::preprocess_pix has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 3, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/preprocessing.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6349510a470135af5b5b6c90e4ac48a2aa288bc8b28ed2d94ca2271e2f312d7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::hierarchy::script_evidence::collect_owners (cognitive 19): xberg::pdf::native::hierarchy::script_evidence::collect_owners has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/xberg/src/pdf/native/hierarchy/script_evidence.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74b4ca5be00d6e5e000177239e8ab04dc2a7ef3715734c28c99d15f23312636"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::table::split_numeric_track_candidate (cognitive 19): xberg::pdf::native::table::split_numeric_track_candidate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":2410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d754d2abee226fad75d230710d82c37f20eda89611db9d2d88075300475f69b8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::table::source_members::source_size (cognitive 19): xberg::pdf::native::table::source_members::source_size has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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":"crates/xberg/src/pdf/native/table/source_members.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"123e2d7a4f6be354abfcade933b1b479cd046113f41a39d56c48c5bf261fc32b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::text::append_span_separator (cognitive 19): xberg::pdf::native::text::append_span_separator has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc2af898791045d3c662b907ea3664ed317c641a1458fd6947fd3094f830282"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::paragraphs::numeric_multiplier_end (cognitive 19): xberg::pdf::structure::paragraphs::numeric_multiplier_end has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 14, if/else 5. 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":"crates/xberg/src/pdf/structure/paragraphs.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"1444d1c5541c5e2ba3c90e2657f49a499b175b65093c2c0243c1ba9cf225facd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::paragraphs::legend_rows::witness_block (cognitive 19): xberg::pdf::structure::paragraphs::legend_rows::witness_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/paragraphs/legend_rows.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a73e9c9252c8c42dead06e37c4d03f75a52bd0a5d135e31dc777f4b384e533d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::paragraph_text (cognitive 19): xberg::pdf::structure::pipeline::paragraph_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3277}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1a099d32fd43a85920eba84dd701d81aeb772630401e2e765984a1a6c9b74c"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::has_clean_column_gutter (cognitive 19): PdfDocument::has_clean_column_gutter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"943034a631016846799eab404ae801548d7d4d18f5483dd07d4d8d83c4ef8325"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::two_column_rows_balanced (cognitive 19): PdfDocument::two_column_rows_balanced has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0020d28bede451dac5d8befc76e2383423774593f6812e22217385a0d77da4"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::get_page (cognitive 19): PdfDocument::get_page has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04f7cda23622937d6090bef51e44c09beb044fff9e8ec017ace67edf481d6df"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::reorder_same_line_runs (cognitive 19): PdfDocument::reorder_same_line_runs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd15baeec97477beab1cf4d2dff0455d90a37014b02241ba23e5487460eb178"}},{"ruleId":"D2","level":"warning","message":{"text":"FontInfo::parse_cid_widths (cognitive 19): FontInfo::parse_cid_widths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6086c4082494ca53ef6e74ee97328003d7978df0bb528f8d38849fdf95494fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::find_region_start (cognitive 19): xberg_native_pdf::content::parser::find_region_start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ddb3651f98b15c89e706bba0004671baf3e8c8d8b4a9f20c552eaec397e9e7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::outline::walk_name_tree (cognitive 19): xberg_native_pdf::outline::walk_name_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"crates/xberg-native-pdf/src/outline.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d516f4c8a2e59871a7226fc3bcf2e559b377d0b76c434563bb9091f979958f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::pipeline::reading_order::geometric::split_columns_at_y_gaps (cognitive 19): xberg_native_pdf::pipeline::reading_order::geometric::split_columns_at_y_gaps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/geometric.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c869290ad75606c6e245624e96afb2348d19bec752f0f81935d9a6d9dc110e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::paint_image_mask_to_plates (cognitive 19): xberg_native_pdf::rendering::separation_renderer::paint_image_mask_to_plates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 pts), match/switch 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":3126}}}],"partialFingerprints":{"codehealthFindingId/v1":"671b3447228fc04d05f38ca09d90737c1b91c5d8d4b4888a01f9771537e4b430"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_header_row_above (cognitive 19): xberg_native_pdf::structure::spatial_table_detector::detect_header_row_above has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e2cea2b8e22e5ee6608b54ea4cabcb3d2945cdb949007faefabd659d2d246a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::rule_band_spans (cognitive 19): xberg_native_pdf::structure::spatial_table_detector::rule_band_spans has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5aa5474413d79a072231d124c3b62c33f9fbedc10a3a3926a9163fa7eee6a7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::grid_to_table (cognitive 19): xberg_native_pdf::structure::spatial_table_detector::grid_to_table has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (9 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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":5063}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe46208b60c3db427dc0bc7bf585f941e2661ff9892351fc7526adc7946da50"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_pdfium_render::pdf::document::page::object::private::internal::remove_object_from_annotation_impl (cognitive 19): xberg_pdfium_render::pdf::document::page::object::private::internal::remove_object_from_annotation_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b677bea23e916cc74041428a6dd784083517e87923ab93bcf90df8c13a27116"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtractionConfig::validate (cognitive 18): ExtractionConfig::validate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 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":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd6bbdd1a86b00ec094ce63f44a45b2e5d3e5e42fa505eee8b18777ef5c5557"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelSelection::for_script_retry (cognitive 18): ModelSelection::for_script_retry has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, 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":"crates/xberg/src/core/extractor/cache_context.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0e99df4a5689488d8cea35973a151eaefe1e01190d08eb62b001d7661e9729"}},{"ruleId":"D2","level":"warning","message":{"text":"AsciiDocParser::parse_block (cognitive 18): AsciiDocParser::parse_block has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, boolean chains 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":"crates/xberg/src/extractors/asciidoc.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"da85583368e3567771008604f86d0362d8baa5832b6ef9740a9c0ec52c030ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"JupyterExtractor::richest_output_representation (cognitive 18): JupyterExtractor::richest_output_representation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9726147496c7b2f945deabb39fda3eb561a2c3b7d909f325418243c4a25ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::engine::extract_impl::extract_batch_concurrent (cognitive 18): xberg::engine::extract_impl::extract_batch_concurrent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6cc3c1b5c07c459534c5818ebdf57a8c2afdbfa60b2e60fb587cd354346335"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::math::elements::collect_delim_pr (cognitive 18): xberg::extraction::docx::math::elements::collect_delim_pr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 2 (5 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":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"646e43223e1f07746fbf1b00eb532fb266cf42412705308043ca30a099f394d8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::email::eml::extract_email_bodies (cognitive 18): xberg::extraction::email::eml::extract_email_bodies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/eml.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e955d7542f033caa9851c6f18ca340af270e5f1557cbac33309650fb843aabb2"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::excel::generate_markdown_and_cells (cognitive 18): xberg::extraction::excel::generate_markdown_and_cells has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (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":"crates/xberg/src/extraction/excel.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4648b03a9e694974c297d3c6e8c24247d59b357ddd103e5605520111339b4a6e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::hwp::parser::parse_records_into_paragraphs_and_tables (cognitive 18): xberg::extraction::hwp::parser::parse_records_into_paragraphs_and_tables has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/hwp/parser.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa65723597cceb22ffbbf4aadfd8669f576cc95bbfc181079675caab658b7e4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::pptx::parser::parse_group (cognitive 18): xberg::extraction::pptx::parser::parse_group has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff35d83e416fbcea0968dbcc88be58b81d603577d63824943a721c6e2bd985ef"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::structured::extract_from_value (cognitive 18): xberg::extraction::structured::extract_from_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/structured.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac7732f537557522bd595bc88301b22f35b4552f497f117e44ae030f483256c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::structured::extract_from_toml_value (cognitive 18): xberg::extraction::structured::extract_from_toml_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/structured.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f005fe769aa4f0939d14f39585a006d69fd601da4ec13ca33b0f0a77fb07a1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::image::update_recovery_tables (cognitive 18): xberg::extractors::image::update_recovery_tables has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 4 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"99538a8e1104aabe12d39349996fc4eb04b45f071810f7966537c336370b0d51"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::image::process_whole_image_ocr (cognitive 18): xberg::extractors::image::process_whole_image_ocr has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 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":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":2633}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e7739f8e142ba0dd2d2942bfcdb07a5f8d631272359efe8279bc69ec33c79"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::iwork::keynote::build_keynote_internal_document (cognitive 18): xberg::extractors::iwork::keynote::build_keynote_internal_document has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"74937aa73d6da96951ac6c01cb502ab72e07b8b70952335a1f3566eb31f03703"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::jats::parser::extract_text_content (cognitive 18): xberg::extractors::jats::parser::extract_text_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/parser.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a29c9e341047d0d26bfb2c638db826b88882fb139aef8c67d2ba6f4879f29b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::document::remove_misread_rows_from_document (cognitive 18): xberg::extractors::pdf::ocr::document::remove_misread_rows_from_document has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 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":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9322faa3378bf01139b8c65ce024d74ce682068a80dca56e1afd1b1ebc7e128"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::document::matched_layer_occurrences::positioned_rows (cognitive 18): xberg::extractors::pdf::ocr::document::matched_layer_occurrences::positioned_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document/matched_layer_occurrences.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0852d4a35054e7718bec4c1b0af3f7afaa7888cfe99a830bbaaec7170bc8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::surfaces_agree (cognitive 18): xberg::extractors::pdf::ocr::layer_token_recovery::surfaces_agree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dfd6e9d1b44cf85945476f404836b2d1610d20c4fee739f2627b3df087d8da"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::apply_minority_khmer (cognitive 18): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::apply_minority_khmer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20261c2342b6c0226d3f027a2d7d5fec12f280115e0ba592ed09c23f0bc54fe"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::inline_edit (cognitive 18): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::inline_edit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edec6899e50b6cc9f6aa6ddf4e14ada963f18d6939bed2082b481b2d36984aa"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::mixed_plain::retains_inline_group (cognitive 18): xberg::extractors::pdf::ocr::pipeline::mixed_plain::retains_inline_group has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73800643c73f4d61e6b0db002cb3a8d5b738b925c38321997645c5accfe527"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::unreadable_script::retain_unreadable_script_pages (cognitive 18): xberg::extractors::pdf::unreadable_script::retain_unreadable_script_pages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/unreadable_script.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"820b9bbb2ea3db786ed5f8f7bcb03fb8c6cbe240bfb1a7c3590f808b4830d194"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::keywords::yake::preprocessor::scan_word_end (cognitive 18): xberg::keywords::yake::preprocessor::scan_word_end has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (7 pts), boolean chains 6, if/else 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/keywords/yake/preprocessor.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"206796f45fc1b9c63cbcc12b3e2df9f9c5cc856bfcd874e6e7dd72f6e6b55c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::execution::should_apply_default_preprocessing (cognitive 18): xberg::ocr::processor::execution::should_apply_default_preprocessing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, 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":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e4dcc42541cc5d5779ab467f338139274c1c7d576ea11ddbaaa20577b8340"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::script_retry::merge (cognitive 18): xberg::ocr::processor::script_retry::merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/script_retry.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6088f610a7e6f9079760f4d69a0a599989bfa52f4744d9505d08b30b9e186765"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::shaded_rows::normalize_band (cognitive 18): xberg::ocr::shaded_rows::normalize_band has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/shaded_rows.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ca0b920a905d373e19590f32613132f90efab2c8c2a088476bf3140a073a93"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::adapters::regroup_layout_lines_by_element (cognitive 18): xberg::pdf::structure::adapters::regroup_layout_lines_by_element has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 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":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6cbb28d1ca92a92f68c11257861b7d28b92d1661fa820eda5f097b1a77c70ba"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::process_single_page_with_folio (cognitive 18): xberg::pdf::structure::pipeline::process_single_page_with_folio has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84b981e207444e1f4e6e4536a1f1a80a5b589aec3e9b868deabc5bd16dadb00"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::reattach_detached_list_markers (cognitive 18): xberg::pdf::structure::pipeline::reattach_detached_list_markers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22234eeabd581ce9c9e48f9a2636663d7a4e31d50b9627b68a5347c74f7f883"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::resolve_inherited_ff (cognitive 18): PdfDocument::resolve_inherited_ff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (PdfDocument::resolve_inherited_ft, PdfDocument::resolve_inherited_field_value) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54c2e703d579cccf7244912d90dddefc13817910617d48279c37ba13b339e60"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::resolve_inherited_ft (cognitive 18): PdfDocument::resolve_inherited_ft has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (PdfDocument::resolve_inherited_ff, PdfDocument::resolve_inherited_field_value) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5df5033692fdc75f8c977f09dd4895ac5050666bbb5d5de562ed09238de66f"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::resolve_inherited_field_value (cognitive 18): PdfDocument::resolve_inherited_field_value has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 2 other methods here (PdfDocument::resolve_inherited_ff, PdfDocument::resolve_inherited_ft) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eb385ef38c7db50da763c8d3a7d066cbd27c032d26e2c7dc7e6c118ae820e9"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::apply_super_sub_script_substitutions (cognitive 18): PdfDocument::apply_super_sub_script_substitutions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 2, loops 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0009de20ea022a55084db2ee0ab1f2de8494f0e0b05254219789702d2b0e306"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::compute_band_anchors (cognitive 18): PdfDocument::compute_band_anchors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"e041a2fdb43e12667b36f65c3bcf2f8700ea699027aeefe1eb79e69b24f1b91a"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::sort_by_reading_order (cognitive 18): TextExtractor::sort_by_reading_order has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_merging.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf22e3b6829db1c5b813d38e66c20accea977106200eedaaed23dfc6be15ac36"}},{"ruleId":"D2","level":"warning","message":{"text":"SMaskTransfer::eval (cognitive 18): SMaskTransfer::eval has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":7710}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ea005b0f516edcd3658af32b37e9d16e6c4c3a0e2f7bec3c7abffc8743b327"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::color::rgb_to_cmyk (cognitive 18): xberg_native_pdf::color::rgb_to_cmyk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/color/mod.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c3b44e90b4ed459f9d4b2b595ef2ccead454fdfab9d049561d7bdd70cac0bb"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::skip_dict_or_hex_string_scan (cognitive 18): xberg_native_pdf::content::parser::skip_dict_or_hex_string_scan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"2194b38c19045d44b2e77b8867b2120d3686cb81c1ed13ae0992621c7bd5c486"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::document::parse_header (cognitive 18): xberg_native_pdf::document::parse_header has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6d055bcf42605443b3612745ca8576ae3b768436d840f6a401c6b376082d92"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::elements::image::parse_jpeg_dimensions (cognitive 18): xberg_native_pdf::elements::image::parse_jpeg_dimensions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/elements/image.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e81338fb0d3b8bb5427913d83d33e592fa4e9b47e096fcab3731a0842f6e1a0"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::images::resolve_indexed_base (cognitive 18): xberg_native_pdf::extractors::images::resolve_indexed_base has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebec33ae913d1ab30b8a3efcf3686affbb4c3f8569de12af641488feca71d49c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::text::strip_cjk_digit_boundary_spaces (cognitive 18): xberg_native_pdf::extractors::text::strip_cjk_digit_boundary_spaces has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 8, 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":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86f3cf0d1ae0ebaa5a51b593568bb7fb179d7ca8272f114fed7a4081ee50b30"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::functions::resolve_conditionals (cognitive 18): xberg_native_pdf::functions::resolve_conditionals has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/functions/mod.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"40df902cf33d8d4f1f24d064763d5339a652e0c934fe61104812d883ea33f60c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::lexer::parse_number (cognitive 18): xberg_native_pdf::lexer::parse_number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/lexer.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0f67496c77664d74087980df20eb67e32bea061c6d730ecbfc14184a34ea49"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::pipeline::reading_order::xycut::group_lines (cognitive 18): xberg_native_pdf::pipeline::reading_order::xycut::group_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 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":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8010e3d7c1263e9914251e409c80ad164cf97796d1ecb8326fc5fb12375a574"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::mesh_shading::decode_type5_stream (cognitive 18): xberg_native_pdf::rendering::mesh_shading::decode_type5_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 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":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"204e0e934d766574b65ab396337bcb5c194db230a8b37cbbe959bf2b947f097b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::mesh_shading::render_patches (cognitive 18): xberg_native_pdf::rendering::mesh_shading::render_patches has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78863ac04c461bb63879dd10bc1b3178aad4cc6949e09cb44bc2cd01b7f1648"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_columns (cognitive 18): xberg_native_pdf::structure::spatial_table_detector::detect_columns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8626d24a0271ced19f97e8e0768bc994a387bd56a6c7f25f524c393e80c24f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::extract_edges (cognitive 18): xberg_native_pdf::structure::spatial_table_detector::extract_edges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a389095e743eb7ea6d45e75b377d5e6b64e7f03bb4fc6f82725bdb8e45dc371"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::build_table_sections (cognitive 18): xberg_native_pdf::structure::spatial_table_detector::build_table_sections has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4126}}}],"partialFingerprints":{"codehealthFindingId/v1":"417bcdfe66b107ee1aafd19ecd113d090151ae10aab6a67bd3a9c8a902fbca28"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::xref::find_actual_xref_offset (cognitive 18): xberg_native_pdf::xref::find_actual_xref_offset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 6, 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":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c910db04c9dcc7c5f2f2e43cedc8a0722743deb2f622ff798760786e828930b0"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDestinationViewSettings::view_settings_for_mode (cognitive 18): PdfDestinationViewSettings::view_settings_for_mode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 5 (6 pts) (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/destination.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d4305bbd554bb9ac0bd63595ba406472ea05db6c5b299c1e579c92531de64f"}},{"ruleId":"D2","level":"warning","message":{"text":"graphs.validate_outlets (cognitive 18): graphs.validate_outlets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/caption_export/src/caption_export/graphs.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9de34744f36339903d9a95b0a20f280e51a63483fa0c919715eae47aaa5f3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"source.inventory_files (cognitive 18): source.inventory_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/caption_export/src/caption_export/source.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"02897ad1fed28ea357e7b32bed89c356d4fe6b33678d286cbfd68a1d7335c438"}},{"ruleId":"D2","level":"warning","message":{"text":"Slide::to_markdown (cognitive 17): Slide::to_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/elements.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15a97a717e96b96647a4d26515cb93b8544988400a765af5be6819057f1cac6"}},{"ruleId":"D2","level":"warning","message":{"text":"FictionBookExtractor::extract_table (cognitive 17): FictionBookExtractor::extract_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0abee66f4ed219d52f138a5680db2dc5dfcce2798c8c5af088d776ab6699b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"PptxExtractor::build_internal_document (cognitive 17): PptxExtractor::build_internal_document has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pptx.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"644ddac8f866801863a1372020dfae83b1ca31191ccb8c62c35cc34b6fd7aa6e"}},{"ruleId":"D2","level":"warning","message":{"text":"RstExtractor::parse_list_table_rows (cognitive 17): RstExtractor::parse_list_table_rows 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":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"e846bfd92afdb51450d7d306d2b9bb3ead9d0f5737a76d572f697bb01907ca8c"}},{"ruleId":"D2","level":"warning","message":{"text":"TypstExtractor::explicit_table_header_range (cognitive 17): TypstExtractor::explicit_table_header_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aca052572ce761540f0b2ddb84accb11a032eb0b0eff7f9a59da2b96cbc0a84"}},{"ruleId":"D2","level":"warning","message":{"text":"WpdWalker::handle_table_event (cognitive 17): WpdWalker::handle_table_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/wordperfect.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50026a2d75ded4c0989f33cb13f8748f69ac92e0b7550456220160d76162400"}},{"ruleId":"D2","level":"warning","message":{"text":"Yake::ngram_selection (cognitive 17): Yake::ngram_selection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/keywords/yake/mod.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd4f01157a72c9a8270f059a2b1c2893a3c5aa1cd116b83a92ebdf347dde6bf"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentExtractorRegistry::get_candidates (cognitive 17): DocumentExtractorRegistry::get_candidates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/extractor.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"068bc716529ed27f8115eb1f2f634b6c5cece1e3602c2e1170c7ba672789adad"}},{"ruleId":"D2","level":"warning","message":{"text":"Matchers::scan (cognitive 17): Matchers::scan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/literal_leaf/plan.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ab1a01f4f2c0cd3e567679062f67a94029533daeae1c1a910ed5ffbcd18939"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentStructure::validate (cognitive 17): DocumentStructure::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/document_structure.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8b3536d62b14fdd2b51b0f8d0105285bb00a24f13d4c9f486121c3e8ecf451"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::features::attach_chunk_vectors (cognitive 17): xberg::core::pipeline::features::attach_chunk_vectors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"115cfc4e3f4641ee61710308555ef41c6c36fd63849634ac0e2a06cdfdff0512"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::core::pipeline::features::execute_token_reduction (cognitive 17): xberg::core::pipeline::features::execute_token_reduction has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (7 pts), loops 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":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3b210ee8fc58077ee45c56d4db9be26bbe1a2c1eed6e5ec5c1d7a5b25f9b5b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::doctags::push_element_body (cognitive 17): xberg::extraction::doctags::push_element_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doctags.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fd0de94d48ce2b8cb9769910ddabb88af4ef68580dd09fa7dd454374e5c359"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::email::rtf::decompress_rtf_compressed (cognitive 17): xberg::extraction::email::rtf::decompress_rtf_compressed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/rtf.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"42aca80349bd1549892c349e9e6a61de34af0e945e9ff5bd16a9f8a1164b7489"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::ods::handle_start (cognitive 17): xberg::extraction::excel::table_budget::ods::handle_start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/ods.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2521e08bc18fa4c720c27285b0fc6be0a85cf7d2b1ddb07737855929f9aa891d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::xlsb_framing::collect_sheet_paths (cognitive 17): xberg::extraction::excel::table_budget::xlsb_framing::collect_sheet_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/xlsb_framing.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"463595a735dff30f80684e350fc81fe9f674e02673cd6b33c5383534a9ff6fb8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::zip_metadata::validate_strings (cognitive 17): xberg::extraction::excel::table_budget::zip_metadata::validate_strings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/zip_metadata.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"993a1df547c5149d09144985b2ce3562a050641d52a651c59d86d3e9411f97c7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::image::png_pixel_density_dpi (cognitive 17): xberg::extraction::image::png_pixel_density_dpi has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"732950cde369ebaada3312a240af7f09d2a112036b039cc0bf6f3978edd41379"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::image::bounded_jpeg::admit_reduced_decode (cognitive 17): xberg::extraction::image::bounded_jpeg::admit_reduced_decode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image/bounded_jpeg.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a088675f3d2c28780ca62e74e63a71d77cff2f27cbe75d0c6dc01301faa17c93"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::mathml::convert_apply (cognitive 17): xberg::extraction::mathml::convert_apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee3ac0326509248bdb6433c362dc0e0a38edf03276109d570ba2c5d9df6b08e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::ppt::slide_persist_ids_in_presentation_order (cognitive 17): xberg::extraction::ppt::slide_persist_ids_in_presentation_order has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (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":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"75150a9e58358122be2e5df17b02e93f4c22a3feb9f295613178003fba74cd38"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::structured::extract_from_json_value (cognitive 17): xberg::extraction::structured::extract_from_json_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/structured.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"babb8a6d79830aa0d030d5dbe3443c79490e0fc6c0c1de093dd9d0a875a72179"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::hwp::apply_char_shapes (cognitive 17): xberg::extractors::hwp::apply_char_shapes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/hwp.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"835cf1a885e7b502e6736d2c0c2351d1ead449628f3721c7e03f131dedcf90b1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::hwpx::build_paragraph_content (cognitive 17): xberg::extractors::hwpx::build_paragraph_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/hwpx.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8d96da4ec3e6ad4304338201b0683e58ae808cb935e698ca61d9b5f52b9776"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::image::identifier_slots_are_preserved_after_recovery (cognitive 17): xberg::extractors::image::identifier_slots_are_preserved_after_recovery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"44008cdef7c2f52b5010e31e0995ea07cbf597d13ebd8bbeb892aeb3240b8bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::odp::extract_odp_notes_text (cognitive 17): xberg::extractors::odp::extract_odp_notes_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d08bc4c92718f21f195b5dcc1922bec49c01579307e027a12d01757d33ee9c7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::document::layer_lines_absent_from_ocr (cognitive 17): xberg::extractors::pdf::ocr::document::layer_lines_absent_from_ocr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc6bedca0ed575e8dbfa3408a6e573b3de7403843644e38aa06cb31af19f2d1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::document::matched_layer_occurrences::replace_identifier_group (cognitive 17): xberg::extractors::pdf::ocr::document::matched_layer_occurrences::replace_identifier_group has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document/matched_layer_occurrences.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d754369dd036bd991b639c0d1c7f716e32bb76536ba52c667711880f75a27b1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::pipeline::mixed_plain::record_block_markers (cognitive 17): xberg::extractors::pdf::ocr::pipeline::mixed_plain::record_block_markers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bf652cd73b51e729297c9204dfab535c41d2b6bd81c7530eeabdba02e54813"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::scoring::evaluate_per_page_ocr (cognitive 17): xberg::extractors::pdf::ocr::scoring::evaluate_per_page_ocr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e49ed25a60bd4984b2f095c2d774c4a3a890dbc00e4dd46a9fbf84f92377ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::tall_source::samples::decode_source_gray (cognitive 17): xberg::extractors::pdf::ocr::tall_source::samples::decode_source_gray has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source/samples.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c32318f99f41325fb61277bf03850cc8a667d951f8ed1c8a890262276605aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::picture_layer::read_retained_picture_pages (cognitive 17): xberg::extractors::pdf::picture_layer::read_retained_picture_pages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/picture_layer.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63aaed4b1cc70c581ed26312ff6fc28182e10d95466bf8018776ac36c3f681a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::parser::control_word::handle_text_emission_control_word (cognitive 17): xberg::extractors::rtf::parser::control_word::handle_text_emission_control_word has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/control_word.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d217d1b53f05025e52ad085438854d45f2003f69aac100d87c6b9ecb555ff5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::vtt::parse_track (cognitive 17): xberg::extractors::vtt::parse_track has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/vtt.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18b7e084dcbacdafb795ff5e4c0b990cfaa66bb9cf22e394c75f894ca6c0d38"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::table::source_members::projection::project (cognitive 17): xberg::pdf::native::table::source_members::projection::project has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table/source_members/projection.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b415244c4439547707ab3dea279655c144d983cfd0f7b2220ef77377cdcb129"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::assembly::recovered_headers::header_band (cognitive 17): xberg::pdf::structure::assembly::recovered_headers::header_band has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly/recovered_headers.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daf9676e16aeaa07be58bb2b3a610d772df6a085c973868411c31b33554b619"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::infer_section_level (cognitive 17): xberg::pdf::structure::classify::infer_section_level has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b6bfdb6449c027bc9d03e00c41078575d07aabf93460fe6929b11e7a4546ae"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::demote_unnumbered_subsections (cognitive 17): xberg::pdf::structure::classify::demote_unnumbered_subsections has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaa0250fb9448d0608d1d94f39ca6e8e01be07007f6068ee0be94944ac24a2d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::share_one_margin (cognitive 17): xberg::pdf::structure::classify::share_one_margin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c67507e0e088919818a7f1aa396ccbe544596c64cbd357af23241180f2825de"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::paragraphs::split_embedded_list_items (cognitive 17): xberg::pdf::structure::paragraphs::split_embedded_list_items has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/paragraphs.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c02cf8628f3e3972f6f758d84aff7d13e4340d5c3f0e146bcac59387bef63a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::regions::table_recognition::build_slanet_cells_table (cognitive 17): xberg::pdf::structure::regions::table_recognition::build_slanet_cells_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e0bb0f9d496ecd44756afd1157cf8828671dc266c7ad07782ea9c6d20b58bb"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::text_repair::repair_ligature_spaces (cognitive 17): xberg::pdf::structure::text_repair::repair_ligature_spaces has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/text_repair.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"27843aa31bcf52e1c71ad3b138dbeffaa50e2a9fd121959a7b905941451427ac"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::comrak_bridge::keep_code_literal (cognitive 17): xberg::rendering::comrak_bridge::keep_code_literal has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (9 pts), match/switch 3 (5 pts), if/else 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"41915f0507f9553af1dea7673e3530985518d2858577be6b7cb48c8ce079ed8f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::pdf::writer::outline (cognitive 17): xberg::rendering::pdf::writer::outline has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/pdf/writer.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d98a648ed0c1d3a3de3b2c8ca0875c5402ee706961e922d472ea35beeeae8b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::reranking::rerank (cognitive 17): xberg::reranking::rerank has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/reranking/mod.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"8267b90cf0a531f080fe4709167a87d9151004d33a5c0f6a5bf837882357dd6c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::table_core::repeated_column_edge_words (cognitive 17): xberg::table_core::repeated_column_edge_words has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 3 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/table_core.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76416bc0bcc703dcb019e4f62ad66a9ed7e4a95e479a4736dd7265a254cfb27"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::text::markdown_footnotes::parser::parse_footnote_definitions (cognitive 17): xberg::text::markdown_footnotes::parser::parse_footnote_definitions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/markdown_footnotes/parser.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe1bb8f201f00427a430f43a5f455d548e5656532cb830636b96da6c32e4c00"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::text::markdown_footnotes::parser::find_unmarked_claims (cognitive 17): xberg::text::markdown_footnotes::parser::find_unmarked_claims has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/markdown_footnotes/parser.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"324457ad56c6b5b68e67799c2fbac6fae5b48d4d4f2bb41eb5a42c5d2ffbe5f8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::text::redaction::engine::compile_custom (cognitive 17): xberg::text::redaction::engine::compile_custom has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edb00f6645a33247af9e1156b9719e27ccbd791ae8c13cd5cb2cf23a69baf9c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::text::redaction::literal_leaf::plan::ordered (cognitive 17): xberg::text::redaction::literal_leaf::plan::ordered has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/literal_leaf/plan.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bba59bdbaced66d4cc5ce62676987a8cc86d2a94ed1511fb1a7df2962ab510"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::text::redaction::literal_leaf::plan::collect (cognitive 17): xberg::text::redaction::literal_leaf::plan::collect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/literal_leaf/plan.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa744a8cb66447eb4d6e90c5847a138ffe89ed381cf7e8a57d1fddb0b27e793"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::utils::quality::clean_repeated_punctuation_ascii (cognitive 17): xberg::utils::quality::clean_repeated_punctuation_ascii has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 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":"crates/xberg/src/utils/quality/mod.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca249b7a39c8a5a8e3fcd8b9d77f56fc38395a6f088f789aed3596d4dceb4f73"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_gliner::candle::decode::collect_candidates_for_start (cognitive 17): xberg_gliner::candle::decode::collect_candidates_for_start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/candle/decode.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"770ea745b8be7bc994e919dc5b8542e66ddad7c68c0c568f041895b8239e8e20"}},{"ruleId":"D2","level":"warning","message":{"text":"TextPostProcessor::ensure_special_char_spacing (cognitive 17): TextPostProcessor::ensure_special_char_spacing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/converters/text_post_processor.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b86dce807857f1a4f11b4dedd661c219e8db1d412fd2d1d703d89bffdd4caf"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::prose_two_column_gutter (cognitive 17): PdfDocument::prose_two_column_gutter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"d076a1b38aae77d6255c3ea3e22ee281210789976b764929dfd92f39207749b9"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::get_page_inks (cognitive 17): PdfDocument::get_page_inks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (7 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b904df84496525195a82fad7a7eb270dbb559e21699f91f6bcdf6a4662df5a"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::merge_interleaved_rtl_lines (cognitive 17): PdfDocument::merge_interleaved_rtl_lines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d69b858dfcde4cbfb4c9ca22dccce4fc000e2ea63123259f137c94567f5b573"}},{"ruleId":"D2","level":"warning","message":{"text":"PageLabelExtractor::parse_number_tree (cognitive 17): PageLabelExtractor::parse_number_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/page_labels.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f61f8d7220f1787dd6178fe7c330078ca87eea2b39a287ff14cee3ddc071c6"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::apply_ligature_decisions (cognitive 17): TextExtractor::apply_ligature_decisions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/clustering.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfe9f2c12bc37e841c8c921c047875d40b36b4506cd9762cc3ea0e95c26fcf6"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::render_text_with_modulators (cognitive 17): PageRenderer::render_text_with_modulators has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/group_process_text.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89f65464c69ad1af5fa8f3c0ef1e70feb096f1ed8a718f84919b30fead8ad34"}},{"ruleId":"D2","level":"warning","message":{"text":"WordBoundaryDetector::is_word_boundary (cognitive 17): WordBoundaryDetector::is_word_boundary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/word_boundary.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a0f4c91cb9943b6a4c20db8ed8a6ebec39217c8c4f01d1285790797fad06b5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::color::cmyk_to_rgb (cognitive 17): xberg_native_pdf::color::cmyk_to_rgb has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/color/mod.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff8987bb365563e010134717d64e0f556426fb44886e2ba14213593a3c72bde"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::parse_content_stream (cognitive 17): xberg_native_pdf::content::parser::parse_content_stream has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ff09b35b4ae898475bf20fdbaee73ae1bba340c0009f8ae7b9b3566a20090c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::auto::text_quality_gate (cognitive 17): xberg_native_pdf::extractors::auto::text_quality_gate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/auto.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac129b7dccd91448b650976a76607740faa9945ac9280f5ea1dcdac2486a017"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cmap::line_parsers::for_each_bfrange_record (cognitive 17): xberg_native_pdf::fonts::cmap::line_parsers::for_each_bfrange_record has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a93763b68e9c9772350fc95e7f1b783cda70906911dbfbc1dc5e50c61b22a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::mesh_shading::decode_type4_stream (cognitive 17): xberg_native_pdf::rendering::mesh_shading::decode_type4_stream has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 2 (3 pts), boolean chains 1, 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":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3153f0358f4857d6a4847a717bb0a0310baae7a65567032b1e7545e3c854054"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::paint_image_to_plates (cognitive 17): xberg_native_pdf::rendering::separation_renderer::paint_image_to_plates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 5 (6 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61f61396142b487ad10fa53ca5f6a0adb9632f88ab55b68c81d63b484586217"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::filled_cells::maximal_cells (cognitive 17): xberg_native_pdf::structure::spatial_table_detector::filled_cells::maximal_cells has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector/filled_cells.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6176ca1dc974aa9a19c899c85c83965ef7692b98213c4c9d1031384dd4be13f"}},{"ruleId":"D2","level":"warning","message":{"text":"graphs.graph_tensors (cognitive 17): graphs.graph_tensors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/caption_export/src/caption_export/graphs.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6677378fdf82f0c73cfda29fd4d0ab78c2b01e28c40f4c800f171175a6d7949"}},{"ruleId":"D2","level":"warning","message":{"text":"readerMapping.buildMetadata (cognitive 17): readerMapping.buildMetadata has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/readerMapping.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7b3798c7310a81c6f9dc7cd94d3be9da37dc498439340cb7aac8e3bf0e6f18"}},{"ruleId":"D2","level":"warning","message":{"text":"ListFormats::parse_plf_lfo (cognitive 16): ListFormats::parse_plf_lfo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3920339d55e3d06af3850b078afd852c96e9670f207f00337ddfa29f47eb4f29"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::to_markdown (cognitive 16): Table::to_markdown has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (5 pts) (nesting depth added 6). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"7264aef0ea5285ce8cadb754effa6800e537a23ed2b9cb85bf369a6320764753"}},{"ruleId":"D2","level":"warning","message":{"text":"LatexParser::process_sections_and_content (cognitive 16): LatexParser::process_sections_and_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/parser.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14867b3814ceaf7ebe88980044dd94401f87cd81cf6f8d8e5ea8698c0fab806"}},{"ruleId":"D2","level":"warning","message":{"text":"MdxExtractor::strip_mdx_syntax_collecting (cognitive 16): MdxExtractor::strip_mdx_syntax_collecting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/mdx.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e4263cee6825b79bab7a766250fa1d7c609b3bd3ccea24d9cc22b466d32dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"OrgModeExtractor::next_display_math (cognitive 16): OrgModeExtractor::next_display_math has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ea5a93c47c3e5a3a04cf5070a54b77afe7b07b700be791de6f0c612648dc11"}},{"ruleId":"D2","level":"warning","message":{"text":"MisreadCandidates::take_best (cognitive 16): MisreadCandidates::take_best has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"44057be35222981c48005755a5ca347cbea2fd63c2272f7b89ae5c3ca5480250"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexedSource::distinct_hanging_prefixes (cognitive 16): IndexedSource::distinct_hanging_prefixes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"crates/xberg/src/extractors/pdf/ocr/tall_source/indexed.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d672002e06fa2c3e77d9c341679c02695e4326166a4d690b7cf5288e041a8c95"}},{"ruleId":"D2","level":"warning","message":{"text":"RstExtractor::extract_rst_cross_refs (cognitive 16): RstExtractor::extract_rst_cross_refs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"81793dcb713302c771e37a701ab1809f80a7f0d86bc0020dabb0c37ccf5fabc3"}},{"ruleId":"D2","level":"warning","message":{"text":"RstExtractor::parse_simple_table_cells (cognitive 16): RstExtractor::parse_simple_table_cells has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e09dc6a44a499a0f08bbaf6ec8683584776473ee997f4b111cf1c3968b9442a"}},{"ruleId":"D2","level":"warning","message":{"text":"RedactionPass::redact_nested_documents (cognitive 16): RedactionPass::redact_nested_documents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"045cfd483a6413dfbc87595befcd9a82e495bf9b51a4a818e938bb149438b8c9"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::api::response::omit_image_data_fields (cognitive 16): xberg::api::response::omit_image_data_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/response.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2254c25faaf67f60ae22839571d06bbcca8b9fb6619161cae5e1920ef6b32350"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::engine::extract_impl::prioritize_pending_batch_items (cognitive 16): xberg::engine::extract_impl::prioritize_pending_batch_items has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (4 pts), loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfa92e605d4cee3eb5b4b32df2a2945528400b3b5fdd3f5b1d7350c7e4b593b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::archive::zip::extract_zip_text_content (cognitive 16): xberg::extraction::archive::zip::extract_zip_text_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/zip.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a526cfb15345eda68d8a514b58f693e25831463893340f43e9f027ffd11a6c97"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::derive::pages::reconcile_page_boundaries (cognitive 16): xberg::extraction::derive::pages::reconcile_page_boundaries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), 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":"crates/xberg/src/extraction/derive/pages.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1cbf71ae53966a7fff94b28b2c5284ac5342488177ea211ab05da9fb8d3d16"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::diagram::matching::collapse_concentric (cognitive 16): xberg::extraction::diagram::matching::collapse_concentric has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/matching.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"7868064fb90c89bb39f49c88b70a0e06342eed398149e30a7f530b3a368367b5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::diagram::svg::exceeds_max_nesting (cognitive 16): xberg::extraction::diagram::svg::exceeds_max_nesting has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/svg/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aa85bf54fc5ee0833f347d83febfc5447362c43649bb4d6bddd65b5dd2d7d4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::doc::extract_text_fallback (cognitive 16): xberg::extraction::doc::extract_text_fallback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/mod.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf87e524f5b31ce5be6e9d4e60ae6a2132fbceffdc8507f668e9f79354ce2bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::parser::apply_style_numbering (cognitive 16): xberg::extraction::docx::parser::apply_style_numbering has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 3 (6 pts) (nesting depth added 6). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (fill, fill_tables). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"61afe73b2e4937346473aabe7036fd37120582f5a59b23db63108157f204800c"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::docx::styles::parse_paragraph_properties (cognitive 16): xberg::extraction::docx::styles::parse_paragraph_properties has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/styles/mod.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"687bd0392c07b4fde20d67c0bdcecfc1b1bdbd57017c658d2d052ac73d3ef81d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::excel::table_budget::legacy::repoint_skipped_sheets (cognitive 16): xberg::extraction::excel::table_budget::legacy::repoint_skipped_sheets has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/legacy.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cb30d3b28a12bdcecd08ac4a18c8aa5c0451d76b42a881eaad2193a6b0dc59"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::hwp::extract_hwp_document (cognitive 16): xberg::extraction::hwp::extract_hwp_document has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/hwp/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7b57ba7d69f2c192237423558e6b0baddbc62c890d1c0ccb9d0b41d5792f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::image::infer_dpi_from_standard_page_size (cognitive 16): xberg::extraction::image::infer_dpi_from_standard_page_size has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5895f80dae3167cf815aff6c9b9cfdb77cfbc3072127acf91b99d9365ec4c1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::image_format::detect_image_format (cognitive 16): xberg::extraction::image_format::detect_image_format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, 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":"crates/xberg/src/extraction/image_format.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"534529922008ca07863a83c5303222ac52e7f9fd578957df03f3550d238d4c26"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extraction::metafile::emf::extract (cognitive 16): xberg::extraction::metafile::emf::extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/metafile/emf.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb5d203c6c4eb766d2fb7b6faea09f64f27dbc30ba73fd37c9aafa940d27a45"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::csv::build_markdown_table (cognitive 16): xberg::extractors::csv::build_markdown_table has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/csv.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"39209ef2848430b218d36d8da1de88c52ebe3e5814fba9342429ef6b46911381"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::doc::push_paragraph_elements_with_images (cognitive 16): xberg::extractors::doc::push_paragraph_elements_with_images has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 4 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/doc.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcf1e3ef4c9659f71d5a306203d8542263bfd9c7b72f4e22136f3fe736b8a49"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::myst::parse_commented_header (cognitive 16): xberg::extractors::myst::parse_commented_header has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/myst.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00e959a2227620e37a1bff0ec94176b6e69ac12b9c47bdf87054226433a9d88"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::unmatched_runs (cognitive 16): xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::unmatched_runs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"5432648a2e1bf0bb18c8c62347f58503ee646dfb0264b7d0f296e8cc5b17d32a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::native_word_coverage::placed_word_keys (cognitive 16): xberg::extractors::pdf::ocr::native_word_coverage::placed_word_keys has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0bb6e15f9e9aeb7dec687dc2ef29053f1f36eb05432f9fc1f87a6e9e59089f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::pdf::ocr::number_recovery::verify_source (cognitive 16): xberg::extractors::pdf::ocr::number_recovery::verify_source has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 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":"crates/xberg/src/extractors/pdf/ocr/number_recovery.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7f828c638455877393dbd89cd025d4b22cdb57adae26f29b263f7fa0f1623b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::encoding::parse_rtf_control_word (cognitive 16): xberg::extractors::rtf::encoding::parse_rtf_control_word has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/encoding.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"15588253dca8c8c59dc4d177fed48b81f164bfa6261b96e07e6abba775e4138e"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::extractors::rtf::parser::control_word::handle_scope_control_word (cognitive 16): xberg::extractors::rtf::parser::control_word::handle_scope_control_word has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/control_word.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"024f6ac0003d301cdfa74e4662894cba61a78464a767e8431e6b5a92d46bdfb6"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::layout::postprocessing::heuristics::resolve_overlaps (cognitive 16): xberg::layout::postprocessing::heuristics::resolve_overlaps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 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":"crates/xberg/src/layout/postprocessing/heuristics.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a264a43597b174749343d9a2cd502f1fd119ca6821461f4bb73277e27d3c0d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::layout_assembly::assign_elements_to_best_cells (cognitive 16): xberg::ocr::layout_assembly::assign_elements_to_best_cells has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/layout_assembly.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"89226bc96ba4e4fbec91d5dd0f96de74910e52605eae10fa9d6ff2f809bd30ae"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::execution::rotate_rgb_image_data (cognitive 16): xberg::ocr::processor::execution::rotate_rgb_image_data has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (15 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4461eca20713d0bf6600e1c5ec3c9a77fa3ee40b4a0d1113a7789d9dca383d69"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::execution::find_token_sequence_end (cognitive 16): xberg::ocr::processor::execution::find_token_sequence_end has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"885f7a6bc48d575a78bec27fdb6e545c58e692b5a8af4b8c8c8ec29d84c6ba90"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::execution::extract_elements_via_iterator (cognitive 16): xberg::ocr::processor::execution::extract_elements_via_iterator has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 5, boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":1839}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6ecc089b71c2aea31f8af5aa4ba1716161ed1ef4d4a7fec6f388c4c1d4efdc"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::ocr::processor::script_retry::augment_occurrence_pairing (cognitive 16): xberg::ocr::processor::script_retry::augment_occurrence_pairing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/script_retry.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee5125af6fc5100fdf3fcfabf829c0e6a3058946bc9c3c8bcb1f0d29019372"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::table::extract_tables_heuristic (cognitive 16): xberg::pdf::native::table::extract_tables_heuristic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c7e7d20720c9c130e4cff401222753dd7ccea6063551c7236b3855ab55bb0d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::native::table::source_boundaries::all_columns_are_ruled (cognitive 16): xberg::pdf::native::table::source_boundaries::all_columns_are_ruled has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table/source_boundaries.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5877841a2e38a36fb1f821ef30b5542aafc13ed3b869398027839a879fa5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::adapters::ocr_doc_to_paragraphs (cognitive 16): xberg::pdf::structure::adapters::ocr_doc_to_paragraphs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 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":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c11c0e69188aa5ab48a338c004ce523e2d1f0a3dbb55f0e6b80fa86fbe3f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::classify::promote_title_heading (cognitive 16): xberg::pdf::structure::classify::promote_title_heading has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ddd6b5473bd25340833cd84d02597ecf41c5f70af2baffe0ca37eca14e364f"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::promote_untagged_document_title (cognitive 16): xberg::pdf::structure::pipeline::promote_untagged_document_title has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b34ac985f0e5e315c8f608146282ee46784ea5e57580e73be48515c50615d8"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::accepts_detached_list_marker (cognitive 16): xberg::pdf::structure::pipeline::accepts_detached_list_marker has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, 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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0111ebf545ab7f67aa6ec0c2b5b3430c426cd8da9eed6d10fb7c1c6df8d4dca"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::pipeline::occurrence_carriers (cognitive 16): xberg::pdf::structure::pipeline::occurrence_carriers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60cff537d274b703464539944bef4000985a00fe8d10d1f49637be5a7362e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::structure::regions::table_recognition::append_unconsumed_aligned_rows (cognitive 16): xberg::pdf::structure::regions::table_recognition::append_unconsumed_aligned_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9992b938ca2a01e67a96fd507901190f9850105a45ebe606cbffacd3d40b70a4"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::pdf::xref_revisions::extract_lopdf_string (cognitive 16): xberg::pdf::xref_revisions::extract_lopdf_string has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/xref_revisions.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3332a4a5c317230eb14b663f0897a70f80da221fa21bba9bf90d5bbbc649026a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg::rendering::doctags::push_otsl (cognitive 16): xberg::rendering::doctags::push_otsl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/doctags.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9f4700902b38eeb7e5bc3e0fc9fa8b644ade13161d5df15336df61708f6278"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedObjectCache::insert (cognitive 16): BoundedObjectCache::insert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3204351e903c0a3073d2f411c47ebbe5b214a248af7adf9b0eca6b139320106"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::structured_mcid_info (cognitive 16): PdfDocument::structured_mcid_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e95750337ded1b5332fe1ebecc0dd18b2370f215d441a1cc8f061bfbdbe33b"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::page_font_face_lookups (cognitive 16): PdfDocument::page_font_face_lookups has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a38eb062a43960b77cb9cc9b52b165ad78840db59f207e57234fab9ae662be"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::load_object (cognitive 16): PdfDocument::load_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac53a001f2acc834442a8be7d80bc08d37228e3f64abc89d8f8162b0148a7cd"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::get_page_ref_recursive (cognitive 16): PdfDocument::get_page_ref_recursive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc6d5b5c7df723f1bcd24ab354103c94196e9e85cb78c25f633fb75c9223be5"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::apply_actualtext_to_spans (cognitive 16): PdfDocument::apply_actualtext_to_spans has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ba8403638fa8f16a6113b6c2b67db42304f12e48732f8cdba94fbedddf5876"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfDocument::get_outline (cognitive 16): PdfDocument::get_outline has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 3 (4 pts), loops 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/outline.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"980bddabd6ba61003d1339eaa3835741e9e389074ea6e3237b0982f979a2b698"}},{"ruleId":"D2","level":"warning","message":{"text":"PathExtractor::resolve_xobject_ref (cognitive 16): PathExtractor::resolve_xobject_ref has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/paths.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d33b06b5a59fe96b26f56e23571ce1c3f5b9d9cdd38d8f53dfc413d89faf17"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::detect_span_columns (cognitive 16): TextExtractor::detect_span_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_ordering.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"68683dd9d257e45df7656daef2575d473c22cc8a043a8b8953da408f327b9f7c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextExtractor::detect_rtl_draw_direction (cognitive 16): TextExtractor::detect_rtl_draw_direction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2, boolean chains 1 (nesting depth added 7). Of this number, 11 points are the body\u0027s own statements and 5 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":"crates/xberg-native-pdf/src/extractors/text/span_ordering.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a61f1aeb9e35e1148b997e5c2918dcd794f1045bcec5bfb85d7c42036c99d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DocumentProperties::detect_column_count (cognitive 16): DocumentProperties::detect_column_count has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/layout/document_analyzer.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"7373a0724e0d703fe49ca2549b17ea09f149211db3903a8b671d3ab57c97831f"}},{"ruleId":"D2","level":"warning","message":{"text":"CitationDetector::detect_numeric_citations (cognitive 16): CitationDetector::detect_numeric_citations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/text_processing/citations.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf072bea4272c8f4eb1eb5c6624917ec5aa6fdb9600cd401e46d6623140210aa"}},{"ruleId":"D2","level":"warning","message":{"text":"PageRenderer::apply_overprint_after_paint_with_coverage (cognitive 16): PageRenderer::apply_overprint_after_paint_with_coverage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6073}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdbd6a883f60cac20be8c1baba84d31ab467e23173b8faec36fa70a9246d2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"XfaParser::parse_datasets (cognitive 16): XfaParser::parse_datasets has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xfa/parser.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e946e8c7137050880d03383f39946f393d578781e0b070d780473f99b10c13"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::find_preceding_marked_content (cognitive 16): xberg_native_pdf::content::parser::find_preceding_marked_content has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 2 (5 pts), loops 2 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"437a9854d5e43d1c491c795098708bd5023e487478737c28ff3e0321492c76d0"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::content::parser::scan_to_et (cognitive 16): xberg_native_pdf::content::parser::scan_to_et has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 6, 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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"de20dc53f745b85d8e27627dfb3cdf88ff2b06e88fa4151ca9c35cfb78b7a785"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::decoders::decode_stream_with_options_and_expected_size (cognitive 16): xberg_native_pdf::decoders::decode_stream_with_options_and_expected_size has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e8bd7a2497e221db9e8c322f03d4fda81924acfc74b56ad3c7f267558c8f99"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::document::looks_like_prose_table (cognitive 16): xberg_native_pdf::document::looks_like_prose_table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef61a972c095ad8f3a6d1623cafbeb4f674f37e66862ecea90212b908fa1fd1"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::extractors::text::ordering_snap::ordering_script_baselines (cognitive 16): xberg_native_pdf::extractors::text::ordering_snap::ordering_script_baselines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/ordering_snap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da53346d0acf8e2dfed428532e3784d1b90c1b90337391ba85414a3a701a4a7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::cff_encoding::parse_dict_operand (cognitive 16): xberg_native_pdf::fonts::cff_encoding::parse_dict_operand has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e9cde2f21906651fc1087ee4252a0b0d1b5ca6617f6c303dd4d0a7ae10f21a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::type1_encoding::parse_type1_encoding (cognitive 16): xberg_native_pdf::fonts::type1_encoding::parse_type1_encoding has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/type1_encoding.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf55ba7db50d5667f79227788e8fc89a052aa183e87c641134f7a0a8121e73d"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::fonts::type1_encoding::parse_dup_entry (cognitive 16): xberg_native_pdf::fonts::type1_encoding::parse_dup_entry has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5, loops 5. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/type1_encoding.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db9991e3fa3e328b71af2d0c790b9179cec6b0ec43f5a53d7e0d4fea01c9fae"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::parser::parse_object_at_depth (cognitive 16): xberg_native_pdf::parser::parse_object_at_depth has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfb49d193ff1f7ad73f487500a0f766c5dbb784436c31d2ed37203e8929e4b5"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::parser::parse_array (cognitive 16): xberg_native_pdf::parser::parse_array has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ca592b366c532d8fc67f11396daedee0accf9b824544eebe290cc3a3e201a7"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::page_renderer::apply_color_key_mask (cognitive 16): xberg_native_pdf::rendering::page_renderer::apply_color_key_mask has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8938}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c695c6170038f90f497b50f669624df39fc1a686ecf3847da0eb784c278971a"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::rendering::separation_renderer::apply_separation_clip (cognitive 16): xberg_native_pdf::rendering::separation_renderer::apply_separation_clip has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (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":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":2494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c02f9653bd4872bf53e05439507f39bd52e225b4e2b48dee71a78c11fe905f3"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::attach_spanning_headers (cognitive 16): xberg_native_pdf::structure::spatial_table_detector::attach_spanning_headers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2696}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eabab4887da3397f315d6dd4917ada054277f5cb967b7c1d320cdec0cd4486"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::structure::spatial_table_detector::detect_intersections (cognitive 16): xberg_native_pdf::structure::spatial_table_detector::detect_intersections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb053f57ae361590f5dd439f1cf7d8a44edde0e353b5933a72ca6167de661723"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_native_pdf::xref::read_until_trailer (cognitive 16): xberg_native_pdf::xref::read_until_trailer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a75ab6962da4c1742a9c5e83fc17cfaa0a53258424785d60ba742a1bf3a03b"}},{"ruleId":"D2","level":"warning","message":{"text":"xberg_pdfium_render::font_provider::map_font_callback (cognitive 16): xberg_pdfium_render::font_provider::map_font_callback has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/font_provider.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e70b80c3d168d56932ed87f666ffec9207aae431b1568a8dee276bf42ad1f77"}},{"ruleId":"D2","level":"warning","message":{"text":"first_divergence.summarize (cognitive 16): first_divergence.summarize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/caption_export/src/caption_export/first_divergence.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c4608c84c81d4ded4571fe28c73add14408280aeda8970cd5a619950b8d7af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::pdf::ocr::pipeline::extract_with_ocr_for_page: FunctionTooLong \u2014 xberg::extractors::pdf::ocr::pipeline::extract_with_ocr_for_page runs 2283 significant 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 2183 over it, 22.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":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":5138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c51bcec1069b675b766763ffd1752f847dde06b7bbc1e17bc3d1b74c1ecc03b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::pdf::ocr::pipeline::extract_mixed_ocr_native_with_layout_inputs: FunctionTooLong \u2014 xberg::extractors::pdf::ocr::pipeline::extract_mixed_ocr_native_with_layout_inputs runs 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) in one body. The bar is 100 significant lines; this is 2130 over it, 22.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f9edc8d1ac8b988f79fe8833aabd9f6200ecf84565c1c91375ceb6625524cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/pipeline.rs: FileTooLong \u2014 7803 significant 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 119 free functions. The bar is 500 significant lines; this is 7303 over it, 15.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ea6f427b1f0c87f680da2e5cdbbb6019bd745803a2a38da42530472c37d530"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DynamicPdfiumBindings: TooManyFields \u2014 447 stored fields beside 3 methods. The bar is 30 stored fields; this is 417 over it, 14.90\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings/dynamic_bindings.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce747ed9057d4501096741033c62cc683becbaef6237f3f7329a96001904edf0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfExtractor.extract_core_native_with_layout_pages: MethodTooLong \u2014 extract_core_native_with_layout_pages runs 1339 significant 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 1239 over it, 13.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"2503358de43600903cbf7c394f399f21207351264ed2e732db62b84ba5e58eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfDocument: TooManyMethods \u2014 393 methods, declared across 24 files: document/extract_api.rs (47), document/columns.rs (30), document/objects.rs (29), document/spans_text.rs (27), \u002B20 more file(s). The bar is 30 methods; this is 363 over it, 13.10\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89d31f99db4e74a1c84d7831d7eff55a3a4cf1db5afa4bcfc88d855d96098c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DynamicPdfiumBindings: ClassTooLong \u2014 4527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 4 blocks, lines 35-6018. The bar is 400 significant lines; this is 4127 over it, 11.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings/dynamic_bindings.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbda8d527e7370d084519c737cc9b1a0e23097de59c52f8a86afd299b1f7835"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/page_renderer.rs: FileTooLong \u2014 5375 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 4875 over it, 10.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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f53cb66f27c7f0a319c05d87d6ddc77cc50663e0d47495794508d243826efba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: structure/pipeline.rs: FileTooLong \u2014 5167 significant 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 209 free functions. The bar is 500 significant lines; this is 4667 over it, 10.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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a54cf1b68a2a0f5c49290a0f1438ce4e0bcd1f594c238bfaecfa76d74c046a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bindings/dynamic_bindings.rs: FileTooLong \u2014 4553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: DynamicPdfiumBindings (4 blocks, 35-6018). The bar is 500 significant lines; this is 4053 over it, 9.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings/dynamic_bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32962e6964539c4f92dacc82f2eef470bf24be548227e2144e85818cc2a6ceb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::ocr::processor::execution::perform_ocr: FunctionTooLong \u2014 xberg::ocr::processor::execution::perform_ocr runs 717 significant 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 617 over it, 7.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe894c4575408b2c533f76327ff3d24d6f458c4560b008fb3494c9544e7cc7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StaticPdfiumBindings: ClassTooLong \u2014 2822 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 4 blocks, lines 34-3832. The bar is 400 significant lines; this is 2422 over it, 7.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":"crates/xberg-pdfium-render/src/bindings/static_bindings.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"783a8dff70da3553e2102f96f44864a8307f53f50e6408ee63e853181129e6a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/mod.rs: FileTooLong \u2014 3304 significant 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 85 free functions. The bar is 500 significant lines; this is 2804 over it, 6.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"160115ffb1c8801939a3238303052c3f6151eda8a55b2da3455e25a597c18cb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/image.rs: FileTooLong \u2014 3220 significant 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 115 free functions. The bar is 500 significant lines; this is 2720 over it, 6.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":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb207e74f705e6e4bfebb97121b6788dd0e5588918cf1e39e322aa4ea25576a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: structure/spatial_table_detector.rs: FileTooLong \u2014 3162 significant 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 89 free functions. The bar is 500 significant lines; this is 2662 over it, 6.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61bf727337c533a3251210e4c84b43535f6ac5a006f607972326b3bdae4d171"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarkdownExtractor.build_internal_document_with_jsx: MethodTooLong \u2014 build_internal_document_with_jsx runs 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 524 over it, 6.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce9d2ec17e1386b97f610b89efffe350b408f4b8b554e89bb16463fdba56699"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::rendering::separation_renderer::execute_separation_operators: FunctionTooLong \u2014 xberg_native_pdf::rendering::separation_renderer::execute_separation_operators runs 612 significant 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 512 over it, 6.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e876968a76dbb402dca8f7455e0988a4487cc4d59e7c6faf8fb3a134018628"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/document.rs: FileTooLong \u2014 3001 significant 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 133 free functions. The bar is 500 significant lines; this is 2501 over it, 6.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"216785de9e15a30bbcfdf7544f16aa06f050aa28bbe69f0c7ce9b88c67019701"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::pipeline::build_document_structure_with_native: FunctionTooLong \u2014 xberg::pdf::structure::pipeline::build_document_structure_with_native runs 593 significant 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 493 over it, 5.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f92b34e8dc31b750ce74df6a4dc9e6c818af01f11e487a0601cf78d66415a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocxParser.parse_body_elements: MethodTooLong \u2014 parse_body_elements runs 576 significant 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 476 over it, 5.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":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a578d50526a39c581c9768046a83dc3c65edd8dc85ae7d28914457e0fe2f68d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bindings/static_bindings.rs: FileTooLong \u2014 2846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: StaticPdfiumBindings (4 blocks, 34-3832). The bar is 500 significant lines; this is 2346 over it, 5.69\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings/static_bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7c6386ffe78d22e98ce47631843df8f8e136479a7f49c8bbe403949bccaf0e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FontInfo: ClassTooLong \u2014 2261 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 58 methods, 3 blocks, lines 47-5373. The bar is 400 significant lines; this is 1861 over it, 5.65\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e7b70f5d4a7e7e8bc8600d16c8e134ce25b8c4ba791e6efa8fc812da09499f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fonts/font_dict.rs: FileTooLong \u2014 2787 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: FontInfo (3 blocks, 47-5373). The bar is 500 significant lines; this is 2287 over it, 5.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"774ff353a5161c6f3b980de61a63501c0960ba6959b72f4d0c0722f34d30961c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DjotExtractor.build_internal_document: MethodTooLong \u2014 build_internal_document runs 532 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 432 over it, 5.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3dc18c875bc69cbab577baae854f2ea43605c76158ce069f17318806fd4be3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: content/parser.rs: FileTooLong \u2014 2621 significant 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 102 free functions. The bar is 500 significant lines; this is 2121 over it, 5.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb5544c2f57adfa3e7af47ae4192c2ad309c4592cf6c993e2b4e9af2a652b3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DynamicPdfiumBindings.new: MethodTooLong \u2014 new runs 520 significant 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 420 over it, 5.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings/dynamic_bindings.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0380d5eaa151e906c1034b3593899ea107f5269751e259da308b1db2559f6afa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfiumLibraryBindings: ClassTooLong \u2014 2051 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 488 methods. The bar is 400 significant lines; this is 1651 over it, 5.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed520a876bcc09078710841947d9b41987308553ef4c7a6d4ff0921a3faa9f6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docx/parser.rs: FileTooLong \u2014 2562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 2062 over it, 5.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0232cc011784e22700d971f6c16227534e73347b5d689e5ee1f2208c22e68f30"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextExtractor.execute_operator_with_paint_restarts: MethodTooLong \u2014 execute_operator_with_paint_restarts runs 491 significant 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 391 over it, 4.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/operators.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fa1ee57b130d2d1d0b0316d1196152b78a37ff9c4603c4e82a8ad382683e10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextExtractor: TooManyMethods \u2014 138 methods, declared across 12 files: text/marked_content.rs (28), text/tj_arrays.rs (23), text/setup.rs (21), text/span_ordering.rs (17), \u002B8 more file(s). The bar is 30 methods; this is 108 over it, 4.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4d9faf2d9436d9a6da1059c2ca0282891f4dfae3f959d65ff026af8dfd82b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/images.rs: FileTooLong \u2014 2276 significant 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 68 free functions. The bar is 500 significant lines; this is 1776 over it, 4.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2d964b594f9f59f6fbb2f12eb61a80c30693dad17aa6aa2092c1ce0fac6a49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: processor/execution.rs: FileTooLong \u2014 2196 significant 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 1696 over it, 4.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf08c157d9a057af14ae99d4be83263156b9e3b3ca7e5ba2857df517a1f703d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RstExtractor.build_internal_document_within: MethodTooLong \u2014 build_internal_document_within runs 436 significant 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 336 over it, 4.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d771242a1d763a150e76fbdbfada759deffa5dfef1c952c64c470ff9f7b2b64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::pdf::extraction::extract_all_from_native_document: FunctionTooLong \u2014 xberg::extractors::pdf::extraction::extract_all_from_native_document runs 435 significant 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 335 over it, 4.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66c8d672c1af1909ba0b08420b35d57b452acc6054f348bda2c89c40b0d1247"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::rendering::comrak_bridge::build_comrak_ast_with_table_mode: FunctionTooLong \u2014 xberg::rendering::comrak_bridge::build_comrak_ast_with_table_mode runs 423 significant 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 323 over it, 4.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceab963194bb405a29337bd382e86cb016a5094ff7a7967039e0d6f354f3c8fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bindings.rs: FileTooLong \u2014 2091 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: PdfiumLibraryBindings (98-8061). The bar is 500 significant lines; this is 1591 over it, 4.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e755bbb97da7e50b7bb0cc3e49500b73f86bb19edd350bef71884e4e209e78d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/separation_renderer.rs: FileTooLong \u2014 1948 significant 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 50 free functions. The bar is 500 significant lines; this is 1448 over it, 3.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaeb307a188c42b5294074a0f1390f0bfcd9a2572274dccd4f10f1c344143892"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/table.rs: FileTooLong \u2014 1924 significant 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 100 free functions. The bar is 500 significant lines; this is 1424 over it, 3.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53100e6a1a3a4ddf07482217f5341922b526d0992730542c0d9b35bb736d087"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PageRenderer: TooManyMethods \u2014 115 methods, declared across 6 files: rendering/page_renderer.rs (76), rendering/page_renderer_setup.rs (14), rendering/knockout.rs (11), rendering/group_process_text.rs (10), \u002B2 more file(s). The bar is 30 methods; this is 85 over it, 3.83\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1241a95a037991393688d62ef40ab8523e48531a31ea7ae71847df6c6c895a71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::pdf::ocr::pipeline::run_ocr_pipeline_stages: FunctionTooLong \u2014 xberg::extractors::pdf::ocr::pipeline::run_ocr_pipeline_stages runs 375 significant 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 275 over it, 3.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":9815}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a23ea8602b0f549fd229baa7e1a37ae0cf3878e74f2fea9953217380037b987"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfExtractor: ClassTooLong \u2014 1470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 6 blocks, lines 2819-4914. The bar is 400 significant lines; this is 1070 over it, 3.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccb0a7df97ae62ff46124dfa521b93eb3804421bec6f6acd9d2d72bf4d0363f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/text.rs: FileTooLong \u2014 1810 significant 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 98 free functions. The bar is 500 significant lines; this is 1310 over it, 3.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"568d412626e0788acff9de72795d48caf18305c6d87dfcc231d7c24912a0285a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DocxExtractor.extract_content: MethodTooLong \u2014 extract_content runs 362 significant 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 262 over it, 3.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"86408bbdc8dcebfaafc8990caddcbb6fbc037c8250365e5b22f5295c9621fdec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/table_reconstruct.rs: FileTooLong \u2014 1732 significant 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 74 free functions. The bar is 500 significant lines; this is 1232 over it, 3.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":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b027beb382a210c5c83c0b8f0ac60c20745a5bd0be271fb4610b196bd8bc6ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.assemble_text_from_spans: MethodTooLong \u2014 assemble_text_from_spans runs 341 significant 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 241 over it, 3.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/text_assembly.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"25582a1d81664afa60c63ea5c607aa06739023c5bf3241f3c929932962c52c34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontInfo.char_to_unicode_uncached: MethodTooLong \u2014 char_to_unicode_uncached runs 340 significant 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 240 over it, 3.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":4376}}}],"partialFingerprints":{"codehealthFindingId/v1":"78344a2c46fa76f4a7ee0f3edf0376cc3eeb8350b4516b64289d1af383aff2a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontInfo.from_dict: MethodTooLong \u2014 from_dict runs 339 significant 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 239 over it, 3.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd32d84288e536fb80dc79ebaf4a63158d8fb3259149165af83b429541799a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::pdf::run_ocr_with_layout_pages: FunctionTooLong \u2014 xberg::extractors::pdf::run_ocr_with_layout_pages runs 336 significant 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 236 over it, 3.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a92e8b5d70271f3004f78f5badf52074cd638e99425eabecdd297b57b74161"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OrgModeExtractor.build_internal_document: MethodTooLong \u2014 build_internal_document runs 328 significant 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 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"909553679f30c39f8d8918215544584f9f9f4770b07edec4177bb7f9194db1eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::jats::elements::extract_jats_all_in_one: FunctionTooLong \u2014 xberg::extractors::jats::elements::extract_jats_all_in_one runs 307 significant 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 207 over it, 3.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"81973fa67c34d97248fbb84eb7950d92f1f8832382a7c91e7e4fa3bcc1307ed9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_cli::main: FunctionTooLong \u2014 xberg_cli::main runs 298 significant 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 198 over it, 2.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":"crates/xberg-cli/src/main.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8d2506254b6ac8cb45b73a2c8325d645d04c52debf3aed6d01d03a2ef81842"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::docx::build_internal_document: FunctionTooLong \u2014 xberg::extractors::docx::build_internal_document runs 298 significant 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 198 over it, 2.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":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3095e637e7525696e3a12f052af10ce79e78ee1c4ff25a8ddf62a4aa71d0a29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextExtractor.merge_adjacent_spans: MethodTooLong \u2014 merge_adjacent_spans runs 293 significant 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 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_merging.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cc865c3f08c20dbc44fd670ba497ed4ae7589f2aa0dc8512a2dc4cdb4bc293"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model_download.rs: FileTooLong \u2014 1455 significant 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 955 over it, 2.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/model_download.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a481576494fd5d8547a070c22a1b3930340dc4d741b381ac619605c8dc0e50"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageExtractor.extract_with_ocr_pass: MethodTooLong \u2014 extract_with_ocr_pass runs 290 significant 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 190 over it, 2.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":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01d48de5d95e8b72dc2e46ac30d22ffeffb4dbfa87b00359c53eac64efb3439"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/columns.rs: FileTooLong \u2014 1442 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (14-2705). The bar is 500 significant lines; this is 942 over it, 2.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d399c28a429315f9d22b42f02f870bb4866cabd7a8a124a83679adfefce268d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextExtractor.process_xobject: MethodTooLong \u2014 process_xobject runs 284 significant 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 184 over it, 2.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/xobjects.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4192dd959017e63bf9cfc84b5e72af69a94f939fa619b8c015818d8e36d46b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: structure/classify.rs: FileTooLong \u2014 1408 significant 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 66 free functions. The bar is 500 significant lines; this is 908 over it, 2.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bac677ee35a002265941c74b59373b8d1a17e634c58df16e85094e8f848141c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RstExtractor: ClassTooLong \u2014 1105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 4 blocks, lines 203-1843. The bar is 400 significant lines; this is 705 over it, 2.76\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc633176a454fcbbad3803bd3f1cd6768b161885630cbe72871f632d330cd763"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: regions/table_recognition.rs: FileTooLong \u2014 1369 significant 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 869 over it, 2.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5a07bf6f8830afa01fe72702f89f5e0ceff0f75d32b81ceb5025840b412391"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/extract_impl.rs: FileTooLong \u2014 1348 significant 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 76 free functions. The bar is 500 significant lines; this is 848 over it, 2.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":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc240256206354a65d7f88aff61516f8b0d3c6e8b7bc701da85a4e42f52231b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EpubExtractor.build_internal_document: MethodTooLong \u2014 build_internal_document runs 268 significant 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 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c366f4962217217f626bade5b18123e59791ad47aa595f09c8b873eded848739"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypstExtractor.build_internal_document: MethodTooLong \u2014 build_internal_document runs 262 significant 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 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5793cf61e19c464df8c5a78f76b5a965d5769e3799b8f926ea50b64d0a7da0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: XYCutStrategy: ClassTooLong \u2014 1008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 4 blocks, lines 231-2788. The bar is 400 significant lines; this is 608 over it, 2.52\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea116d9c06566d94706282a30608b52fcf6b03fe1e767f7d5d5a708cf74d80c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::ocr::hocr_parser::parse_paragraph: FunctionTooLong \u2014 xberg::ocr::hocr_parser::parse_paragraph runs 252 significant 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 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2760fb3bea1e41172d517e308aca7aff1f41659e3eea6ad305270c48d9c379e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reading_order/xycut.rs: FileTooLong \u2014 1248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: XYCutStrategy (4 blocks, 231-2788). The bar is 500 significant lines; this is 748 over it, 2.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ced936bdbea36985cf727bc31d87433a6c5ede3868ef826b574f3775f73d268"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: structure/assembly.rs: FileTooLong \u2014 1245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 745 over it, 2.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":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25934f3c7955ca66b6552c8a68f3ae9d211879870309ea9550f1e849c97c45f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextRasterizer.render_unicode_text: MethodTooLong \u2014 render_unicode_text runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d5ce7a7922165ddb7bc8d207f46b2b6befd8e695ebd2aedb6955c3249fc481"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/rst.rs: FileTooLong \u2014 1223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: RstExtractor (4 blocks, 203-1843). The bar is 500 significant lines; this is 723 over it, 2.45\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f47f1cce0b5c23c0786fa6cca6aad1d18028f76f43d546ff81ef22fb6ee62b7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TesseractAPI: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0445848783bc2d0104b2df46360f7d657ae0534720e0fe2a3d92c98b7528c88b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: redaction/engine.rs: FileTooLong \u2014 1215 significant 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 715 over it, 2.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"479bb153ac693b68a9a2b37a28598ac8073176c2a5636576a87419f1d0b9f9a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/odt.rs: FileTooLong \u2014 1207 significant 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 707 over it, 2.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f78d0dda8896a4e9b7a45e0c1a28e0ee85f299fc206fe5bc55909ae5206193d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JupyterExtractor: ClassTooLong \u2014 959 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 45 methods, 4 blocks, lines 102-1534. The bar is 400 significant lines; this is 559 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"10766dac5313779cfbfe58a5cc5296bb8bfebd8f208da5f0e15c0f493acee916"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/comrak_bridge.rs: FileTooLong \u2014 1197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 697 over it, 2.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"369da0d750d71de300752dcc7627a6862cf710c537fb5434e0e06e52964f6d49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/text_rasterizer.rs: FileTooLong \u2014 1186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: TextRasterizer (3 blocks, 457-2085). The bar is 500 significant lines; this is 686 over it, 2.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ef7139b1cf3591a7c06281e76bc831f0c387ca6d4af5303c42eb269bcbf584"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::docbook::parse_docbook_single_pass: FunctionTooLong \u2014 xberg::extractors::docbook::parse_docbook_single_pass runs 236 significant 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 136 over it, 2.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa537c35dfb5cef04d15dfc332195f838b9e462854ff450184911ec9898bc555"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extraction::ppt::extract_texts_from_records: FunctionTooLong \u2014 xberg::extraction::ppt::extract_texts_from_records 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":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0f5be6adbf7a494eecfd120e7a1984549e7d3c12159df2a2b96e1d78358041"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DocxParser: ClassTooLong \u2014 891 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 3006-4335. The bar is 400 significant lines; this is 491 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3006}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b906bfa7c63a3b338950a03953eadb7073916192516b5dd829c1043611b01b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paddle_ocr/backend.rs: FileTooLong \u2014 1108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: PaddleOcrBackend (5 blocks, 417-1834). The bar is 500 significant lines; this is 608 over it, 2.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be269d942f6f1f6fd9b6930c5bcbb4f12f9ebbcc26794ba9ab1de76d66d93bb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/extract_api.rs: FileTooLong \u2014 1091 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: PdfDocument (74-2298). The bar is 500 significant lines; this is 591 over it, 2.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85a3202059363bd206429a208ad1d6399d01c583d7b57289d6b980678332159"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/api.rs: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: TesseractAPI (5 blocks, 114-1895). The bar is 500 significant lines; this is 577 over it, 2.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba77e01f90782b2eb7424d596167c22ac975afd75b414ec7043034bcba18002"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TextRasterizer: ClassTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 3 blocks, lines 457-2085. The bar is 400 significant lines; this is 460 over it, 2.15\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4141d3467cedcbd04bf162298003690673c41eb8bbbbdf847d06f4ab09dabe3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::extractors::images::extract_image_from_xobject: FunctionTooLong \u2014 xberg_native_pdf::extractors::images::extract_image_from_xobject runs 213 significant 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 113 over it, 2.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":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"2564fa212b3de3c0806c1212f7d90a4b9156c49b3277756a3203dd386152dcc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/hierarchy.rs: FileTooLong \u2014 1060 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 560 over it, 2.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"746220295c3541b1dc1c31d800d34d27321ebca1c587351de554d7ea294946d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.process_form_xobject_paths: MethodTooLong \u2014 process_form_xobject_paths runs 212 significant 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 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"753a20da5b8dc84eb0a16e64cbf69aa1df3b1ea366714f2b20ea617757b719dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: deepseek_ocr/model.rs: FileTooLong \u2014 1055 significant 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 555 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be01897478e68d031db25f5afdd7960dd07c7957464948d7ed0d7765ab68d22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline/mod.rs: FileTooLong \u2014 1044 significant 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 544 over it, 2.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea427e95d4664322573e2955c1406e1cde3f4e7049320569f60d4077b1f98e90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::jats::build_jats_internal_document: FunctionTooLong \u2014 xberg::extractors::jats::build_jats_internal_document runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cfdbd274bf8eeef46fd6d0072e0dcb3be77a78bdbd6176b90dbd34f95adf10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/docbook.rs: FileTooLong \u2014 1039 significant 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 539 over it, 2.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df4774dfa2761b9c156b5c8f209acb64bb9385cb605c18ae2fad7bd259630b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: structure/adapters.rs: FileTooLong \u2014 1034 significant 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 52 free functions. The bar is 500 significant lines; this is 534 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68bfedfc6b78b2dc450481445f520c3f2918a4a38bd86c5769f50bf6069b6ab7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: iwork/numbers.rs: FileTooLong \u2014 1027 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 53 free functions. The bar is 500 significant lines; this is 527 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/numbers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1bc01acb8c2f1e9e0995a25b5eb3a5c5230ed4fe40aba811379573299ca8d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/jupyter.rs: FileTooLong \u2014 1023 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: JupyterExtractor (4 blocks, 102-1534). The bar is 500 significant lines; this is 523 over it, 2.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"932248676c22a01e0b3486fd27ce8209e22125d051359f5b17509633f99c421c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/mod.rs: FileTooLong \u2014 1021 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 521 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"539bf40e96d040c089df10a2172f2baa3dbd7cdcf8ad0fee92af1070aafa51b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::odt::build_internal_elements: FunctionTooLong \u2014 xberg::extractors::odt::build_internal_elements runs 204 significant 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 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2c451694b696f39ebc9892d11841f8617cfd3a19dda7149735409181e9177b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TesseractAPI: ClassTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 5 blocks, lines 114-1895. The bar is 400 significant lines; this is 408 over it, 2.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":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d7bef255efe7a83b78a2996d15f95e81abf33f3f88fff3f06904c4b22af5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.read_uncompressed_object: MethodTooLong \u2014 read_uncompressed_object runs 202 significant 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 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ed8e874de4b5ca45e7c7b87a0eb13d8b1e671085de129efa142fbd96a7f1c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/docx.rs: FileTooLong \u2014 1004 significant 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 504 over it, 2.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":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b18bfc086562daf776206cecdb9a0fa1ec17ad6bf731109a9e0bcd89eb66f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PaddleOcrBackend: ClassTooLong \u2014 802 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 5 blocks, lines 417-1834. The bar is 400 significant lines; this is 402 over it, 2.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/backend.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"3341555b73878e851af108f13a8df3dc7f6042116bf8244e969e78a2e108f244"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InternalDocumentBuilder: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/internal_builder.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe150ae76e40d034ed9fd909dc7753835862597ff36bcafa2df4046ce448d14"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ExtractionOverrides: TooManyFields \u2014 60 stored fields beside 37 methods. The bar is 30 stored fields; this is 30 over it, 2.00\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/overrides/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"18fd96a2e1f62b414a3e12b1d01c4bbc5d9afc7e9144473869fa2c4616f231c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.extract_page_tables: MethodTooLong \u2014 extract_page_tables 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":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"3789c1c05bdb14580f0d20fa1b609e64792e8e5c402c07748d02a840832cab99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.extract_widget_spans: MethodTooLong \u2014 extract_widget_spans runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3871fe763b4830809bc430c27c14dabd1a5e6233b209161b6c292512463c7949"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::docbook::build_docbook_internal_document: FunctionTooLong \u2014 xberg::extractors::docbook::build_docbook_internal_document runs 195 significant 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 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"876ee77569d0920baad839702d8123c7ccb42e271126695da4c0533c933b51e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::content::parser::forward_scan_ctm: FunctionTooLong \u2014 xberg_native_pdf::content::parser::forward_scan_ctm runs 194 significant 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 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5afd18b893c245c99108e90722e170ba915b1f23f19fd90ed2aa46d9b9305d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FontInfo: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d4ae51f64d00f141ea319981af31f0f1e0af0adc8309debbdb4d01857065fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ExtractionConfig: TooManyFields \u2014 58 stored fields beside 41 methods. The bar is 30 stored fields; this is 28 over it, 1.93\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"352512b2b0994e6a61bc54b94d117cc51eca0baf21f11c495a03aba162cf0b5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::regions::tables::extract_tables_from_layout_hints: FunctionTooLong \u2014 xberg::pdf::structure::regions::tables::extract_tables_from_layout_hints runs 193 significant 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 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/tables.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"50576aca4b5d4f0443532ce204d1d9bf140e37958073b1d93a061a2f9e549619"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FictionBookExtractor: ClassTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 4 blocks, lines 40-1182. The bar is 400 significant lines; this is 366 over it, 1.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac0c39c7fc625b1916206afe762a67e74c0f1ba56b466f076bdaeac5650a359"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TextExtractor: TooManyFields \u2014 57 stored fields beside 138 methods. The bar is 30 stored fields; this is 27 over it, 1.90\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":2398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fdb2a4cd239913e7a85407c1d36708b521c2680c3a24b12ae01af4f55a0fec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::functions::execute: FunctionTooLong \u2014 xberg_native_pdf::functions::execute 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":"crates/xberg-native-pdf/src/functions/mod.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"af01c81dc32be996eac9db7e82876567a0d6a64d2ac9ab98a4f7d4ced94d37c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/reading_order.rs: FileTooLong \u2014 948 significant 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 48 free functions. The bar is 500 significant lines; this is 448 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/reading_order.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5c76f486ef9087af97c784fcf3142165b97698498f5fb98e3950985ac2ad48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/table_core.rs: FileTooLong \u2014 947 significant 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 68 free functions. The bar is 500 significant lines; this is 447 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/table_core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05420c240265894d60d693dd3998601f7f2a6df49c86c8f2403409a47c8d790"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/objects.rs: FileTooLong \u2014 944 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: PdfDocument (82-1702). The bar is 500 significant lines; this is 444 over it, 1.89\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7c23e71341193c1a67464524347529a1309285e3b812b6919dd99dd735d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: processor/script_retry.rs: FileTooLong \u2014 943 significant 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 60 free functions. The bar is 500 significant lines; this is 443 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/script_retry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec2c3d6955725a5a699343c066268640b20932e93ab0dea25d81374aac637a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/handlers.rs: FileTooLong \u2014 942 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 442 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3217ce39ff817f377a1cd9d9ad6afac855a0ac58628ed16ef867b53454121e15"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OrgModeExtractor: ClassTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 4 blocks, lines 61-1232. The bar is 400 significant lines; this is 352 over it, 1.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6062df2f393504a79d647e0d2978f76976e2c5bff2ef59eb583f7874b5ac13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/typst.rs: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: TypstExtractor (4 blocks, 65-1020). The bar is 500 significant lines; this is 439 over it, 1.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4499c6aea97d865372e8e073b04c0c0f35cb6204bbf6ce7a8bf03e787f5898"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::extractors::text::should_insert_space: FunctionTooLong \u2014 xberg_native_pdf::extractors::text::should_insert_space runs 187 significant 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 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"22da90fd78117fbbb67cf831c6464cce0d75d9a5702653f660b3af5202aea32f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FictionBookExtractor.extract_metadata: MethodTooLong \u2014 extract_metadata runs 183 significant 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 83 over it, 1.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":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"56224ff1decc79a13667371617df4d2077ed812c7727c812c7de76d2cef24815"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/extraction.rs: FileTooLong \u2014 908 significant 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 408 over it, 1.82\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef61075e4c258737c9e475609ce923c5a3ce084cd14e1a0e281152ee2052aaf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/matched_layer_occurrences.rs: FileTooLong \u2014 906 significant 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 406 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document/matched_layer_occurrences.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b429c74d04faffefe9d7e7b6974ad562d62b112fc4aa719778c7d9b5aa69b1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/metadata.rs: FileTooLong \u2014 900 significant 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 400 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8613c7cd2866895fe3b0553ce8307bdbfbfa546e03a72492a376b71b17d274b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.load_fonts: MethodTooLong \u2014 load_fonts runs 180 significant 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 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb05ac0e4f37d4997acbaec3f44f4039b28d549b2e85cd7edcce0673ce7cbf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ppt/mod.rs: FileTooLong \u2014 898 significant 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 398 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa39b7cde1717b77ea9484d02e6e6e504ea17a5f1b86904a048b18f53fff9481"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: latex/mod.rs: FileTooLong \u2014 897 significant 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 397 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba22f6dc55c271c6a9057f500b8fb82cfd4359a6f72e75063fbdab08f3d3b6a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MarkdownExtractor: ClassTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 4 blocks, lines 104-1089. The bar is 400 significant lines; this is 316 over it, 1.79\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd65ac77dc22756fbea4fc57ac45f7465663dd4e04b504b9eb05d5b07cebcd2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::classify::classify_paragraphs: FunctionTooLong \u2014 xberg::pdf::structure::classify::classify_paragraphs runs 178 significant 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 78 over it, 1.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":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7736c0d96b60be1daa89a8239bb211ae5c0c2afc289471488fddbec8697fbbc9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.topological_block_order: MethodTooLong \u2014 topological_block_order 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":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ca202312541110411a8bf1e271f459a75c4068e79db2eddef4086a23e6f364"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PdfDocument: TooManyFields \u2014 53 stored fields beside 393 methods. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5cbb3f011f48f6ff8ae269f2a8c5edd72f11bed9e0d5a4337f60d53f649bd9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RedactionPass: ClassTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 2 blocks, lines 424-1512. The bar is 400 significant lines; this is 301 over it, 1.75\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae185ae9ecf07a493700c36acd15ce3aef4fea64de152116ee267490813d8161"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PathExtractor: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/paths.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"892ea861474eab8a3d1ec18ba7d545049f612532ac3b80b486e8613d63092d59"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfFont: TooManyMethods \u2014 52 methods, declared across 2 files: pdf/font.rs (38), font/deprecated_builtin.rs (14). The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/font.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"08192da561e498fcd0fb21213c65495ded890a0efb3fb89e61ef59b63d70c03a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/mod.rs: FileTooLong \u2014 857 significant 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 357 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddc987058351fa702702b539884adbe45215f0fa16e15f7b83b9b4fd15f2d12"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfPage: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f534679bbaa1b38e2242ff13dd3ee406cacd105e66ddf16d615d161c976b3d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SlanetModel.recognize: MethodTooLong \u2014 recognize runs 170 significant 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 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9513b57ad95f55c36767bfea96168ad71bd11b5429d4afeaf96104d532b8e4d7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ImageExtractor: ClassTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 4 blocks, lines 3112-4462. The bar is 400 significant lines; this is 277 over it, 1.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":3110}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd29be209293c8262bf2610b07b760a7cb8291e1f63d0de62a3c182b639cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaddleOCRVLModel.forward: MethodTooLong \u2014 forward runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35888c46d4185ac01dafdc31b11f4e569a5ecf01a324776c7d689d449d0d59f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/scoring.rs: FileTooLong \u2014 843 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 343 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36190cb645eafdd973d2c8e63f41f409caa5157788265ffce02d7447e966f2d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::content::parser::parse_content_stream_paths_only: FunctionTooLong \u2014 xberg_native_pdf::content::parser::parse_content_stream_paths_only runs 168 significant 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 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"28698a9f10a2b880679da17e08b636d9be8f0a264c5a8080d38bdbdf16235a77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paddleocr_vl/model.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). 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":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc7d232c5c050c9c1dcc78f468fb6bc53832c2005c19f6f11126ef8de9913bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfPageGroupObject: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9674f1056b86b640bd4769b51288936dd6ed6106ea47020251ce29bd264a9b77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/server.rs: FileTooLong \u2014 805 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: XbergMcp (6 blocks, 89-1075). The bar is 500 significant lines; this is 305 over it, 1.61\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab3aaf0d4a2785afe5312034c6089c7a2653702d8ddb6175f9b07ecffe4d6ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaddleOCRVLModel.get_rope_index: MethodTooLong \u2014 get_rope_index runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"8148f988f83949688123b3e0992b9a0474e632bdae5565fb681f69ed0cc9a3b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HtmlWalker: TooManyMethods \u2014 48 methods, declared across 2 files: structure/tag_handlers.rs (36), html/structure.rs (12). The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ad1e6b1620c208fdb1af4acb95b058d590fbbe203f687486f485da8b468800"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::docbook::extract_para_with_annotations: FunctionTooLong \u2014 xberg::extractors::docbook::extract_para_with_annotations runs 160 significant 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 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb19a4f98cd58496e55ea4aaa02a9df836e9df9ca02e7a6b88b6e5f44ef9a22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::regions::table_recognition::recognize_tables_slanet: FunctionTooLong \u2014 xberg::pdf::structure::regions::table_recognition::recognize_tables_slanet runs 160 significant 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 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"1274f51420fb0494471851e23d505ec0d3707557a46a48d4fe282ba9fb97e572"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextExtractor.append_advance_buffer: MethodTooLong \u2014 append_advance_buffer 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":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"873dc5d95a375f3e7952b7513f66e7b921d143c2b587e04981222273e7dc73b7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontInfo.parse_descendant_fonts: MethodTooLong \u2014 parse_descendant_fonts 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":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1830}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d36ccfc0a7da62ac424110afdae43ef15b8869e508f8bff19f1cba52ddd313d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::pipeline::blocks_to_paragraphs: FunctionTooLong \u2014 xberg::pdf::structure::pipeline::blocks_to_paragraphs 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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a008480d083a5d698886c3f9c53ae7e13e695e137c6e0187034da8a2f804a2a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PaddleOcrEngine: ClassTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 3 blocks, lines 123-973. The bar is 400 significant lines; this is 235 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/ocr_lite.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b506c6984c6b17180aec5a366a8f3e71f88526ce7e7adf593db813d723c2e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/orgmode.rs: FileTooLong \u2014 793 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: OrgModeExtractor (4 blocks, 61-1232). The bar is 500 significant lines; this is 293 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d109f0b1bd69cebc23a06449a6755bdb1001b8b04716793348df734bd0f3c8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/fictionbook.rs: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 98% of them inside a single declaration: FictionBookExtractor (4 blocks, 40-1182). The bar is 500 significant lines; this is 285 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb4d13fe32854fb7df13d7719815a08d7177b83a30ff1dca087fd2d9b7683ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/rendering.rs: FileTooLong \u2014 782 significant 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 282 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"546d5df5e558f10b353a84ca99cc250613a552ce7205029ce4df22d2abaf2d90"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RstExtractor.parse_inline_markup: MethodTooLong \u2014 parse_inline_markup runs 156 significant 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 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a76631dce7bf05616f66e59e72cd201e9b5539d7c5f25c6e1d8a2c728b39d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/images.rs: FileTooLong \u2014 776 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (9-1332). The bar is 500 significant lines; this is 276 over it, 1.55\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a276d88fd7738b766e0e34eb2f26a7fe042b78997a84f9ad29d588512ba8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::rendering::separation_renderer::paint_image_to_plates: FunctionTooLong \u2014 xberg_native_pdf::rendering::separation_renderer::paint_image_to_plates runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":2745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fe834ad7e3ea1a315e07116f188150d589e2211a86059a93ccc702fb935074"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/layout_runner.rs: FileTooLong \u2014 774 significant 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 274 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/layout_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f8ce11a22a46b270be24c44ffef81244629f39003f2640a94254ffd694def3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: XbergMcp.cache_warm: MethodTooLong \u2014 cache_warm runs 154 significant 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 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a4968977e80a680b7023b3e016bfcfa347f1bcaee75ceb31ffcf83b75c7233"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/markdown.rs: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: MarkdownExtractor (4 blocks, 104-1089). The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fe29c761cdd4117bcae3b1fb3bcface91e7b4a718f08452a45cd63e398749f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::jats::parser::extract_citation_text: FunctionTooLong \u2014 xberg::extractors::jats::parser::extract_citation_text 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":"crates/xberg/src/extractors/jats/parser.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e91b0e2a778c03b580e64b13ddcd9d36e16971797e8a8ceee7ac8834ff5c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TypstExtractor: ClassTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 4 blocks, lines 65-1020. The bar is 400 significant lines; this is 208 over it, 1.52\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6040f8f8aa3dae8e61fbef316b5593bb715d1c16d9cfc7c0342b4ad6e250ba8d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfRenderConfig: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/render_config.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cc0d5563dbf373757542a4259dcdd96b33bee2ffba13b04b10b63d024a3684"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JupyterExtractor: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b248aa38c9c2e12aa31adc6bb15d06f19915214eb1c43e6b5edad0ca61845c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/hocr_parser.rs: FileTooLong \u2014 749 significant 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 249 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3809f733b31f43f4872a47f6c453a1c2a7703baecb65f7e2fbc34470694fb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/hidden_layer.rs: FileTooLong \u2014 748 significant 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 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05fb49d50f927ada2432bb854da31c54af6848b14bc71699009576d2c00fc5a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DjotExtractor: ClassTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 5 blocks, lines 28-874. The bar is 400 significant lines; this is 195 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c51923eca1eff4a76a0cc173d15c915a57db7f5832f4d3f0c1a5c785286f7eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: number_recovery/shape_proof.rs: FileTooLong \u2014 741 significant 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 241 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/number_recovery/shape_proof.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f99846fe38e80cb904c23f70bc3c1ea6a198516683dad4921edcf121f6e5fa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/mesh_shading.rs: FileTooLong \u2014 740 significant 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 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ea9c1b70c5bb5ea80d74661a05db1db7001b3bab654a49ec935d339a1ccde4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.extract_paths: MethodTooLong \u2014 extract_paths 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":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e8a8f7cdb654c2c45728d0a048c5b7c2a548bf16f66f177eba063571edad4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.sidebar_body_reading_order: MethodTooLong \u2014 sidebar_body_reading_order runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8829cdcd75a2bff7d90acb15b47019f80c2ed344924ad692561207b44e8a2577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::pipeline::finalize_paragraph: FunctionTooLong \u2014 xberg::pdf::structure::pipeline::finalize_paragraph runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3315}}}],"partialFingerprints":{"codehealthFindingId/v1":"874bb00042fc351b1df141d7fd963af953b3865bb5aa574077bb595df762dfe4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::rendering::sidecar::initial_colour_for_space: FunctionTooLong \u2014 xberg_native_pdf::rendering::sidecar::initial_colour_for_space runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e64ff99b0de865f97786de312a9410cad48ecd736558793dd9282c57e2f032"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.extract_text_lines_inner: MethodTooLong \u2014 extract_text_lines_inner runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff2a9368e611d7737ae92d21faac50364565c481ad9baaac43c46b251ed7444"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ocr_lite.rs: FileTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: PaddleOcrEngine (3 blocks, 123-973). The bar is 500 significant lines; this is 220 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/ocr_lite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de5b0b06d20eb16e8f9d39ffff0a014424e41ca26fd67423c795368291cc46f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfPageTextChar: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3db5233e3081d23d0ecb09700646d4759503176cb483bb7174feea34ad500d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.extract_text_structure_order_cached_with_spans: MethodTooLong \u2014 extract_text_structure_order_cached_with_spans runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a362a8cc6e0204425601bb24e6d4ea0b4e7024bd6e6ccc96e4cfb2f28be85e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.reorder_rowspan_labels: MethodTooLong \u2014 reorder_rowspan_labels runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a2bdbf59305d48436d1aa858f277b189a89ac615a69690226fdc30eb772d6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::xref::parse_xref_stream: FunctionTooLong \u2014 xberg_native_pdf::xref::parse_xref_stream runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1048c537bd959913ee1ae49f732714f04e723ac80d88bca16af295a000ca10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RtfExtractor.build_internal_document: MethodTooLong \u2014 build_internal_document runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e584f99ab10d9fc005df5739f056b086d103b3027a3bbce83c87bed6ff136ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/operators.rs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: TextExtractor (10-1278). The bar is 500 significant lines; this is 212 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/operators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05230a9bb9a46133205cdce68b76bab81ede471ea7ec90bf17594375db18edf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: text/advance.rs: FileTooLong \u2014 703 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: TextExtractor (10-1182). The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d122ed1e522f4d224290162dc08592af4e25b82751aab638527517dc235f9c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/number_recovery.rs: FileTooLong \u2014 700 significant 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 200 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/number_recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1929a484e92df2979928b33b744d93b29c76c92de10ddff519a52117fe514ccc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextExtractor.show_text: MethodTooLong \u2014 show_text runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3ab5e7e1f70fab2a5a4ada3cd129e59de9cb44663a62193c5bee1d2a6ee51d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 697 significant 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 197 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3474e11e0dfc50c717bb859f59aa4870a5c5c6c0531fb4c592d933c1bafe605c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/spans_text.rs: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (9-1526). The bar is 500 significant lines; this is 193 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9c2e94e8c068618446a5bccd66ad8869b238afec2920b43d4921e0f130f905"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/fonts.rs: FileTooLong \u2014 691 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: PdfDocument (23-1272). The bar is 500 significant lines; this is 191 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"441dbe7f3549f1c1a00799d6840ba47a31a46666e4cb44fc7dd87101426760c0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: XbergMcp: ClassTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 6 blocks, lines 89-1075. The bar is 400 significant lines; this is 152 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"942cf6e7812fd3933d24d042fc7008bcf67a527df2e142f8449182ef0b240c85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/myst.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/myst.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5526153c00c3d5a62aa600450a4da4b5bb791c3062e964e27da41da84db5fcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::content::parser::scan_graphics_region: FunctionTooLong \u2014 xberg_native_pdf::content::parser::scan_graphics_region runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":4367}}}],"partialFingerprints":{"codehealthFindingId/v1":"5803b1bfe469385ac36780c8d063fdbc9a478a80a284ab0470a07392d09afcc3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtractionConfig: TooManyMethods \u2014 41 methods, declared across 3 files: extraction/core.rs (18), extraction/env.rs (16), extraction/loaders.rs (7). The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bcb8c611d87691ed120000cdfe2115cdb4ee9061492c283066cc038a38cb1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: derive/mod.rs: FileTooLong \u2014 680 significant 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 180 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":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a399052232b895572ed09e71ed86674a0c936141876d6e2521cb637742d09df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/ocr.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), declaring 41 free functions. 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":"crates/xberg/src/core/config/ocr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d3a05a4b16e292a8b05eaa45bf3a31f31e5c069b0ee11beaef8dd28563f251"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlExtractor.extract_sync: MethodTooLong \u2014 extract_sync runs 135 significant 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fd9bb41c2af38db3e133572be080d5c41e8b65bc4bb8c4ef8eb8a01a6fcac2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::pdf::recognize_pdf_formula_page_inputs: FunctionTooLong \u2014 xberg::extractors::pdf::recognize_pdf_formula_page_inputs runs 135 significant 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adac88a4405cf896a98afbdad396d765bbdc089826ac9d7a325bee9c9181d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RstExtractor.extract_text_from_rst: MethodTooLong \u2014 extract_text_from_rst runs 135 significant 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc82d3e9d5b2c05b188888597889e81250d69866b9750d579fd0b8f3798192e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::ocr::processor::execution::render_inline_ocr_table_content: FunctionTooLong \u2014 xberg::ocr::processor::execution::render_inline_ocr_table_content runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f552a7583adf629636c324729fca9d1f783a12d7fbf2bd102316e1abb011e646"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfImage: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba09cacc18727bd77ad443ceee3250303f0293fce89e2ae69d298719281e6d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/tesseract_backend.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: TesseractBackend (6 blocks, 154-924). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df9cd0f2f68bcd5fa781f92e77f06fa718d01265fa6dec5f8df70bb63861651"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.load_object: MethodTooLong \u2014 load_object runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"4541091fb4d6751caaa4616625c50c8baab6fbb98ac001a23ff40dd0656c3e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::structure::spatial_table_detector::detect_tables_in_cluster: FunctionTooLong \u2014 xberg_native_pdf::structure::spatial_table_detector::detect_tables_in_cluster runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"16283db673e814129482e2493186a1e87449f4f6bd34e1bd8ea4298612d04688"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::docbook::extract_element_text_with_inline: FunctionTooLong \u2014 xberg::extractors::docbook::extract_element_text_with_inline runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea4536f63fde1768787cbda4e76c0d7df79818c3b73c81ce72fbc65d84dd7de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: embeddings/mod.rs: FileTooLong \u2014 655 significant 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 155 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31e9cadaff933fa871e0dd8e6c35bd3cd6939ba799b595b7961e22712afe019"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontInfo.resolve_descriptor_fields: MethodTooLong \u2014 resolve_descriptor_fields runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cd242ac65dfda420c853456bfeb32cb2d92d49ca5f045cb3a69c4739d7cc26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::latex::commands::process_command: FunctionTooLong \u2014 xberg::extractors::latex::commands::process_command runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/commands.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19aaecd0e9248656a17e97dc77eb749dd9a2b70ee73f0a5a60a4a6c21f89395"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::pipeline::process_single_page_with_folio: FunctionTooLong \u2014 xberg::pdf::structure::pipeline::process_single_page_with_folio runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dc7c804fc7240624f9d5f39f7dc6852f09fd6a5b0e8e3a29596d2a51e7c056"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OdpExtractor.extract_content: MethodTooLong \u2014 extract_content runs 130 significant 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 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb24f007c22e7fe1eaefe68c89205d7a24bed52b76ca9c958a08af8fe406642"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/layer_token_recovery.rs: FileTooLong \u2014 648 significant 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 148 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91311e7cc058b017aa2b3cd736d3d41720ce3e5761010e1e120452a5dcaf7d67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/text_extract.rs: FileTooLong \u2014 645 significant 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 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/text_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7de94e7aaeb0e658f4c7803fc7ee4395a3c37743b55ff9f0a60ffe87f91e7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::structure::spatial_table_detector::split_rows_by_text_positions: FunctionTooLong \u2014 xberg_native_pdf::structure::spatial_table_detector::split_rows_by_text_positions runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2801}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d15d2d21be5a06eb813c815170a5a833e9655a95a82aee37fb94d5c86fe4f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OdtExtractor.extract_content: MethodTooLong \u2014 extract_content runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"1478523833bc88b3a7f24a938a463c2733f752c4240fd6ad53f64742d9938cc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: djot_format/extractor.rs: FileTooLong \u2014 642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: DjotExtractor (5 blocks, 28-874). The bar is 500 significant lines; this is 142 over it, 1.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"470c9d776315497ff8798b03e6ed1c9175286fad99a103dee7de6a227d60e099"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/render.rs: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 141 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f925ef1fc4ef812465864abab3f7f35d75da2fe9bcab6e62771913318213ad0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paddle_ocr/model_manager.rs: FileTooLong \u2014 640 significant 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 140 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/model_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"729467cceb78ef458c765883f87c5f5877e71da20278073743784028eef2fd86"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtractionConfig.with_file_overrides: MethodTooLong \u2014 with_file_overrides runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f25e9e9c8b853cb3a54317bbf798006ab8b4c3d5ebb68e3025a86c44e5957fb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FictionBookExtractor.build_internal_document: MethodTooLong \u2014 build_internal_document runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"1805b69c8ca5aecf46cdccacf14a6656d5a1955e18ab0ab23bba78dfcfcf56b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PaddleOcrBackend.process_image: MethodTooLong \u2014 process_image runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/backend.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"9251a35b9260215d8245c7bdd9387d08e1d3e15d40d3447f31625229dd86c473"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FontInfo: TooManyFields \u2014 38 stored fields beside 58 methods. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aef44d6c74cadee76fceb97a05e2679d707bb11c72fbe678c3edcf5891c4e79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RedactionPass: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"113427511b53728b1029595140a8e862e498cbf744282b1fbb1784b2b22175ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ExtractedDocument: TooManyFields \u2014 38 stored fields beside 1 method. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/extraction.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ce72e50621e37bfc845d49d661fc771645a8b3bc02e0a9ad391867a74d9912"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.extract_images_from_form_xobject: MethodTooLong \u2014 extract_images_from_form_xobject runs 126 significant 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 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac216ee7683cc0db8994073f28cced10690d954cce5f646581f0c8433d880e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::structure::table_extractor::extract_cell: FunctionTooLong \u2014 xberg_native_pdf::structure::table_extractor::extract_cell runs 126 significant 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 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f1c7e819bf361b905bc0ad03af9fb0dbe954a9e9e38facd2dd6f35264b8a00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/structured.rs: FileTooLong \u2014 629 significant 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 129 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/structured.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d041af0f9f2c61916c398e7960420c095bed2c7f59d1921de2164618772ccf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: epub/content.rs: FileTooLong \u2014 622 significant 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 122 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20be0993134ba740ad93035726c990f4b0e0843c688d774ab85713458457141b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/pages.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (9-1116). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c8ae41d9a02638de9cdeb631f628d1ba48d86c703610a314c5213df1a6af7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::hwpx::build_hwpx_internal_document: FunctionTooLong \u2014 xberg::extractors::hwpx::build_hwpx_internal_document runs 124 significant 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 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/hwpx.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc887f33bb85648cd50f0e66b9093e78bb71ab683a9d658fd76271079177ba2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/cache.rs: FileTooLong \u2014 617 significant 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 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac59ef6ec98a8ee7284e7caebea31c5114421098ea89b238d2a8d6ad849be4d4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtractionOverrides: TooManyMethods \u2014 37 methods, declared across 10 files: overrides/general.rs (10), overrides/ocr.rs (7), overrides/chunking.rs (4), overrides/output.rs (4), \u002B6 more file(s). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/overrides/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59b08f62e78474e0b51c9601855dff381e649044fe1f6217f196fb289d993a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GraphicsState: TooManyFields \u2014 37 stored fields beside 4 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/graphics_state.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8604382dee780d2e7eaea8eb6ce742f03bdd6a11124f198ad67bc70d8c7961e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sceptre_ocr/mod.rs: FileTooLong \u2014 615 significant 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 115 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/sceptre_ocr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3839a6ff3b65d9dc417da15bc439f3f115d5d3d1599dd2a55cb8c6a70658ffc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfPagePathObject: ClassTooLong \u2014 490 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 4 blocks, lines 174-997. The bar is 400 significant lines; this is 90 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6346fc3ab774bacce2f1c1ca8cfb704992c90fdd6f9cf125b1cf7764dc35463"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/unreadable_script.rs: FileTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 111 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/unreadable_script.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"965a6542adfa4acf4dd03fa21261c27ea726d44caf84d26b5eb67bc89b5a2b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: excel/open.rs: FileTooLong \u2014 610 significant 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 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6878f6c58ee5b819fa1bfaefc6002a2bc535f31121ec13d92f19c8dad74c8cc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtractionConfig: ClassTooLong \u2014 484 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 4 blocks, lines 38-1226. The bar is 400 significant lines; this is 84 over it, 1.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f380914bbe59b70dc6733caca5a87eee6b43b36793f28d115c476a0b0ae69cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: math/elements.rs: FileTooLong \u2014 604 significant 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 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9de8668805a4b30bafef27e45d0bdad59ea3913cafa5f32d840b4e4cc0dcf7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ImageHandle: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/image_handle.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2645ce38e76f4b8e05a2b8a20aaa572b7a46a3c04ed85e66bef28e3f6d7cfa45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/sidecar.rs: FileTooLong \u2014 600 significant 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 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88977e09396c6af82ceb97e854569ea6b0244b618afe4927de062a7e9626fbe1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/excel.rs: FileTooLong \u2014 600 significant 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 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e7f8523f0ef0f9d4a11cdffc9d9c4f19ea0aa98999d4ca5f6ee95a8779bd2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextExtractor.append_and_advance: MethodTooLong \u2014 append_and_advance runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"289e8b3a1bf605231e78f0085d1417843eba51c0c53a349a36a6bb0d88a98c04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::structure::parser::parse_k_children: FunctionTooLong \u2014 xberg_native_pdf::structure::parser::parse_k_children runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8afd9d56721208a2aa95fc5f1626fed5038880d55c34af11065aeb59d8ef31c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FileExtractionConfig: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/file_config.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfce1db3336ae266afbd8ed16678c1beac3ef6bf855b311224507817c6790eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/image.rs: FileTooLong \u2014 599 significant 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 99 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2208d07cd4fd0010f74cf62580343cf99027dfbfd71b208e15c666fc259b63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: derive/pages.rs: FileTooLong \u2014 597 significant 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 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/pages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d62ddae1dab001dd513f3ebc7c89e80d951ecfad2ae1a383c067a6b6f8038c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/html.rs: FileTooLong \u2014 594 significant 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 94 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7742910cf06c9a13859c9cc91f37816898641897477f6f7b576bec32926b5ca0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: object/path.rs: FileTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: PdfPagePathObject (4 blocks, 174-997). The bar is 500 significant lines; this is 88 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7eed6d8cf7424e87c163fd39cdce49ba27e222413e1ba70ddd84f0cd33c487"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EpubExtractor: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 5 blocks, lines 47-840. The bar is 400 significant lines; this is 70 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3f3f9a66b94d5d06c09689626ec4140afd4ff1bdff580c6d93ae1f76a32f92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/annotations.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (9-983). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83a7152313d5b7e5343d1c87bc670baa5569b74f278c9d87332b188380f3c1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/reading_order.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (9-1159). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a332852d1c7c3f9d7b8a37c0bcd0bfd3b56cd1d4f02d046feb0c5e2176749912"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::layout_classify::apply_hint_to_paragraph: FunctionTooLong \u2014 xberg::pdf::structure::layout_classify::apply_hint_to_paragraph runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/layout_classify.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb795d62a23472c59b60cf12bfb70ac9aadfe28bde84e1e55d513ed92100350"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: xberg::extractors::pdf::ocr::orientation_retry::recognition: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"00509cc6e24d4f77919530dd017b6d1a7f6b36887a613495d8fecfd9f15c38ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/asciidoc.rs: FileTooLong \u2014 582 significant 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 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/asciidoc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acca036e1ce5568a9ececcc31d5dec8dee32dab7d5a2138752cb6b96e7f8c5a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PptxExtractor: ClassTooLong \u2014 465 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 6 blocks, lines 27-689. The bar is 400 significant lines; this is 65 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pptx.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"df61a16b1aa85f0c05b9ee29d0f20a4baa9d988dc4a0dc79e2abf08dc0792d70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextRasterizer.layout_text: MethodTooLong \u2014 layout_text runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"871c9eb19609a6da3ae05e99a0ee66c510683198cb3dde67aa0055d1ff34be1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pdf/layout.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Layouter (2 blocks, 196-691). The bar is 500 significant lines; this is 78 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/pdf/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc31e93302a1fe847bf489a941f892be6f9c7388801ef69502203b1971f88b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageExtractor.extract_content: MethodTooLong \u2014 extract_content runs 115 significant 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 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":4274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35bd051e3bb59ee8c953d62f17c538212ddfa185f433e60b101a9a9c12a28e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/xref.rs: FileTooLong \u2014 572 significant 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 72 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"118863f6daedfa0e5b18ffd4ab6d888d64735e5b759f34ab29e687634c1cb4e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline/mixed_plain.rs: FileTooLong \u2014 571 significant 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 71 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eb3527aec621a46f0b3e7294b236285318756f9b87b780fa0979643f009cf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::rendering::comrak_bridge::append_annotated_span: FunctionTooLong \u2014 xberg::rendering::comrak_bridge::append_annotated_span runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15a8f65ee851a1feb4356ac8190fdda1f91854058a281396bc793ce76f53d7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layer_token_recovery/minority_khmer.rs: FileTooLong \u2014 569 significant 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 69 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cf78afa71eb00318367bc4cf0c08c69f869ed68b82da64714b4fca3717f2c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PaddleOcrBackend: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/backend.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeeb3b5f6f96bf3014e8c1b171b78e55efe0109322e88d3a4923500d630c35b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.assemble_positioned_words: MethodTooLong \u2014 assemble_positioned_words runs 113 significant 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 13 over it, 1.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":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"da838ca21d5bef8a6fd3e8d9f1c5f3d2471253c32ea38249ff116252a65f02bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: epub/mod.rs: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: EpubExtractor (5 blocks, 47-840). The bar is 500 significant lines; this is 64 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"932b5f08c69ecdf641040625c7829416d926c7b87791e4b3cb3b54cff2004acc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transcription/engine.rs: FileTooLong \u2014 563 significant 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 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/transcription/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe5cb84574f21f3fe017859f71cdedd4b926487b8650a91db40348050fab572"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontInfo.resolve_encoding_fields: MethodTooLong \u2014 resolve_encoding_fields runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d75eb91323ea1b87e29d15f9958806f5f66bf4171327409fd8b3b9cea8a8f87"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.collect_image_handles_from_form_xobject: MethodTooLong \u2014 collect_image_handles_from_form_xobject runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5effea5b5ca8616a85bc33634e523368ead3946827b37e5b64ee8407778b15e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::core::pipeline::features::execute_chunking: FunctionTooLong \u2014 xberg::core::pipeline::features::execute_chunking runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a97d50c8c50dd0ca443fa267131041f5fe8f495b64da1704b5a75ad0880b48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::adapters::reattach_ocr_layout_list_markers: FunctionTooLong \u2014 xberg::pdf::structure::adapters::reattach_ocr_layout_list_markers runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b4000a530d10bc32efa8a8fb0a14d4283d24088a7b24bfce5e27f5d0b09fee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx/parser.rs: FileTooLong \u2014 551 significant 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 51 over it, 1.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":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0beaaa7752020417610c183a0f43663e4798481236c9020a228e155f533458f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HeifContext: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/context.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be778817066220dbd19290bb45e1ba3cfd826ca78c17081762b7fdea04934ee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SecurityLimits: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/security_limits.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5262d2c6089deb77de22435459120f77e2dc5870a28350f354fa9658db30b9f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractors/image_photo_title.rs: FileTooLong \u2014 550 significant 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 50 over it, 1.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":"crates/xberg/src/extractors/image_photo_title.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a673280e6ea42c9159875cb6895d8aec7223a68e07bc6a06f5b5fa61a2428c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DeepseekV2Config: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/config.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"29954285b47de83e9df4c2667f5b07538d31a1010fc29f60d46d9e29969a010c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/orientation_retry.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: OrientationRetry (2 blocks, 57-505). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7055ef05b720bd8772c07a33c31bd8c9f66849a7a80e3f94993d0c3d655cafdb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.annotation_content_spans: MethodTooLong \u2014 annotation_content_spans runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27e397c3b58e70bdbf029cca090612a057fbb00b16696f7d30401de23ecc8f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::pdf::ocr::layer_token_recovery::recover_page: FunctionTooLong \u2014 xberg::extractors::pdf::ocr::layer_token_recovery::recover_page runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c8195536f3c5d6dad5c18ed234d46c4916e1f85b3b321c6ab1939a2269ad89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hierarchy/script_evidence.rs: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy/script_evidence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ab26461ea51f99c5f884ca7587f4fe310d29bd255affb200110f1a785669cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/tall_source.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4adb2298d838294da13ce10e3e63ec40b19d5d3cb5856390b9c669664c7d128"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ocr/native_word_coverage.rs: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dc61d23c4eaa6f360d05ac7dc17cc23008e1512afb16218086e188a4747a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfPageGroupObject: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 49 methods, 2 blocks, lines 40-868. The bar is 400 significant lines; this is 30 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3574eb23bea65fa0fe4a70dfcf2a72ae2995356310fb0c2d6859e8f5980782ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: functions/mod.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/functions/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"151a2a1a8bd68814262d99a1dfa11831495fb463800660997c64a962326134ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doc/mod.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0b1b4d7238fbcb890b4be8d2aa3b33be0c54ee9f9a86d074fd857523e56899"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/annotation_types.rs: FileTooLong \u2014 535 significant 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 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/annotation_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58821532767b8e9110ed76a12d5c0590548049b32269a438e5aaab25de65201"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/mathml.rs: FileTooLong \u2014 535 significant 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 35 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35d28db5b8729646665b6a76abad535232eff8f678464d6beabffd5f1a1724a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::structure::parser::parse_struct_elem: FunctionTooLong \u2014 xberg_native_pdf::structure::parser::parse_struct_elem runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8af409cb4dc52a1237f6a1b0dd71b12ce681e4b2a99834038eecbc9e31a8d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TesseractBackend.process_image_with_policy: MethodTooLong \u2014 process_image_with_policy runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dca1a8a1dd8f776dc5a1993ab187c5e8f8fd38d284f79a755247285ad1e53bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PdfPageImageObject: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/image.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac39009d5f8c55cbff00b00561936a449e1b8d8d9687fbaaecc9246330568fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: InternalDocument: TooManyFields \u2014 32 stored fields beside 6 methods. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/internal.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f032332dff2603156347c2c5be03e87866a0ac582997b519141cbecf1a8a305f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/common.rs: FileTooLong \u2014 531 significant 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 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"587deb2ff8b3cda382c5bdff09e5e2cfc65578b6fe669da6fdc11900767f8156"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::structure::spatial_table_detector::split_table_at_section_dividers: FunctionTooLong \u2014 xberg_native_pdf::structure::spatial_table_detector::split_table_at_section_dividers runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b867cb483855c99807d407650ed3e19ba87e3cecbf53be805fb7edbdd1851bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::odt::collect_inline_run: FunctionTooLong \u2014 xberg::extractors::odt::collect_inline_run runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"4390a28fe8f1012676ad281c873b77e61f7b0e17a25e16114dd73ff036bd944c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: page/paragraph.rs: FileTooLong \u2014 526 significant 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 26 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/paragraph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c109425ca712fb3bfd7482f9452d43df43ed937384b64f9344afdb03ecaf5e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JupyterExtractor.extract_data_output: MethodTooLong \u2014 extract_data_output runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"57de072bd3fa60033820585b13814c4e403bcfac3932dc28297b2660dfabb5d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::assembly::push_paragraph_element_by_kind: FunctionTooLong \u2014 xberg::pdf::structure::assembly::push_paragraph_element_by_kind runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c992d1127586546eab78cdb4703c24208fb19ce0932d990a10935412faa929a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: glm_ocr/decoder.rs: FileTooLong \u2014 523 significant 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 23 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"919ac5e9e29f6002ccc08df56bb5f2ff9aa6904e8d45253d72e602454fd701db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.is_multi_column_page: MethodTooLong \u2014 is_multi_column_page runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cccf59e3d7cb784e49f59475eb579d3c2928d7f2e4f39bbc4950bb71c45196"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::pdf::structure::assembly::extract_text_with_glyph_offset: FunctionTooLong \u2014 xberg::pdf::structure::assembly::extract_text_with_glyph_offset runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"12460c8a11323456badc9b97bb44a4f4e22a38543ec5b2d20e4239cc1905f267"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/paths.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: PdfDocument (9-883). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5829a6be9459022fd190fb47c15f17e442450bccb420bc4f5597ef5c05a97bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/span_postprocess.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (9-1111). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a8d44cf3bc5bf002fb9bba647983c8895cb441d3ba3daf6c44505de0a09753"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: page/object.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4282580b3ec816a5701428a0cf58652d404f1f8428de566d6a3e15550f1338f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx/mod.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a571b0791d75a86b2a860432a2a7e21d43490f4dc993f437b6f8bf14d0fed3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/text_assembly.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: PdfDocument (9-1303). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/text_assembly.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073772f0a08549f07f880838f9f2cb74092731ca71e2fa815aaca246aac4137"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doc/piece_table.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/piece_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"345170729a02348e1f1dfe4da0d5043e4b9c8ca6ce3370712eaefbef271574f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native/images.rs: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e4799305ec9c78e244b41fee61a463499fe0acf4d99500b8259e2d46392c9c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TesseractBackend: ClassTooLong \u2014 414 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 6 blocks, lines 154-924. The bar is 400 significant lines; this is 14 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"876559aa93864407f7a30f0c9a39a7d5338023a55df3a6101b74d01b74ed6ab2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reranking/mod.rs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/reranking/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87ea572d726635a9bdf55744a53baf7d79af466eb0867751daddbe38be9bf17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PdfRenderConfig: TooManyFields \u2014 31 stored fields beside 45 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/render_config.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bcfa32ed2c84ba7729eba44203ca187a9d0b5f194cf52e27a5b9c70f733fab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PaddleOcrEngine: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/ocr_lite.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"85718cde9a164d475a58322862df0169495d53ef4a7190267da7ee64bb6d77b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pix: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/leptonica.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9e8e82505d0cbcd4044c5527fe59084ac2c8f258c7b9999372b845b0165b08"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: xberg::extractors::pdf::ocr::symbol_noise_lines: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/symbol_noise_lines.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a628f269307f17b8b9d37ebd1df78c682be77abe01436f50ab52928a0a8303"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PaddleOCRVLConfig: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/config.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab890d7198ab9b5fb80b8a6dd014a5c4ec9361d4149b7988c6d1e0ebe4db2db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfDocument.merge_sub_superscript_spans: MethodTooLong \u2014 merge_sub_superscript_spans 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":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc08617425adc6f84f48179bb55b0b65ae7e819a26b9e53f39407c44bdc0800"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::xref::parse_traditional_xref: FunctionTooLong \u2014 xberg_native_pdf::xref::parse_traditional_xref 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":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"94740ef54e0d908dff335e1949dd8c2890c95c29fbff64b6a7af550e8a6cb26b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::api::handlers::parse_multipart_extract_request: FunctionTooLong \u2014 xberg::api::handlers::parse_multipart_extract_request 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":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b723c17f3bbe4646b5fdc28aa29d82da71c2783315c6a0d00e6a8148d642fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extraction/core.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: ExtractionConfig (4 blocks, 38-1226). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44820bb8b304c2c352a06ae42a14db9e8643c3e3da984a431e2f9d011a509048"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DeepseekOCRModel.forward: MethodTooLong \u2014 forward runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"105c4b6b116a31f4b6d1298c950720512648c6e00c41f90c0e7438e8bfced856"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg_native_pdf::structure::spatial_table_detector::detect_page_columns: FunctionTooLong \u2014 xberg_native_pdf::structure::spatial_table_detector::detect_page_columns runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fcf6559909c0fdb04622503d01e06ec58ad530fc759dcdd49cb06b105ab623"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: xberg::extractors::jats::extract_para_with_annotations_jats: FunctionTooLong \u2014 xberg::extractors::jats::extract_para_with_annotations_jats runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"124f4d98c13b99a818cf2aa7fd7bdc51e7485091afc29a4303be0b51bc68d30b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypstParser.extract_content: MethodTooLong \u2014 extract_content 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":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d9b6c7f655c7892ce7a8d7e5d0860ab61dea11488786beb54425f8ae358854"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: structure/table_extractor.rs: FileTooLong \u2014 503 significant 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 3 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9960a6b586e1ab3fb96053ec9f21dfe07aa3a54f9cc5e888d5f109fd396dda9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: document/tables.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 99% of them inside a single declaration: PdfDocument (24-910). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b343a75aaa933ba0b9e5f9f54eb86b7b0b9ae0484a371e95a5b9977daea6ee7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rendering/djot.rs: FileTooLong \u2014 502 significant 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 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da52f371e735611ca3f5029869b3c8ab2a97eaa60855df0200d323dc03ca6961"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (11 members, 20 shared lines): crates/xberg/src/extraction/docx/math/collect.rs:135-169 | crates/xberg/src/extraction/docx/math/collect.rs:172-206 | crates/xberg/src/extraction/docx/math/collect.rs:209-245 | crates/xberg/src/extraction/docx/math/elements.rs:236-279 | crates/xberg/src/extraction/docx/math/elements.rs:325-359 | crates/xberg/src/extraction/docx/math/elements.rs:432-464 | crates/xberg/src/extraction/docx/math/elements.rs:470-504 | crates/xberg/src/extraction/docx/math/elements.rs:510-544 | crates/xberg/src/extraction/docx/math/elements.rs:700-732 | crates/xberg/src/extraction/docx/math/elements.rs:738-772 | crates/xberg/src/extraction/docx/math/elements.rs:805-841 \u2014 These 11 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 11 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 11 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/collect.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"637a58aa1c1bd89e579ed54a69c4a9915e8c67aaa17262c82c7040e95284d1b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 20 shared lines): crates/xberg/src/extraction/docx/math/elements.rs:4-40 | crates/xberg/src/extraction/docx/math/elements.rs:75-112 | crates/xberg/src/extraction/docx/math/elements.rs:138-187 | crates/xberg/src/extraction/docx/math/elements.rs:362-396 | crates/xberg/src/extraction/docx/math/elements.rs:547-581 | crates/xberg/src/extraction/docx/math/elements.rs:614-648 \u2014 These 6 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc527789c721a66f282a249f4e0f159a20d2fa50ae7fcc4c6f31784e6291acb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 38 shared lines): crates/xberg-native-pdf/src/extractors/text/advance.rs:14-120 | crates/xberg-native-pdf/src/extractors/text/advance.rs:125-315 | crates/xberg-native-pdf/src/extractors/text/advance.rs:325-553 \u2014 These 3 members are variants of one another: a block of 38 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"244f157427edc34aab6ee265d56e1047b66a5506743e8bc64458f64d463c529b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (85 shared lines): crates/xberg/src/ocr/tesseract_backend.rs:597-723 | crates/xberg/src/ocr/tesseract_backend.rs:737-843 \u2014 These two members are variants of one another: 85 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":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef2bfa2e8555564fe3d3bb6e3f5d58eb1c7bbd5de419f754ba90cb0f16ec936"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (82 shared lines): crates/xberg-native-pdf/src/document/paths.rs:97-321 | crates/xberg-native-pdf/src/document/paths.rs:519-835 \u2014 These two members are variants of one another: 82 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":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8c9c5af9f3eeb2b4c27638afdbbce6cc66e134770971ffafefa2b4b81d2c5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): crates/xberg/src/extractors/docbook.rs:870-1042 | crates/xberg/src/extractors/docbook.rs:1129-1344 \u2014 These two members are variants of one another: 67 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":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ba2b490a29790353a14e31fdb1c930010c42d39b186cd5be99a89f1722cc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): crates/xberg/src/pdf/structure/pipeline.rs:7880-7963 | crates/xberg/src/pdf/structure/pipeline.rs:7969-8028 \u2014 These two members are variants of one another: 55 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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7880}}}],"partialFingerprints":{"codehealthFindingId/v1":"9248c1bc0e8c1d03e7925df672fb220fbecbe8ddbfadc27fa95eae494c3666bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (54 shared lines): crates/xberg-native-pdf/src/extractors/text/advance.rs:838-961 | crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs:33-120 \u2014 These two members are variants of one another: 54 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":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc7fe5b2908349f0f42142532239d0a51e55a16c51021a0a6e77a1aba694dda"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (49 shared lines): crates/xberg-native-pdf/src/document/tables.rs:65-159 | crates/xberg-native-pdf/src/document/tables.rs:161-392 \u2014 These two members are variants of one another: 49 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":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3b16c9f1abff9bf903da3c3fcadfd18cf20755383c04d439ffcb081700e5df"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): crates/xberg/src/extraction/docx/table/mod.rs:582-652 | crates/xberg/src/extraction/docx/table/mod.rs:655-713 \u2014 These two members are variants of one another: 48 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":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1297562ba07f18b65340c86c35d585b5bf91ce3d63bd6569babaf57586e2e4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (47 shared lines): crates/xberg/src/extractors/docbook.rs:1129-1344 | crates/xberg/src/extractors/jats/mod.rs:62-208 \u2014 These two members are variants of one another: 47 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":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56cc9e94937fa709abd57f51c5c65c584e2fb849ac2ea4f24031f85005294e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1688-1835 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1871-2018 \u2014 These two members are variants of one another: 38 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":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7740e56f9c4e2360d0efd3abd77c61f22cb3eb8fcc938c15120c6a4ace69a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): crates/xberg-native-pdf/src/rendering/page_renderer.rs:3262-3361 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:3380-3495 \u2014 These two members are variants of one another: 36 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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f129bbd42a8c682316f4d7a7dc5ef0afc0194df3f97b39f4727f78707bca3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): crates/xberg/src/pdf/structure/adapters.rs:1466-1628 | crates/xberg/src/pdf/structure/pipeline.rs:1299-1368 \u2014 These two members are variants of one another: 35 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":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"46037000ad75372cc970840d72ed46f0ad13fccaf5bd2450f13d6950b208c4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): crates/xberg/src/extraction/archive/sevenz.rs:93-162 | crates/xberg/src/extraction/archive/sevenz.rs:177-237 \u2014 These two members are variants of one another: 32 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":"crates/xberg/src/extraction/archive/sevenz.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"a434e773e75d1ed763e978bd7f7e6c350a154ab2b672c7abf21bbc4e98def412"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): crates/xberg/src/extractors/latex/mod.rs:429-646 | crates/xberg/src/extractors/latex/mod.rs:654-743 \u2014 These two members are variants of one another: 31 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":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28bfa677bc2aa422f50eb2183ded7f0c3d2d80661f715234dac17cb49f27458"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (31 shared lines): crates/xberg-native-pdf/src/structure/traversal.rs:289-364 | crates/xberg-native-pdf/src/structure/traversal.rs:404-477 \u2014 These two members are variants of one another: 31 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":"crates/xberg-native-pdf/src/structure/traversal.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"761bb94cac829812afc5dfbeeaefbce469639fc7fd5362513273e9a2dc453e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (30 shared lines): crates/xberg/src/layout/models/pp_doclayout_v3.rs:263-325 | crates/xberg/src/layout/models/rtdetr.rs:118-186 \u2014 These two members are variants of one another: 30 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":"crates/xberg/src/layout/models/pp_doclayout_v3.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dd46de00915b18bca3d12aec9b83f30907d7c7a1a8933420b9d5ed63333308"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (19 shared lines): crates/xberg-native-pdf/src/extractors/images.rs:2893-2934 | crates/xberg-native-pdf/src/extractors/images.rs:2943-2979 \u2014 These two members are variants of one another: 19 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":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad25afda561c90780ea3ca4387fa6452ceecd1d818e389b03ff3de54dc413fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/xberg/src/extraction/doc/metadata.rs:59-108 | crates/xberg/src/extraction/ppt/mod.rs:1451-1505 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/metadata.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadbcba11cf95c8c8c718ef94118ad21953226c2cd78a3d60032108ae748fdfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/xberg-native-pdf/src/fonts/encoding.rs:289-324 | crates/xberg/src/extractors/rtf/encoding.rs:46-79 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/encoding.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bd9249a3bc82182d88a695b388e64eb30517d76e0b561f063c02bc55e33fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/pdf/structure/pipeline.rs:1746-1767 | crates/xberg/src/pdf/structure/pipeline.rs:1773-1796 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd101d4cc861c245bccfcc06076f2c8b193ea9e3ddf34c1286cb157b0c8e48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/extraction/image.rs:316-390 | crates/xberg/src/pdf/native/images.rs:88-136 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b0c97d54b5754f3521b000e5f31bc59dc9877637479e57cac816a5ebb99958"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/layout/models/slanet.rs:170-180 | crates/xberg/src/layout/models/tatr.rs:191-201 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41573d1028a1f471ac5f76c95b1e7ae407060b03c7b69ae4822c12c3cc4e66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg-paddle-ocr/src/ocr_lite.rs:45-85 | crates/xberg-paddle-ocr/src/ocr_utils.rs:87-148 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/ocr_lite.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75064613a8b0bcaf6d0583cb617db0c12df4268bc7f216cc048efad17bf238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg-native-pdf/src/document/mod.rs:1166-1269 | crates/xberg-native-pdf/src/rendering/sidecar.rs:1389-1586 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bede0f8cd3dd09174146518192e9c37c8ce5bf9ae92fcca634ad9640490adf31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg-native-pdf/src/rendering/page_renderer.rs:4461-4677 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2538-2557 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4461}}}],"partialFingerprints":{"codehealthFindingId/v1":"404418a4583b86759bcb647d166d6c16d3cace1e6e5c04496e78c7e3b9ced1a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg-native-pdf/src/rendering/mesh_shading.rs:1166-1186 | crates/xberg-native-pdf/src/rendering/resolution/pipeline.rs:302-323 \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":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecab808c97fa0543dffa981f17ac0757e65b0cc5cded784e60f4ed6d68230136"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/xberg-tesseract/src/api.rs:555-568 | crates/xberg-tesseract/src/api.rs:579-589 | crates/xberg-tesseract/src/api.rs:600-610 | crates/xberg-tesseract/src/api.rs:699-709 | crates/xberg-tesseract/src/api.rs:720-730 | crates/xberg-tesseract/src/api.rs:741-751 | crates/xberg-tesseract/src/api.rs:758-768 \u2014 These 7 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 7 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 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b7d6d9081a430e7fd9502c8ad71bc6409972c59334fe488c68251a561fe20b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/xberg/src/pdf/structure/classify.rs:94-330 | crates/xberg/src/pdf/structure/classify.rs:339-437 | crates/xberg/src/pdf/structure/classify.rs:592-629 | crates/xberg/src/pdf/structure/layout_classify.rs:296-307 | crates/xberg/src/pdf/structure/layout_classify.rs:396-579 | crates/xberg/src/pdf/structure/pipeline.rs:158-289 \u2014 These 6 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 6 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 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7825d64561e45c83dca99b1944f3c665ee9c61a6b8d600b6600b17942fc55c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:91-163 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:220-324 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:370-447 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:657-855 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:866-1068 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"61675bb7ac901d1fcc3a9dd13951227c7d40af0121b8d6507efa5d0de97129f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/layout/region_classifier.rs:92-163 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1158-1255 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1453-1601 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1635-1759 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1889-2077 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/layout/region_classifier.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fb852ad1f63b0ebcfb753ae1965f7f4ae32a160cf9b363d1468fd473f8f58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5210-5322 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6081-6160 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6267-6335 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6347-6400 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6755-6908 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30f6b69cbe51386faf24d3e0d4c5921671299badebefc141b1d8f05a4eac61e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/xberg-pdfium-render/src/pdf/document/fonts.rs:315-336 | crates/xberg-pdfium-render/src/pdf/document/fonts.rs:446-467 | crates/xberg-pdfium-render/src/pdf/font.rs:229-251 | crates/xberg-pdfium-render/src/pdf/font.rs:405-427 | crates/xberg-pdfium-render/src/pdfium.rs:387-408 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/fonts.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8803149034f5d6f0be65a53ecf957e0b0e440d4aa83e04d67e95438d9d7a3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/xberg/src/extraction/transform/content.rs:91-111 | crates/xberg/src/extraction/transform/content.rs:120-138 | crates/xberg/src/extraction/transform/content.rs:146-164 | crates/xberg/src/extraction/transform/content.rs:227-271 | crates/xberg/src/extraction/transform/content.rs:401-438 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/content.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1561432fe07b2f140316d7376dadc776d3b6f2a6009011622ced58ac2cfb4346"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/xberg/src/extractors/docbook.rs:257-526 | crates/xberg/src/extractors/jats/mod.rs:231-530 | crates/xberg/src/extractors/latex/mod.rs:936-1077 | crates/xberg/src/extractors/orgmode.rs:340-810 | crates/xberg/src/extractors/typst.rs:471-489 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce0f1bf53be6b24eedecba730e981bff8bfe8f254b45b7a415b34ae0a7802ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/extractors/hierarchical.rs:84-128 | crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:198-221 | crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:224-246 | crates/xberg-native-pdf/src/structure/converter.rs:95-118 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/hierarchical.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c5a878669ae7cafbe77d6f8cbf802cee59b61e6e2e50496f2cc85df403ef23"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs:38-62 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs:51-88 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_japan1.rs:34-54 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_korea1.rs:36-58 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2781455b594529cf2a1ea4d89cdf651bbccfcc692931759f308eb5bb8725ba23"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs:90-102 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs:129-142 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_japan1.rs:78-91 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_korea1.rs:84-98 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"320a780d3ea733fdf555e3731ae1175e5ba9ce543da33d26c3de7c581c8ba16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/optional_content.rs:161-186 | crates/xberg-native-pdf/src/structure/parser.rs:102-127 | crates/xberg/src/pdf/native/metadata.rs:319-351 | crates/xberg/src/pdf/xref_revisions.rs:205-232 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/optional_content.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5007449cff2fa086c9dcece8d88ca242b58de29ad508aab8c9e59fcd57a99a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/pipeline/config.rs:81-107 | crates/xberg-native-pdf/src/pipeline/config.rs:109-135 | crates/xberg-native-pdf/src/pipeline/config.rs:165-191 | crates/xberg-native-pdf/src/pipeline/config.rs:193-219 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/config.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"237f468ab90911ee54d1a698cb2f9ff2be618dfea7a5cc7561425f7d5e69ac12"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5210-5322 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5834-5992 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6267-6335 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6755-6908 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2b3efe14a92025b4516e2e7ba74d48c2df3fef7f4ab01114dc9426de9a1585"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5210-5322 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5752-5825 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5834-5992 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6413-6461 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5210}}}],"partialFingerprints":{"codehealthFindingId/v1":"994d3d89c03c1001a5153b68b751f9b855a77c49136cf661e91a4bd0bd239b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5752-5825 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5834-5992 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6081-6160 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6755-6908 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5752}}}],"partialFingerprints":{"codehealthFindingId/v1":"308f7047df015407b73c761e633ed2fbbf1006f7789db8c43f392cb879e95067"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:221-229 | crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:243-250 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2437-2451 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2461-2487 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284191ce1fad2955f420382f8f8f9f412c74b88ad7604279fbb574994a62eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg-tesseract/src/api.rs:1564-1596 | crates/xberg-tesseract/src/api.rs:1618-1650 | crates/xberg-tesseract/src/api.rs:1676-1735 | crates/xberg-tesseract/src/api.rs:1762-1815 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b432b79ea1af51aafb2ef56070da51dd2caff06cf36697746849783f8e69ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/embeddings/engine.rs:85-164 | crates/xberg/src/late_interaction/engine.rs:169-227 | crates/xberg/src/reranking/engine.rs:227-289 | crates/xberg/src/sparse_embeddings/engine.rs:86-144 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/engine.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6fd16c71c4a3d41315d3ceb961988d939256483bd84bf9849184cc536ea65d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/extraction/docx/table/mod.rs:228-277 | crates/xberg/src/extraction/docx/table/mod.rs:288-350 | crates/xberg/src/extraction/docx/table/mod.rs:402-451 | crates/xberg/src/extraction/docx/table/mod.rs:462-501 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64e6c48023f9cbcaeb1745fa5bca2d81611b09918004268fb28f2f56ca99a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/extraction/docx/theme.rs:139-179 | crates/xberg/src/extraction/docx/theme.rs:182-215 | crates/xberg/src/extraction/docx/theme.rs:218-246 | crates/xberg/src/extraction/docx/theme.rs:249-292 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/theme.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0fa7e0f1b2a35771fb3df8adab70d225e997d8516549a14f8d8ae06ed7a47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/extraction/email/msg_props.rs:29-56 | crates/xberg/src/extraction/email/msg_props.rs:66-87 | crates/xberg/src/extraction/email/msg_props.rs:161-189 | crates/xberg/src/extraction/email/msg_props.rs:272-296 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/msg_props.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2d60bb20b97fc009f358fe2298b7347cd3e01eadc413cab155541576f22846"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/extractors/docbook.rs:164-232 | crates/xberg/src/extractors/docbook.rs:257-526 | crates/xberg/src/extractors/docbook.rs:530-860 | crates/xberg/src/extractors/docbook.rs:1045-1111 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e53ebf9b207c264c93a5df4221b0f1caa57becb950738a6d23c07afc3a2ce22"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/extractors/docbook.rs:164-232 | crates/xberg/src/extractors/docbook.rs:1348-1404 | crates/xberg/src/extractors/fictionbook.rs:133-388 | crates/xberg/src/extractors/jats/parser.rs:108-327 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b898579f59ed5efeaa4bb1a0377e7cc280079be6f016a762db4e4076a13b06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/extractors/docbook.rs:1129-1344 | crates/xberg/src/extractors/fictionbook.rs:673-847 | crates/xberg/src/extractors/jats/elements.rs:15-432 | crates/xberg/src/extractors/jats/parser.rs:108-327 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6418f291bc3ad25c154888f4257621fe5ed858c530985a72bdf3c679549e070"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/extractors/docx.rs:1026-1520 | crates/xberg/src/extractors/odp.rs:431-604 | crates/xberg/src/extractors/odt.rs:1838-2011 | crates/xberg/src/extractors/rtf/mod.rs:366-443 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"f016c9f5e3dc7e16930c8b1c8deb4f4e62d6d1b2a2f9e892e844f61b5dacf384"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/rendering/djot.rs:347-374 | crates/xberg/src/rendering/html.rs:161-188 | crates/xberg/src/rendering/markdown.rs:290-316 | crates/xberg/src/rendering/plain.rs:382-408 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68fe3ab97fa9310ac9e41d6eaf52c256e0be13d82bf37fdcaa75af375afa2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/xberg/src/text/redaction/patterns/email.rs:20-31 | crates/xberg/src/text/redaction/patterns/ip_address.rs:42-66 | crates/xberg/src/text/redaction/patterns/postal_code.rs:30-60 | crates/xberg/src/text/redaction/patterns/swift_bic.rs:23-34 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/patterns/email.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e459b543f6548ac8d548729737caaa4ab90a5e1909e1c683c7c739c82b640054"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (117 corresponding lines): crates/xberg-native-pdf/src/fonts/font_dict.rs:5797-5947 | crates/xberg-native-pdf/src/fonts/font_dict.rs:5967-6083 \u2014 These two members are one piece of code written twice and then edited apart: 117 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":5797}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a21b62b7f73fdbdc9ef4337968236ffb81678b9c2f0c18bcce9d78fada7d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): crates/xberg/src/engine/extract_impl.rs:105-192 | crates/xberg/src/engine/extract_impl.rs:349-423 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6cebb4f3ee89e34542ce98a91040d90d2e13f3a03f310cc0109c9beaa0cd27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/xberg/src/pdf/structure/regions/table_recognition.rs:1631-1688 | crates/xberg/src/pdf/structure/regions/tables.rs:294-357 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4964e1d2ddf9a70e22c87b17b951bf198bbbff9077a35c2d65b71b164c2c86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/xberg/src/extractors/docx.rs:762-849 | crates/xberg/src/extractors/wordperfect.rs:631-681 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be7ab2c368f93c3c58263ee47d55fb65384b4fa809ac1e9e1d51ad40b812228"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (74 corresponding lines): crates/xberg-native-pdf/src/decoders/ccitt.rs:61-134 | crates/xberg-native-pdf/src/decoders/ccitt.rs:143-217 \u2014 These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"09907e0e30df0e17b7eeaa04ecbec3a0c6acf009f91e914a2c7115ed9055cc90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (90 corresponding lines): crates/xberg-native-pdf/src/fonts/font_dict.rs:2598-2687 | crates/xberg-native-pdf/src/fonts/font_dict.rs:2704-2796 \u2014 These two members are one piece of code written twice and then edited apart: 90 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2598}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9109f6ff4c2869af0c335eec7c9528bbc6bad75c0cad59553a9b42d292ae8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): crates/xberg-native-pdf/src/fonts/cff_encoding/mac_encoding_tables.rs:100-168 | crates/xberg-native-pdf/src/fonts/cff_encoding/mac_encoding_tables.rs:179-240 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cff_encoding/mac_encoding_tables.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"582f0afdd3d8122e0fab57f7d1e3155d9588ca10a341cc8ba1dd1f4e5cd5e696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): crates/xberg/src/extraction/archive/zip.rs:99-172 | crates/xberg/src/extraction/archive/zip.rs:187-252 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/zip.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc0b28f778bf3162e8bdc49af4200c0517eead0cc446ab8f8e1d0df452b64ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/xberg-native-pdf/src/document/extract_api.rs:920-979 | crates/xberg-native-pdf/src/document/extract_api.rs:997-1058 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"169c6c49498b57c6a3ac0afc244d80f8285d619611f977ed62afde5f87193d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): crates/xberg/src/extraction/archive/tar.rs:104-177 | crates/xberg/src/extraction/archive/tar.rs:192-255 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/tar.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75cf706f68cb09fbbba587f5b3194e4691c1c890299113827d8cd05b9fcc706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/xberg/src/extraction/docx/parser.rs:1825-1879 | crates/xberg/src/extraction/pptx/content_builder.rs:128-173 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38a5d4a901b3a825435515dafa600a3ef44902599fa30e1f5dfb697d1179e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/xberg/src/extraction/structured.rs:457-507 | crates/xberg/src/extraction/structured.rs:568-619 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/structured.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"98182226a9bb4775c61bb73ffadc418559fb0462141ef456d2921b5bd44b5df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 38\u002B corresponding lines): crates/xberg/src/extractors/iwork/keynote.rs:199-236 | crates/xberg/src/extractors/iwork/numbers.rs:1330-1367 | crates/xberg/src/extractors/iwork/pages.rs:162-199 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 38 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3b85574d707c338a55d978ff4d2f3f2ace60c471b8f6ed5357f82cc463a45c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs:317-373 | crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs:271-330 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bb357904aa72aeef4035e436e06bf4ce0ae068f1240c47e8cf8e3ed875eefa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): crates/xberg-native-pdf/src/document/extract_api.rs:854-911 | crates/xberg-native-pdf/src/document/extract_api.rs:1323-1386 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ce9124aa30637f76553e5551ac8de58aca167cc8ea3b1e30db518117344c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/xberg/src/extraction/office_metadata/core_properties.rs:84-132 | crates/xberg/src/extraction/office_metadata/odt_properties.rs:91-143 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/office_metadata/core_properties.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4010c6975a196425c321f967775c492aade1c1e526f385fd92f099c142d356c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/xberg-candle-ocr/src/models/glm_ocr/preprocess.rs:116-157 | crates/xberg-candle-ocr/src/models/paddleocr_vl/processor.rs:135-173 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/preprocess.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfa491cf97c7e5b4b288aed5bada617874d7e6b3549282c7bf05ab5c0874e0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): crates/xberg/src/extraction/formula_xml.rs:234-284 | crates/xberg/src/extractors/jats/parser.rs:45-99 \u2014 These two members are one piece of code written twice and then edited apart: 51 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/formula_xml.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fc32b9c9b86fdb75e4ac3d301992b9eaad270029381d72f3c8aa6d98df032a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/xberg/src/extraction/excel/package_metadata.rs:107-148 | crates/xberg/src/extraction/pptx/metadata.rs:40-73 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3566dab93c5f6eaa345552b9bf36fb163d355fbb82e138da15dbce1ce3cb5cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/xberg/src/mcp/prompts.rs:81-139 | crates/xberg/src/mcp/prompts.rs:145-210 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/prompts.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d82835ae473626eeb3e3419799f0f1822634feeccd3071c460d46369418ce99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py:220-256 | tools/benchmark-harness/caption_export/src/caption_export/subblock_run.py:240-283 \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":"tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c11d0380d781f12d0ec23d5e7161f73c4f8448349732e096e3f7a87c511f37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/xberg/src/extraction/docx/parser.rs:4234-4284 | crates/xberg/src/extraction/docx/parser.rs:4294-4334 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":4234}}}],"partialFingerprints":{"codehealthFindingId/v1":"faccba2be4d6c73874b738a872843aa9b89e0c7a94c87dbf34533b11550c2bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/xberg/src/rendering/docx.rs:227-258 | crates/xberg/src/rendering/pdf/blocks.rs:287-317 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/docx.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a997196152790ffa38f2e107dea90f04366853111ff5844df1cf34ccd8e3f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/xberg-native-pdf/src/encryption/algorithms.rs:180-225 | crates/xberg-native-pdf/src/encryption/algorithms.rs:738-784 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56790eef96e641dd551dae386667f234fbdfb3ac2ab22f4ad4536128969ddf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg-native-pdf/src/rendering/page_renderer.rs:8163-8179 | crates/xberg-native-pdf/src/rendering/resolution/color.rs:725-743 \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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8163}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bcd0e1e5366c7c42252845ac7fbb76d87bbde62b544053e7d005a1e395b6d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/xberg-native-pdf/src/encryption/algorithms.rs:515-551 | crates/xberg-native-pdf/src/encryption/algorithms.rs:564-602 \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":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d69a1cc07a7bcb327c651346b6030c83e4de7fe3bea321f44fcabe574eee21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/xberg/src/core/pipeline/mod.rs:1645-1692 | crates/xberg/src/core/pipeline/mod.rs:1700-1752 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda431d2d23b9fd2e6b4ab5193f471f22dd7952509f23677bc76239167cc47da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/xberg/src/extractors/pdf/ocr/scoring.rs:698-730 | crates/xberg/src/extractors/pdf/ocr/scoring.rs:737-776 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23545dc0122f615c6646cdce0c839be57035928fa3de0c2e7d53f422a830317"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/xberg/src/extraction/email/mod.rs:296-334 | crates/xberg/src/extraction/email/msg.rs:266-295 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/mod.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"32570098c6864a205c29c3aa1878ea04c78713efd31fb9b1369d07d58d551e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/xberg/src/extraction/docx/parser.rs:3132-3169 | crates/xberg/src/extraction/docx/parser.rs:4160-4201 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9778787d376702b8847e3153399c9c33091e012ccbd7c5fb01ce3ff1e0393d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/xberg/src/engine/extract_impl.rs:1716-1746 | crates/xberg/src/engine/extract_impl.rs:1753-1789 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4cfabce326b56e8ee72692c67dd1a21c791bbd3a8d7bcf8a01b319d1af693d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/xberg/src/extractors/pdf/reading_order.rs:514-541 | crates/xberg/src/extractors/pdf/reading_order.rs:565-606 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/reading_order.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fd04b2c019c2047ae1cb4b99253e13df5ade58189129a8e1cf2614627b3d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/xberg/src/layout/models/yolo.rs:267-303 | crates/xberg/src/layout/models/yolo.rs:337-378 \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":"crates/xberg/src/layout/models/yolo.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55c5fda93316d1b3260a918a9c6d6d18334d8cbb686832620d8846b5c0816a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg/src/pdf/structure/pipeline.rs:2547-2597 | crates/xberg/src/pdf/structure/pipeline.rs:2613-2641 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":2547}}}],"partialFingerprints":{"codehealthFindingId/v1":"6790785e1dd5be5b0383b06140c6c9efe9b6c7508c8bd123be0f580e1214cd58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 54\u002B corresponding lines): crates/xberg-native-pdf/src/content/operators.rs:546-607 | crates/xberg-native-pdf/src/content/operators.rs:690-751 | crates/xberg-native-pdf/src/content/operators.rs:779-832 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 54 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/operators.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad28a27f50a3cd00d96f6f8758d19c6034392aa71011d2df7b8b66df2e38892"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/xberg/src/extractors/email.rs:606-646 | crates/xberg/src/extractors/email.rs:667-721 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3aa90a19c3400a0a370de5f3b4bb2e6b3cc833c61c7893e33e30a069bccc79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/xberg/src/extraction/pst/mod.rs:400-438 | crates/xberg/src/extraction/pst/mod.rs:450-489 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pst/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"4023e9d4946b3afc939f31399a14ca42bf5374ad5bb82b359d1c107e745253ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/xberg/src/plugins/processor/builtin/ner.rs:83-115 | crates/xberg/src/text/redaction/engine.rs:1852-1887 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/processor/builtin/ner.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"625108989680f1e830bffec42a8f40e0ae639f14806398e97ccaed545c78798e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/xberg/src/api/startup.rs:15-52 | crates/xberg/src/mcp/server.rs:1124-1161 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/startup.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc95a7c5daecccfe916573a4e4266782090e39b38611419ac62b9c5eb613736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): crates/xberg/src/extractors/rtf/parser/text_extract.rs:381-419 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:572-604 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:606-642 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/text_extract.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d21a29578f60bdc53796891fc70f04af9957a99cac5642ac732238845d9bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/xberg/src/extraction/office_metadata/app_properties.rs:159-188 | crates/xberg/src/extraction/office_metadata/app_properties.rs:224-256 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/office_metadata/app_properties.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9339bd0d57880dcdf4f2013d1afd5a5f71dd20f8606b7a457e2010a3be7fd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/xberg/src/extractors/iwork/keynote.rs:252-289 | crates/xberg/src/extractors/iwork/pages.rs:215-259 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe7c64bcd6628a70a8942d96e451b262b8ef58220a6da7f411174fcbfc228ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/xberg-native-pdf/src/content/parser.rs:3833-3877 | crates/xberg-native-pdf/src/content/parser.rs:3882-3928 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3833}}}],"partialFingerprints":{"codehealthFindingId/v1":"0780a1a1cbf980b87c8b927a3cdaf8889c8909238920d599d31b8f16b13ea434"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): crates/xberg-native-pdf/src/encryption/algorithms.rs:389-448 | crates/xberg-native-pdf/src/encryption/algorithms.rs:663-726 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"f650dacd6d596c4f8df8b8909d7bc778d05d1b231198caa429a538ce4faf13a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 49\u002B corresponding lines): crates/xberg-native-pdf/src/content/parser.rs:582-638 | crates/xberg-native-pdf/src/content/parser.rs:1860-1915 | crates/xberg-native-pdf/src/content/parser.rs:2068-2116 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 49 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ce680c692a21e1d14da672589a3be306b91a50fc8e2360f28974c1523aa093"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/xberg-native-pdf/src/xfa/extractor.rs:74-99 | crates/xberg-native-pdf/src/xfa/extractor.rs:104-132 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xfa/extractor.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6bef0cb1ff7943cd390ab44e27a188307e681477521a15fe07fa3bbde530c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): crates/xberg/src/layout/mod.rs:432-470 | crates/xberg/src/layout/mod.rs:514-559 | crates/xberg/src/layout/mod.rs:622-660 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 39 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"615311a086b92b4c72757dca301e3a7f4ab482eec80d898921bc3a28a3aba576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg/src/engine/extract_impl.rs:1111-1143 | crates/xberg/src/engine/extract_impl.rs:1174-1202 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef0b045fede01678cc7d13e6871550013cedb6d5c356fbf9766f7be41cae2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:348-379 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:410-441 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ba5052dbad3a766973b5e6330fb70afe4407f270c19a1508b77ca0293b0259"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:1221-1245 | crates/xberg-tesseract/src/api.rs:1282-1310 | crates/xberg-tesseract/src/api.rs:1325-1353 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"066f69a6a2e74a208109f8939fc29062012a51375ea116344fda6c67af32981f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/xberg/src/paddle_ocr/backend.rs:80-107 | crates/xberg/src/paddle_ocr/backend.rs:157-180 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/backend.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c009b05f17accfcb7611e84ef38335c5f1bb583eb053940412f6c06d1f0eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/xberg-native-pdf/src/extractors/images.rs:391-416 | crates/xberg-native-pdf/src/extractors/images.rs:419-448 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"42104a0abeb3717ee95c8e6f84d0df62178333dfeb360d5c56fecb21995858f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/xberg/src/ocr/conversion.rs:238-268 | crates/xberg/src/sceptre_ocr/blocks.rs:80-110 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/conversion.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97768d84f78e3d4aafc843f2a7c19b582ee4005e8ce30ba223ef5525a3b09a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/xberg/src/extractors/epub/mod.rs:621-664 | crates/xberg/src/extractors/html.rs:302-343 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"868206862296b57474596ae21058b2639ca8c7c73a6eff0985b9b954c93f7fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/xberg/src/formula_recognition/mod.rs:127-164 | crates/xberg/src/paddle_ocr/model_manager.rs:476-510 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/formula_recognition/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4e2704ed75c277267558cb7667d61c7bb5b6cfc6b36d18f1e487a225a2e754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/xberg-native-pdf/src/extractors/images.rs:2346-2372 | crates/xberg-native-pdf/src/extractors/images.rs:2390-2423 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2346}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d3deba95dc7f29fdce35c26f43bf1c976eb4e12f9e16a550a725be6a087e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/xberg-tesseract/src/page_iterator.rs:221-256 | crates/xberg-tesseract/src/page_iterator.rs:268-317 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/page_iterator.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a7a430cfc4768f848546b8dd49a4556963cbfe23629787e71269525ab69d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/extractors/myst.rs:783-801 | crates/xberg/src/extractors/myst.rs:804-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":"crates/xberg/src/extractors/myst.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dd125c912515c5a891d24e963ad120d8c56ca6332f14fcad6582c1bc903912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/xberg/src/extractors/pdf/mod.rs:1866-1895 | crates/xberg/src/ocr/processor/script_retry.rs:1213-1243 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1866}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d1af96b82405f475fbe4e1cae99df4f9ac4e487ef0f548eb8444b8bb409aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/xberg/src/chunking/validation.rs:129-161 | crates/xberg/src/chunking/validation.rs:179-213 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/validation.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf19a806556bd246c844f483377124337aff7ec656a687fdbcbd4da4459e300"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/xberg/src/api/startup.rs:196-228 | crates/xberg/src/api/startup.rs:260-295 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/startup.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb224feda05022359ba3e2677f736db45cc97ab3aeb193ee4c81bd18237334b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py:104-121 | tools/benchmark-harness/caption_export/src/caption_export/subblock_run.py:76-96 \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":"tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1bca302b74f0689ac13659b27bd1862046d35beb3b8a9f2bbac128aa1dba1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/xberg-native-pdf/src/extractors/xmp.rs:160-185 | crates/xberg/src/utils/xml_utils.rs:107-130 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/xmp.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c9bd14fa6092fe30ab597e32a127d061f69ff069adacf9364cdb2e9e09108d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/xberg-native-pdf/src/extractors/text/marked_content.rs:508-530 | crates/xberg-native-pdf/src/optional_content.rs:215-243 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/marked_content.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d115cbdbc21ad98038e45b83775f31618a2221d152e0a4f3bf9b6ed2d34243"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/xberg/src/late_interaction/mod.rs:355-392 | crates/xberg/src/sparse_embeddings/mod.rs:234-264 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f883abe71f047310c965ea7272393448058101707cd6f1569e5cf7436c1c82c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/pdf/native/hierarchy.rs:642-659 | crates/xberg/src/pdf/native/hierarchy.rs:664-684 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6a403ab8bc51a01ec248e8f2e502c07993cccd7ee7d806e31b3496c222a58b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg/src/pdf/native/text.rs:1536-1555 | crates/xberg/src/pdf/native/text.rs:1640-1663 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d743f4a2d800e6d36cecf54b9425d41b1bc57d0973dab8e3fcff2ae642c37eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg/src/extractors/djot_format/extractor.rs:828-856 | crates/xberg/src/extractors/mdx.rs:243-283 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ce9da17e0cf0e664c47894a273264852fae31c92edcb0b62789c1c61bc904c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/xberg/src/extractors/typst.rs:601-646 | crates/xberg/src/extractors/typst.rs:736-778 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfe7ed1f4d29482c32c0aabdd7e3cde390d659900911a6c6e0b5b678d5ea95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/xberg/src/extraction/docx/math/elements.rs:197-230 | crates/xberg/src/extraction/docx/math/elements.rs:288-322 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7c2da5c8178cd2d2bb6bb3678dc1ec8229464b80336b6a00cdb354393ba6ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/xberg/src/mcp/server.rs:1212-1237 | crates/xberg/src/mcp/server.rs:1274-1299 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e598694ecf352da49e24e79b641f1f49f724837b6f7468c0500d83639de2a61c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/xberg/src/pdf/native/table.rs:1353-1382 | crates/xberg/src/pdf/native/table.rs:1579-1600 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f639f0efe9afa0f4cc1f4f3d3e95ed144623228284b1dc2b052a367c151173"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/xberg/src/rendering/table_math.rs:60-82 | crates/xberg/src/rendering/table_scripts.rs:20-46 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/table_math.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c8275e489edd4739582af472b290d26cb8990dac7f3da6a994b19651776ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg/src/extraction/excel/open.rs:805-824 | crates/xberg/src/extraction/excel/open.rs:832-853 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13693ed7c3d594d74cef11001d2f7205d16162487e16b6be3aad4587497e523"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 32\u002B corresponding lines): crates/xberg/src/embeddings/mod.rs:492-523 | crates/xberg/src/late_interaction/mod.rs:401-446 | crates/xberg/src/sparse_embeddings/mod.rs:273-306 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6828c851848d062482e298216c6fb45edd4d37fcb3a3df8a803ca18eb19ed59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/mcp/server.rs:180-198 | crates/xberg/src/mcp/server.rs:209-233 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9662c68073798869c3326228730003d3aea57e6b219b4aa227ef3f9236fe111"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/xberg/src/extractors/pdf/ocr/rendering.rs:1004-1035 | crates/xberg/src/extractors/pdf/ocr/rendering.rs:1133-1166 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"032c885645241a44c09fb47445aac9c8e3c94742c573f66df6789852cb96e24a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg-native-pdf/src/extractors/paths.rs:557-582 | crates/xberg-native-pdf/src/extractors/paths.rs:585-604 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/paths.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1f5b65b2cbe42ea3ce8295cc36e724e560448c1fd3b43c4fc4aa5899b0f0db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/xberg/src/extraction/docx/drawing.rs:518-554 | crates/xberg/src/extraction/docx/drawing.rs:573-609 \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":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"424b7aaac149f85f7c47c630820d93e955bddf9f12b7527d1b33436b09e86eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/xberg-native-pdf/src/xref.rs:999-1037 | crates/xberg/src/extractors/rst.rs:931-973 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30b6b303e669fe6b83b224dfa8dfae013a9fcb2540c9d938ce3232dc4f4d7d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/xberg/src/pdf/native/text.rs:2189-2215 | crates/xberg/src/pdf/native/text.rs:2348-2377 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"513fa115d4ce2e57ad11b6a52357b41a0a94beb8e87e988d6b9941afd23df99e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/xberg-libheif/src/image_handle.rs:355-376 | crates/xberg-libheif/src/image_handle.rs:379-405 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/image_handle.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90630033e0314ab2ec75ef77cb4a720bd51869972a801a4ad8628884e10944c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:383-406 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:445-468 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98d31f38d074141392502d6f9e4d93f7ed448124011c1b73c72c52e75c8c704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/xberg/src/extraction/pptx/parser.rs:592-614 | crates/xberg/src/extraction/pptx/parser.rs:770-794 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b0d0a6545f8462a8bb911e75dc8ee17db1dfede03bc5ccc44e0805f785b6a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/extractors/jupyter.rs:974-992 | crates/xberg/src/extractors/jupyter.rs:1443-1461 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12e909da9e7cee8b7f34e7167f4385206f4bf60618b1772b222c9e43722144c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/xberg-native-pdf/src/fonts/truetype_cmap.rs:213-238 | crates/xberg-native-pdf/src/fonts/truetype_cmap.rs:555-584 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/truetype_cmap.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc0e24b7196076c70f47d8e186d739f41f65459953dad096fa2550fef945278"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg-native-pdf/src/redaction/text_engine.rs:405-424 | crates/xberg-native-pdf/src/redaction/text_engine.rs:433-454 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/text_engine.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3c2f944aa6bbf7c1eb303a54ce782199575ad703950acbb874324e5ae1d6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/xberg/src/extraction/docx/parser.rs:1758-1778 | crates/xberg/src/extraction/docx/parser.rs:1791-1816 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5b8309de08a2997929d2b8e3372d149dd6c7a4065839477d0abdf414c7ddc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/xberg-native-pdf/src/content/operators.rs:610-647 | crates/xberg-native-pdf/src/content/operators.rs:650-687 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/operators.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a00bd8f2b5e344658d48ddbf48dd0d5d8618f9630b00ad4ffd17e04437e9ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-native-pdf/src/structure/spatial_table_detector/fill_backgrounds.rs:11-21 | crates/xberg-native-pdf/src/structure/spatial_table_detector/header_bands.rs:86-96 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector/fill_backgrounds.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d720e47df06050d5daf395ca04878a3490082b7c5261d30ebb27896776e711bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/xberg/src/ocr/conversion.rs:287-314 | crates/xberg/src/sceptre_ocr/blocks.rs:138-169 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/conversion.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d235cc0071fdc90395e09eaa39f23e3f1dda35d544faacb2878d3101da5c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/xberg/src/candle_ocr/glm_ocr_backend.rs:149-170 | crates/xberg/src/candle_ocr/trocr_backend.rs:110-132 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/glm_ocr_backend.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2174d3ed365437f4a8cbe12d713bc6e19bef3789025ce49b0d870dcada80120b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-native-pdf/src/crypto/rust_provider.rs:143-156 | crates/xberg-native-pdf/src/crypto/rust_provider.rs:165-176 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/crypto/rust_provider.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6783ca4dfe1892c85296eceeed1bf80373e4375e5139d82b4dfff8ac99474a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/xberg/src/extractors/latex/mod.rs:1279-1299 | crates/xberg/src/extractors/orgmode.rs:1189-1214 | crates/xberg/src/extractors/rst.rs:1797-1825 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9500a540482e97f42dfc63b5082c7df77bb5419086844cdfa51485e3308be277"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg-native-pdf/src/document/tables/source_ownership/visible_paint.rs:59-82 | crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs:350-363 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables/source_ownership/visible_paint.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9347a132d101c1780ed82ce1974848299a1267cb8a856176edd11dc60272d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:332-362 | crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:365-395 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f429ee1c7118a689311d2a26d3b5d225c86ffa6219df0ac2e53e346e837cb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg/src/mcp/server.rs:271-305 | crates/xberg/src/mcp/server.rs:343-371 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"7228874ad6d3bd0ae93c6a46c8523bce56fcbc6f15a8c424bf0983692ab19ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/text/translation/fields.rs:141-159 | crates/xberg/src/text/translation/fields.rs:169-190 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/translation/fields.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9befe697637971090ecc8a34697898d33f82c7eb90b3b776770a70036afded2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/engine/mod.rs:101-115 | crates/xberg/src/engine/mod.rs:177-195 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726543e704384b2eb5f25d26af02e22e1aa0db7f0a7fd83090087ebd2aa67de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/xberg/src/core/server_config/loader.rs:124-142 | crates/xberg/src/core/server_config/loader.rs:144-162 | crates/xberg/src/core/server_config/loader.rs:164-182 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/server_config/loader.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1653879e7cbbdfcb4bc3b11861445cf06387ab2ed5a0c00dd5d1762d018b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/xberg/src/extraction/docx/math/collect.rs:9-36 | crates/xberg/src/extraction/docx/math/elements.rs:778-802 | crates/xberg/src/extraction/docx/math/elements.rs:848-883 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/collect.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a6c2fa173116fd0f6c14249588a35901e04e7b9e3b83e80d15ac3fb7a59d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/xberg/src/pdf/structure/adapters.rs:1687-1707 | crates/xberg/src/pdf/structure/pipeline.rs:1371-1391 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"00359b9d995b0258c313dbad33a63b03bc0c0ff3ca137034790117092c256ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/xberg/src/text/classification/chunk_classifier.rs:64-95 | crates/xberg/src/text/classification/page_classifier.rs:34-61 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/classification/chunk_classifier.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f927fb39a9367cfa886cd2cbc4978678c4a6e4fa48c4d00ab94e23e6a08b377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:270-287 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:347-360 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91f8f68f7262c27ba16d3bb32dc4fe973a9e5d129f5b4eae5f930aade486fb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg/src/extraction/pptx/container.rs:48-68 | crates/xberg/src/extraction/pptx/container.rs:77-96 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/container.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eea6e05bbba469e1a3dd8afe69909230ed4f1709f9bd97f22e541156fca42b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/xberg/src/extraction/pst/mod.rs:567-597 | crates/xberg/src/extraction/pst/mod.rs:647-673 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pst/mod.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"090d02fe2c83a97bd3b4ac416d3449a7ab6c57dbd480ad40abf809afbfac0d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/xberg/src/ocr/processor/model_context.rs:202-222 | crates/xberg/src/ocr/processor/model_context.rs:224-244 | crates/xberg/src/ocr/processor/model_context.rs:246-261 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/model_context.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"88842d3c53be3373e6a9f39ff3cc09471a515d072c2e80327496909c9668de5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/xberg-native-pdf/src/decoders/flate.rs:172-199 | crates/xberg-native-pdf/src/decoders/flate.rs:289-322 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/flate.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"146380b5c81666f0036ce10d80f84fa38a75d4c5b3808ca2ac76ea2591b82d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg-paddle-ocr/src/inference/ort_backend.rs:145-158 | crates/xberg-paddle-ocr/src/inference/tract_backend.rs:115-128 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/inference/ort_backend.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26ab7b989d36a3b4c0d35dc16c8e1ab8755103f7b33fb8087ad8a21ef714bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/extraction/hwp/summary.rs:169-181 | crates/xberg/src/extractors/iwork/numbers.rs:1171-1184 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/hwp/summary.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"765000eb587071192eded948281422a78961268d26eb2ac13762cf8a5dbd42df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page.rs:463-485 | crates/xberg-pdfium-render/src/pdf/document/page.rs:495-517 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"23816117034c93e8c8becc1c89f57c816fdf69d6199794d7885a7fab6772c05e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/extractors/frontmatter_utils.rs:303-319 | crates/xberg/src/extractors/frontmatter_utils.rs:339-353 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/frontmatter_utils.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca45a2f57f688fb5a57d7a37ceabf8c29a265987a7cdc9de930cb68261e5f387"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/xberg-libheif/src/image.rs:147-167 | crates/xberg-libheif/src/image.rs:187-207 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/image.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c821e1caea68d6b10b1e6282f13dfcb239cd5ae8dbe85defb2bf70c973a779e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/xberg-libheif/src/image.rs:297-317 | crates/xberg-libheif/src/image_handle.rs:296-316 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/image.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1b456f2953a8487eb7029add5ab6b7234b8dc933af117585d2f5d88fc5636d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:150-180 | crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:478-506 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"867cdcaa0927e8d2a9f4aebc723c5b0de31a2f4f6447a194b21690fd445bd3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg-native-pdf/src/redaction/region.rs:60-72 | crates/xberg/src/pdf/native/annotations.rs:258-267 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/region.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9e5ee608ae672ad9416bb970933d921c7929c7e05262ac453fe1720c00f2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg/src/extractors/image.rs:2359-2375 | crates/xberg/src/extractors/image.rs:2381-2399 \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":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5447d138e60ec9950cf0597ff63cabb55730acb9967e9d0f1191869edc3835de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/pdf/native/hierarchy.rs:1140-1168 | crates/xberg/src/pdf/native/text.rs:3078-3095 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9e668a41548b7fba9c3ec2ab1889f15a773ef9e8c09892b4a59ed90109f8a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/xberg/src/plugins/registry/embedding.rs:95-119 | crates/xberg/src/plugins/registry/reranker.rs:66-87 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/embedding.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d62c673bcb7e36566b06bbcabdfc909d37d4b6d8f615c3c191aeca6e9a65953"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs:26-56 | crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs:66-98 | crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs:132-164 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"839afbfbfbf1f8a3532e4c09bc27e5e30658d950b6bb72382cb112150a23619a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/xberg-pdfium-render/src/pdf/font.rs:528-548 | crates/xberg-pdfium-render/src/pdf/font.rs:551-571 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/font.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9befe2f48eca8ed6c83de2c8797add4a1a25f2f20e6bf56f66426cb83a98d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/plugins/extractor/instrumented.rs:69-87 | crates/xberg/src/plugins/extractor/instrumented.rs:89-111 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/extractor/instrumented.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e02636cf3728d31924fd776b5c2ffd04af705da8340653f75df6274178ad94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/xberg/src/extractors/pdf/ocr/rendering.rs:1064-1099 | crates/xberg/src/extractors/pdf/ocr/rendering.rs:1221-1259 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee625fd6cdfd7dff96aea2563675fdb11930799594961fc7d9eb39d84ed6fea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): crates/xberg/src/extraction/docx/math/elements.rs:43-72 | crates/xberg/src/extraction/docx/math/elements.rs:115-135 | crates/xberg/src/extraction/docx/math/elements.rs:403-426 | crates/xberg/src/extraction/docx/math/elements.rs:584-608 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06d142f7b1f6a95afe214938cbdeb2ad6633bf9fdffef8b69a37149007becd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/xberg/src/ocr/hocr_parser.rs:670-691 | crates/xberg/src/ocr/processor/execution.rs:1623-1644 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b9c92902fe0ed13a6ed6a39e088b5098bceeca4964644f0071821ac15a2251"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/core/extract/mod.rs:55-69 | crates/xberg/src/text/redaction/engine.rs:82-92 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extract/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"88930ea43bbdd768ed2844173740de9f44d442e8f017803d449d91c22b68f833"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/xberg/src/extractors/pdf/ocr/orientation_retry/two_tables.rs:110-135 | crates/xberg/src/ocr/processor/execution/full_scan_table.rs:120-144 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry/two_tables.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"351bddbe062cb587e728a4c5dea2727da49512c2e14c5859aeb01158221bd60b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-native-pdf/src/encryption/certificate.rs:225-236 | crates/xberg-native-pdf/src/encryption/permissions.rs:55-67 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/certificate.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"088368771a1d9e62b9cf263fc8f6fb3dd9e7be605abfb99aa2eec1c588cd115b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/xberg/src/extraction/transform/elements.rs:146-168 | crates/xberg/src/types/document_structure.rs:55-75 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/elements.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82ac6f57dc8090cb1eeedb63d1149740be79e4fb66ddc81dc149b4370c19d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:260-281 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:536-558 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f8eb389af764e6a393c04830ebeb3164fb207fdb3c7e6476b4de5060780d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/layout/models/slanet.rs:150-167 | crates/xberg/src/layout/models/tatr.rs:170-188 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e35cd7275a17bf500a29aea2461a6efe88754f07774a1aea804104ae657a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/xberg/src/extraction/excel/open.rs:559-583 | crates/xberg/src/extraction/excel/open.rs:703-727 | crates/xberg/src/extraction/excel/open.rs:755-782 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4485e1d4c2622356b394d8bb3c1eb40b5163cf8fbdfebe149bfd3cea2d612f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/xberg/src/layout/models/rtdetr.rs:295-319 | crates/xberg/src/layout/models/yolo.rs:236-258 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/rtdetr.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbd615a119d386125943a6af1c5bd615ac28fcc86785b71e28133168ac63b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/xberg/src/ocr/shaded_rows.rs:227-242 | crates/xberg/src/ocr/shaded_rows.rs:247-262 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/shaded_rows.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bc44e1e2a5bac4f937bc9f0486d15ccd47b3c009822e0c875b551ee4725314"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-tesseract/src/api.rs:329-344 | crates/xberg-tesseract/src/api.rs:775-789 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e16c2d6b52a4ab9a96888e345d3159c390c2ca4fb049f151b0438e39fa2e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/extraction/html/structure.rs:447-461 | crates/xberg/src/extraction/html/structure/tag_handlers.rs:454-468 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"1252c5c81622108561183fc97c1d968f6d7c2a224435a74a3a013c06ae24e602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/rendering/docx.rs:45-60 | crates/xberg/src/rendering/pdf/blocks.rs:97-111 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/docx.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eef7d6e2385845e22c478e52a679b187a312e091edfd2d5dc54d26a654c54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg/src/text/redaction/external.rs:421-440 | crates/xberg/src/text/redaction/external.rs:447-466 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/external.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"3343da17220abebb4c7cf7cba5686ba0368d7cd2e8fc40e6b48d8faeed27454a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tools/benchmark-harness/caption_export/src/caption_export/first_divergence_plan.py:39-51 | tools/benchmark-harness/caption_export/src/caption_export/subblock_plan.py:226-239 \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":"tools/benchmark-harness/caption_export/src/caption_export/first_divergence_plan.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad8be5e0bcd4f71caf12240e3844a1e2689b42702691725dccfbeac229ea934"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:239-258 | crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:283-303 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d2a1af0f896cb3bf7e4a624e8f75259a278aad18dedf241356c2d2867b7db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/late_interaction/mod.rs:505-523 | crates/xberg/src/sparse_embeddings/mod.rs:365-383 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c660c3f1bf3343c00ecb48b9fa7f68f89e07f6896cccc6194bf3054d2bcdd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg/src/late_interaction/mod.rs:543-564 | crates/xberg/src/sparse_embeddings/mod.rs:399-418 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a05a1e168191c7a4b94f72554406cf9e753afa660ff7af3f9bf13d8d67bdfa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/xberg/src/extraction/excel.rs:802-823 | crates/xberg/src/rendering/common.rs:607-627 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb630b98c04dcaa7a31ecb90eedf494c5f2a013f5697c1538f9401ca94c539d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/xberg/src/late_interaction/mod.rs:450-468 | crates/xberg/src/reranking/mod.rs:498-519 | crates/xberg/src/sparse_embeddings/mod.rs:310-328 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f61c4389a48356f204b197a2d2c3df78273aaa5f281ba60274e84a4c9f1345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg-native-pdf/src/extractors/text/mod.rs:1165-1177 | crates/xberg-native-pdf/src/extractors/text/mod.rs:1188-1201 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb64ebeb5b4bb2a4c39bb7171d20538b1ba33fe53b4a3c0feefefa7cdf7b600"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/extraction/mathml/render.rs:103-120 | crates/xberg/src/extraction/mathml/render.rs:124-144 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml/render.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada6e5cd4425dbfe91e81b5f11329c5498858f06c67ddab7cabad83c6b28be1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/extractors/pdf/ocr/rendering.rs:53-66 | crates/xberg/src/extractors/pdf/ocr/rendering.rs:156-167 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8340d77d8a12e1a78a22194069ed6246709faa1b8a00fc6648625b184380906"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/extractors/xml.rs:76-93 | crates/xberg/src/extractors/xml.rs:124-136 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/xml.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fedd3b135ad07ec89cf87104983cdcf2c3a2da1e412b5c12a7185603e8b289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg/src/text/redaction/rehydration.rs:164-177 | crates/xberg/src/text/redaction/rehydration.rs:186-206 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/rehydration.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bf514d7e8af3ee002a85ce4b5d999a64e5dc4de98e0aa7aae0d0dba1cbc8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-native-pdf/src/fonts/cid_cmap.rs:191-202 | crates/xberg-native-pdf/src/fonts/cid_cmap.rs:205-217 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cid_cmap.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f579d5f4ee974a66f70825cd280b1acdd92b092ff08422033b47aa1789c39567"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:366-381 | crates/xberg-tesseract/src/api.rs:938-948 | crates/xberg-tesseract/src/api.rs:1258-1268 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"89386fb5da9d41b69a808a2e04e02c40ef05404c3f70781e41e2cf92f7697f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/xberg/src/extraction/pst/mod.rs:265-287 | crates/xberg/src/extraction/pst/mod.rs:294-315 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pst/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed797014947b841815a19336416c72048f9b57be00c3b831c5dd66fa43ae82ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg/src/pdf/hierarchy/clustering.rs:288-309 | crates/xberg/src/pdf/hierarchy/clustering.rs:325-344 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/hierarchy/clustering.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b7411c637e4fcd9b6f61d09ef020f7294c58f6a8652e7e4721f6dd566684d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/extractors/latex/mod.rs:1194-1212 | crates/xberg/src/extractors/rst.rs:1633-1656 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b924d8f52841e32bd203b390abeb2a12c770e45c99f93f46f0acdcf08c9fd471"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/xberg/src/ort_discovery.rs:374-393 | crates/xberg/src/ort_discovery.rs:410-430 | crates/xberg/src/ort_discovery.rs:447-470 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ort_discovery.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8b2df457967651a5909f7b7b64f515d15921858d69907dd48ee61774d1ae07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1455-1473 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:1077-1097 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee43240ff4dce5b4ca9e13216e12ac7dc74039248f54ab0a2bfa817c0fc288f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:380-398 | crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:416-434 | crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:452-470 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"7025e1329901fe24dd065c5b8c50643ecd67cd309b22afb7397ebb1c70b2955b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-candle-ocr/src/download_guard.rs:175-185 | crates/xberg/src/layout/model_manager.rs:37-47 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/download_guard.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f0bd969d2f592466dd9fa01e0f46d98d7a63dfa5ad3345ac764c52d5fe67d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs:709-725 | crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs:171-184 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6d95a73e130a87bfb9c34c46cf8881ad4d5bb49de25fe4a3660f30b73037bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg-native-pdf/src/decoders/predictor.rs:344-363 | crates/xberg-native-pdf/src/decoders/predictor.rs:366-391 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/predictor.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eab1039c5746ad18d07171b477e503c6cdc12cf0eb9803f5a04972849d88fd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/xberg/src/ocr/types.rs:262-292 | crates/xberg/src/types/formats.rs:618-644 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/types.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0a094fad4cf62148156ceb294dad181c2d7f3e1b0818ec563d9a6169521e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-gliner/src/session.rs:71-85 | crates/xberg-gliner/src/v2/session.rs:25-39 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/session.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"187e2031cb39161de78b8522c1153178335f2b3b842f63015cb64d4d4c41e672"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-native-pdf/src/decoders/ccitt.rs:219-233 | crates/xberg-native-pdf/src/extractors/ccitt_bilevel.rs:123-137 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cbbbb9beb764ad3fde3bd99a8a9596686e71543d33082038652b71201de550"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg-native-pdf/src/extractors/gap_statistics.rs:786-805 | tools/benchmark-harness/src/stats.rs:27-44 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/gap_statistics.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e09471f4886095183de90530ffb740e4d86adedb4248e6b55fc8dc14603611e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:497-509 | crates/xberg-tesseract/src/api.rs:528-544 | crates/xberg-tesseract/src/api.rs:1149-1163 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a268dd24da94624e1f0005c179c2c8047baddd6aeb4876e9829413af2703de52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg/src/text/redaction/patterns/credit_card.rs:25-43 | crates/xberg/src/text/redaction/patterns/phone.rs:35-51 \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":"crates/xberg/src/text/redaction/patterns/credit_card.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb94b197bf6f513022bf53c245dbe3c679f8f481292f399a483de1769717a530"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/extraction/excel/package_metadata.rs:190-204 | crates/xberg/src/extraction/pptx/metadata.rs:123-134 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c30df422bc6c88ca15e63d202f5ee870be931d5d625302aa5374a18d028797a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/extractors/annotation_utils.rs:17-28 | crates/xberg/src/types/builder.rs:499-521 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/annotation_utils.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfa1b9f3113fbfbb07a60405b8d63eb6db630a6871da33014150180c23c1cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/paddle_ocr/model_manager.rs:946-963 | crates/xberg/src/paddle_ocr/model_manager.rs:982-1000 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/model_manager.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4c2d4d62bb976e5cbbe297f875a9e029d044e385d01ad5c92eae39babfc48d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:420-448 | crates/xberg-pdfium-render/src/pdf/document/page/text/segments.rs:83-116 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab67adcdc88b524869eccedb3c5407d4997ffe62bd6169b73db93dcbc89f369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg-candle-ocr/src/download_guard.rs:146-162 | crates/xberg/src/model_download.rs:1793-1811 \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":"crates/xberg-candle-ocr/src/download_guard.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecfe4f1c1f44d9d2695e3dce13d553b2a916a885c87fcece59e6ad91ccd1db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/xberg-native-pdf/src/crypto/rust_provider.rs:205-221 | crates/xberg-native-pdf/src/crypto/rust_provider.rs:226-238 | crates/xberg-native-pdf/src/crypto/rust_provider.rs:243-254 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/crypto/rust_provider.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fcf78e658449e5b879119fc06fdfaba4ee7e2d5173a1633ddb5dad02924dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/extraction/doc/list_numbers.rs:644-657 | crates/xberg/src/extraction/docx/parser.rs:589-601 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e67d30e3fa2ecb0aa4bd2154374c908b49b3ed9f5c0fc6213eaaca1136a08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/api/handlers.rs:856-876 | crates/xberg/src/api/handlers.rs:898-915 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b429ec8ee1bfe8b89342f977d9eb810daecca6ddf6f8cfcdd94120af76992e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/late_interaction/mod.rs:575-593 | crates/xberg/src/sparse_embeddings/mod.rs:428-446 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0ce2ba5bc96884451888390ce96406887fcea298b32560453f49839d72f97c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/llm/usage.rs:44-58 | crates/xberg/src/llm/usage.rs:66-76 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/llm/usage.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1751ae2ee67c72a711c5ef4682fdc4ab905e43d2ac33ef7712feeb1eb9853118"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:8641-8653 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:8700-8722 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":8641}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f67d29cc4101e722a951cd7173f356814924df9e16d589e064414675a1b2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/ocr/hocr_parser.rs:1215-1235 | crates/xberg/src/ocr/hocr_parser.rs:1249-1266 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6681e3089c99870316dfe5624ad99479df65bedde372ef367e3337083f322e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/extraction/xml.rs:242-251 | crates/xberg/src/extractors/xml.rs:62-74 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/xml.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b7e760a3b1294d0665905ca2bbaf1ab7cfc61a5b2ad8411512846f5e6e5f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/ocr/processor/execution/full_scan_table.rs:186-198 | crates/xberg/src/ocr/processor/execution/recognition_orientation.rs:244-256 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/full_scan_table.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ce6e01610d73ffab37b3bd488169e3990bc6bb9e18c4f1a6e8a4bb7db31a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/xberg-libheif/src/integration/image.rs:50-60 | crates/xberg-libheif/src/integration/image.rs:63-73 | crates/xberg-libheif/src/integration/image.rs:76-84 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/integration/image.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"615eb4b8f320ed3fc761df296f5495ce32071c48ab9d731a10c89addcbd3b318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:981-996 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1002-1016 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"64641ce33f3e2b3259cc4934640466ac8cf12c9c2821537674ce40ba73a72c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg/src/cache/core.rs:294-313 | crates/xberg/src/ocr/cache.rs:241-258 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cache/core.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f10d7cb0ca4bfd08b9687246fc649bbe9f77d72e18047d3ece17ba8880483b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-native-pdf/src/lib.rs:276-291 | crates/xberg-native-pdf/src/lib.rs:344-354 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/lib.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"941d95c51af7f4529afcd3f86419d775bf30027ab3d4457924268e214f2ed114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:413-422 | crates/xberg-tesseract/src/api.rs:434-443 | crates/xberg-tesseract/src/api.rs:455-464 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"15460a05a1ffbe0b45a517198467096761eaed8a0ef68d16877d1b88cd31802a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2810-2832 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2377-2405 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1078-1097 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fe1f5898488ddb1110ae767d7fd37ba818218dfc21796f25cf6889b8dc4ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg/src/cache_dir.rs:39-52 | crates/xberg/src/cache_dir.rs:65-79 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cache_dir.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54b858978584ad58d9e5e2ca27cba3a0622a16b6e5e76c86ba9aa74b9337d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/xberg/src/core/server_config/loader.rs:70-80 | crates/xberg/src/core/server_config/loader.rs:91-101 | crates/xberg/src/core/server_config/loader.rs:112-122 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/server_config/loader.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"15de6cecc91db3905cf10398ad253b55080c5be236998226ed38f1536072ecf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg/src/extraction/docx/math/render.rs:210-223 | crates/xberg/src/extraction/docx/math/render.rs:225-238 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/render.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4913470e32abc054527237eee5c8693727b985f46b3a26110c27edcb8544ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/xberg/src/extraction/transform/content.rs:373-392 | crates/xberg/src/extraction/transform/content.rs:441-456 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/content.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"314761337f8558675516047c76913c06b51c2d576046c05067ad9ee7995ac6c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/layout/types.rs:156-171 | crates/xberg/src/layout/types.rs:177-191 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/types.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9daf6d26395107a07976b8d6770955c4387867ad5244be5ea768bfb10843de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1071-1083 | crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:683-695 | crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:700-712 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8c059b4d6d28ed42559df6ea9f51dcacda3fa7062f257ab7722678fa706929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/extractors/orgmode.rs:1057-1074 | crates/xberg/src/extractors/orgmode.rs:1077-1088 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"d090c9b4a3c54d4296773bd07fe603efa7ca5be096285f8b8169c4ae614c3f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/xberg-libheif/src/regions.rs:185-196 | crates/xberg-libheif/src/regions.rs:208-219 | crates/xberg-libheif/src/regions.rs:237-248 | crates/xberg-libheif/src/regions.rs:261-272 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/regions.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"927a29c925c3594d99774b06c2bd52fde1254f5f695b2231c53b6bd9bf99186d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg-native-pdf/src/rendering/mesh_shading.rs:180-196 | crates/xberg-native-pdf/src/rendering/mesh_shading.rs:1139-1155 \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":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77a595c1ee9b94be86d5dac289cecc6a7a92c2ef6d1a877b5aabbef3867d267"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg-native-pdf/src/rendering/mesh_shading.rs:514-524 | crates/xberg/src/extraction/diagram/polyline.rs:146-153 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aeefbd682caf0578e5487c24cb77ad3868a9b98c9c1950cfe2dd329c9949ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/lib.rs:506-517 | crates/xberg/src/lib.rs:521-532 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/lib.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41c7a0f84d70192fe4e8ffd5781789e373560bc24597bab39d126653f6cc4d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/chunking/vectors.rs:42-60 | crates/xberg/src/chunking/vectors.rs:102-121 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/vectors.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"04051c56ca729ee0e64b71277f4b12b622f6660f594eaa5e185e53b7a17b69f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/extraction/excel/open.rs:629-636 | crates/xberg/src/extraction/excel/open.rs:790-797 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a16c20359ab56d10290ce208b7a57ba211a7d9bd72d58fc15adc24e6e82a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/extraction/html/structure.rs:742-767 | crates/xberg/src/types/internal_builder.rs:758-776 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"3257ee8fca790ea023f484fc69fcdb4cec8910be68147b90dbed22dc38ad10ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/extractors/jupyter.rs:640-653 | crates/xberg/src/extractors/jupyter.rs:848-859 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"11190819a9c95110bad2d75f6871c6585a4fe38ea5c331074a11b669c7bb34d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg/src/extractors/orgmode.rs:318-334 | crates/xberg/src/types/internal_builder.rs:793-806 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadcb7a53707829e18b52cb0e2d68ee245fb6775418df86f77ce99e7ba744778"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:167-182 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:215-227 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12a2008cdd1f1581592abe658a20d86209299e50c6984e23d0733a8cdc0a00c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs:184-202 | crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:470-488 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ffcbaba7c6083a0b861e5f27e503ff9c1459cd658f041490891606a0a12d72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg-tesseract/src/page_iterator.rs:170-182 | crates/xberg-tesseract/src/page_iterator.rs:189-210 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/page_iterator.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45f689456558f721752547d81295bc4aac268a4ff5350bc7972e241d1006555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg/src/extraction/diagram/odf.rs:124-129 | crates/xberg/src/extractors/odp.rs:103-109 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/odf.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d298366c4aa22cf21cb120fb18c602c3f0e9fb79c69cf485c16a95c016880119"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg/src/sceptre_ocr/mod.rs:141-154 | crates/xberg/src/sceptre_ocr/mod.rs:200-213 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/sceptre_ocr/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d65420f47ed47a8150a0fc814e395c7d63c66f3cc5abeadc927194204667a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg/src/extraction/doc/list_numbers.rs:660-688 | crates/xberg/src/extraction/docx/parser.rs:617-645 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a749a1c242c09a0e35c39e427ee84e911eaf7da3fa95cc1b42b521876fa4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/xberg/src/extraction/pptx/parser.rs:230-241 | crates/xberg/src/extraction/pptx/parser.rs:374-385 | crates/xberg/src/extraction/pptx/parser.rs:387-398 | crates/xberg/src/extraction/pptx/parser.rs:460-479 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e44741c1c8a94acfc7e9e14f7e3045da5e0b0d6785e7fc1f9cfb7ec33ea0832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg/src/extractors/image.rs:4124-4142 | crates/xberg/src/extractors/vtt.rs:154-170 \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":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a0bcf04eefb2f94263321ce47822ad7e0da0baec800a329c91d68168b0f164"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/text/translation/fields.rs:299-312 | tools/benchmark-harness/src/embed_benchmark.rs:24-34 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/translation/fields.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9542b71820376587470c099906eb4178ac19bde096a34c701366f40edcc18f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/extraction/docx/math/render.rs:279-293 | crates/xberg/src/extraction/mathml/render.rs:261-275 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/render.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad30b15f98e2aeade1a1e2828496b673876f222129da15fd67278990cfd5e95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/extraction/excel/table_budget.rs:267-276 | crates/xberg/src/extraction/excel/table_budget.rs:369-378 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a237a44c7e569cec721d9b07e5d4a767b81a5936ba5f40cdbebe9bfa165d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/xberg/src/text/token_reduction/simd_text.rs:73-84 | crates/xberg/src/utils/quality/mod.rs:205-214 | tools/benchmark-harness/src/adapters/subprocess/support.rs:31-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/token_reduction/simd_text.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c64b08b2bb7c88ea3edb2f8488ae5549aef219c19f784700abdea940ab16bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg-native-pdf/src/layout/document_analyzer.rs:148-156 | crates/xberg-native-pdf/src/layout/document_analyzer.rs:161-169 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/layout/document_analyzer.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18367b2f9e9a8e9bc2f7dd9ba2f638ecd1e813a677e46f2b09672ec8ff42908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5496-5518 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5533-5552 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ea679521ea2b46efc72fa6cb52880e28ac2d7666b7bb68c75a004bdc1628e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg/src/extraction/docx/parser.rs:1056-1072 | crates/xberg/src/extraction/docx/parser.rs:2242-2262 \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":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7e64923b99f7a1b722f611b883a95a51bbe86f07d4416a704d9bcef18dd1cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/extractors/image.rs:4190-4205 | crates/xberg/src/extractors/pdf/mod.rs:284-298 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":4190}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd502b567ec38afb4b05e6dca4627b31e7d753024a1e17747abaef5f2d32c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/xberg-native-pdf/src/content/parser.rs:646-663 | crates/xberg-native-pdf/src/content/parser.rs:1825-1844 | crates/xberg-native-pdf/src/content/parser.rs:2031-2050 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e6024be8e3cfc1704b2daa87e791d7cb89054009930886ba46387670d4e49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/extraction/typst_math.rs:265-274 | crates/xberg/src/extraction/typst_math.rs:276-290 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/typst_math.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"061987f929df1cf75ba22264ad55e76fd1c51cb29f04e62517bceb4a563e83d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/extractors/pdf/ocr/document.rs:891-901 | crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs:114-126 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"b020b817c625309b2dba60b5b157d89d0d5d9604b3f668cee59b9ec080a44bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/xberg/src/text/classification/chunk_classifier.rs:156-174 | crates/xberg/src/text/classification/page_classifier.rs:179-198 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/classification/chunk_classifier.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"487463a9fb54bc8a7c9d4d8c5a4c6f65c4f0bfb6950c0769cf7d16edaab54d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): integrations/python/surrealdb/src/surrealdb_xberg/pipeline.py:115-130 | integrations/python/surrealdb/src/surrealdb_xberg/pipeline.py:258-280 \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":"integrations/python/surrealdb/src/surrealdb_xberg/pipeline.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"437f424a7f99c490adc6ea5af6dd7e471b417f2c9a6c01f3d692dda20704bc58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-native-pdf/src/fonts/unicode_decode.rs:695-706 | crates/xberg-native-pdf/src/fonts/unicode_decode.rs:717-729 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/unicode_decode.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f74d062010e0e941298fdfb5cd0537fc0d89600cecaed6f444266a225c21ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/metadata.rs:137-158 | crates/xberg-pdfium-render/src/pdf/document/page/object/image.rs:544-564 | crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:341-362 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/metadata.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"438be5daddb80aeed19077331103cb80059b8c4c3a8abc1b078b832d66791468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/extraction/doc/list_numbers.rs:693-700 | crates/xberg/src/extraction/docx/parser.rs:607-614 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e531f951b371aa8538ac037767f681f1dcb5c0397910d8212ccabe7c0cfb3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-native-pdf/src/content/parser.rs:1523-1537 | crates/xberg-native-pdf/src/content/parser.rs:1542-1552 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a70bbdabfe220666cdcd96902b093d084aca8a047149fc16bd51a47ae683caf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/layout/models/table_classifier.rs:78-88 | crates/xberg/src/layout/models/table_classifier.rs:98-108 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/table_classifier.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afd0ba139396abb40348154db630ce360eca83121822b4303f7cf7d1f9ce74b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg/src/plugins/extractor/trait.rs:152-166 | crates/xberg/src/plugins/ocr.rs:324-338 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/extractor/trait.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1505e53ed25915200397296e1a9d59443d11686bf3eaad3fbef532a93e31fab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/rendering/redaction_projection.rs:378-390 | crates/xberg/src/rendering/redaction_projection.rs:392-404 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/redaction_projection.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"c868a5127f605f50748d15e871fa7357ff862faf7bbe0083bb1123ea2177f037"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/xberg-native-pdf/src/fdf/fdf_writer.rs:113-128 | crates/xberg-native-pdf/src/fdf/xfdf_writer.rs:144-157 | crates/xberg/src/extraction/typst_math.rs:444-459 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fdf/fdf_writer.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a85056d1b7a8adbb11a97eee27ae04e9e0e438bbc9b90ff7f196e96fe377ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotation/objects.rs:77-95 | crates/xberg-pdfium-render/src/pdf/document/page/object/x_object_form.rs:178-196 | crates/xberg-pdfium-render/src/pdf/document/page/objects.rs:147-163 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/objects.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"98854e4ed19a0084a30310109062c22b58bef220dae5c19acf5b6ef4ffe5fe53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/pdf/native/text.rs:1413-1423 | crates/xberg/src/pdf/native/text.rs:2486-2496 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6c0867953c48c21bbc8485cf1dd40aa542959fbee61a0652d68129f3759175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/pdf/structure/classify.rs:575-582 | tools/benchmark-harness/src/noise_detection/mod.rs:346-353 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4ca854995c2dd6a93f049ef57174b73754112500800f7eb138cb2acf0510ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-tesseract/src/result_renderer.rs:25-35 | crates/xberg-tesseract/src/result_renderer.rs:46-56 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/result_renderer.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"086b0740ae6491e8250efb387c7d1eab9c98d34b42aa7cc9f4c7e2ee3c25e23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/xberg/src/embeddings/engine.rs:67-82 | crates/xberg/src/late_interaction/engine.rs:111-122 | crates/xberg/src/reranking/engine.rs:138-153 | crates/xberg/src/sparse_embeddings/engine.rs:73-84 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/engine.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b99b665fc94c9b87d7746358ff4416f2cba53e0c8cd8cef110be87b6016f965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:35-48 | crates/xberg/src/extractors/rtf/parser/mod.rs:184-197 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"995306d699580b5cad4603b882d199c4f80bcf317a798fb5340c90e5e6b382a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs:487-501 | crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs:535-550 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"439218b0735e547522883f0fdd8173e4147251684ea9f6e8d0171615c86fcca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-native-pdf/src/extractors/xmp.rs:188-199 | crates/xberg/src/utils/xml_utils.rs:143-155 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/xmp.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c34ee0192064287adf2ca23997095f3674f7ed3a7795950fd738e74aaa1174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-native-pdf/src/rendering/mod.rs:59-74 | crates/xberg-native-pdf/src/rendering/mod.rs:77-88 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"291043ede7d2ffe79bfa739a5b32a4346eb13c567e047f04b4cab36baae95e42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg/src/extractors/myst.rs:188-201 | crates/xberg/src/extractors/myst.rs:239-244 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/myst.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5c23061f5e642543e907a2d297621728f0f8d4887948bd38fd0f070fb0bef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs:88-100 | crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs:102-114 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b76a7660a325fe58ace5ae3a3d8658b060c2ac8423382168825ae97ba35925"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg-libheif/src/heif.rs:110-123 | crates/xberg-libheif/src/track.rs:101-114 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/heif.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a11ee83fc5ea9ce4ce1deb106b5baeae41a1aab959f7705cbd289d77c3a5a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/xberg-native-pdf/src/extractors/paths.rs:663-670 | crates/xberg-native-pdf/src/extractors/paths.rs:676-683 | crates/xberg-native-pdf/src/extractors/paths.rs:689-695 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/paths.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ea57ad0e446a1a9e2145ef0821e9534cba457778d8be3ab8b9d8ea3b8c8853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg-native-pdf/src/geometry/mod.rs:60-73 | crates/xberg-pdfium-render/src/pdf/rect.rs:78-98 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/geometry/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bc9a630b39753d8526062eeaca513dc9be0f8845225930dabc5c26c9a877e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/xberg/src/extraction/email/rtf.rs:235-250 | crates/xberg/src/extractors/epub/content.rs:906-923 | crates/xberg/src/rendering/markdown.rs:74-95 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/rtf.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5411fec7fd2e2ce5016ccd09961be5a4d730879975073cb4f06f11a5fdb49ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/xberg/src/keywords/yake/preprocessor.rs:256-291 | crates/xberg/src/pdf/structure/classify.rs:1945-1985 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/keywords/yake/preprocessor.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad37ce6a2522b40da2b27a2445c2b173f8d2b7fd2025651e893013a2e1b808e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/xberg-native-pdf/src/structure/table_extractor.rs:398-413 | crates/xberg-native-pdf/src/structure/traversal.rs:375-390 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd5cdb16bb1b1d8aef7bfbf24a02337e40b2766bec0788c22b3c9497def7b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/extractors/pdf/mod.rs:178-191 | crates/xberg/src/extractors/pdf/mod.rs:194-203 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"329a583647b6e8a360fbc6c87c0ce28f1aa256ad93b3d51090ccee3390c03918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg/src/plugins/registry/extractor.rs:457-473 | crates/xberg/src/plugins/registry/validator.rs:138-154 \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":"crates/xberg/src/plugins/registry/extractor.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"accb81eec9220227a0a5e0b2f5754bf1513508a27eb3ef1946dc49669685056a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg-libheif/src/heif.rs:192-198 | crates/xberg-libheif/src/heif.rs:204-210 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/heif.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccdae3ae7bd2c446c55a42a5cd27d7ce23501df979ac4d6f036f9c9d7ffcfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/xberg-native-pdf/src/fonts/unicode_fallback.rs:49-77 | crates/xberg-native-pdf/src/fonts/unicode_fallback.rs:90-119 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/unicode_fallback.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac6c39087043bce1888f4a1e6f8e9f6b6e49bde54eee75c2f082c92b75040d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-native-pdf/src/pipeline/text_processing/citations.rs:154-168 | crates/xberg-native-pdf/src/pipeline/text_processing/citations.rs:171-185 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/text_processing/citations.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de50dfcfe48d306fb6f9f30d2e226a3699e5c54f908a340592e1e723bb9949b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/candle_ocr/ocr_result.rs:52-66 | crates/xberg/src/core/config/ocr.rs:1577-1589 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/ocr_result.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034ca4bbbe2ce0208ade4ffb6baafae96de368a96819188a03dda1d6562b917"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/chunking/vectors.rs:77-85 | crates/xberg/src/chunking/vectors.rs:137-145 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/vectors.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cebe4a8a8dcbba243ae45555883c3d5ba279c3c84341ef6121c8f050c292a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/engine_cache.rs:43-51 | crates/xberg/src/text/ner/gline.rs:365-378 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine_cache.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c995dcc63031e19781161c66d8a18a520a17b68fe95e03accf62a766ef90a181"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/extractors/iwork/numbers.rs:614-623 | crates/xberg/src/extractors/iwork/numbers.rs:661-670 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/numbers.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a0c2d8f7e27b3fc59a6ce3fa3c577f5ffe226e830d27a38ba698f89c7661d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg-libheif/src/context.rs:249-262 | crates/xberg-libheif/src/context.rs:282-297 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/context.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eee9df85aa65ff926ecaa79109b893179f13b472ed1d2eba25f1cebf103a5b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-native-pdf/src/content/parser.rs:85-95 | crates/xberg-native-pdf/src/extractors/images.rs:3302-3319 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ba1c6e3f78b3868d9c3b7191ea613957d1abfc7d05db67b31bf79a3be6f2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg/src/extraction/excel/table_budget/legacy.rs:132-137 | crates/xberg/src/extraction/ppt/embedded.rs:124-129 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/legacy.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5446fa6e11cf934e01795b6f990772b9b534c1dcd61c2dbbc9db65a91fb4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/extraction/transform/elements.rs:119-129 | crates/xberg/src/extraction/transform/elements.rs:171-182 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/elements.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72073fa6faf28b74ec90dd2a98f08bfc7ec1849a6fa313eec2a72eb2b669e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/rendering/comrak_bridge.rs:212-221 | crates/xberg/src/rendering/comrak_bridge.rs:574-584 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db59b29479aedcaf48e0a3a0616328124c37085b1953c71852ebcefdac5872a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/types/internal_builder.rs:101-107 | crates/xberg/src/types/internal_builder.rs:121-127 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/internal_builder.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6c6a908743d055f8e7a411b7d7c51caf9c9280a0014d86c06edf851e74cc6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/xberg-tesseract/build_support/source_archive.rs:132-141 | crates/xberg-tesseract/build_support/source_cache.rs:74-84 | crates/xberg-tesseract/build_support/source_cache.rs:599-608 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/build_support/source_archive.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"099e1e9c1a168d6c6253aa75f913a92eab8592ddc9502bccdabbc86c2ac0983d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/extractors/pdf/rotation.rs:71-77 | crates/xberg/src/pdf/native/span_geometry.rs:69-78 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/rotation.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"814816dd25d4b86ceeaa5b27eef1978f67216d9d4ff5d883bcf5a076b85fcfa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/text/redaction/external.rs:198-206 | crates/xberg/src/text/redaction/external.rs:213-221 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/external.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbf80912341ade5a422ab4e8a427f4d4309893c2b54e4e4c6908b02e7f15253"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/types/internal_builder.rs:305-321 | crates/xberg/src/types/internal_builder.rs:350-358 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/internal_builder.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6f2dc7feb34074a1575bd8d3d0d0c3bbd1dc75829eb12cb06746f08959ae03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:605-617 | crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:621-633 | crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:646-663 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"467c938c4e03c457f97960c2fc2156c0780e0f29eb3ea2e638d444ae43a578c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-native-pdf/src/document/extract_api.rs:309-320 | crates/xberg-native-pdf/src/document/extract_api.rs:335-347 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7945a85654ac5d83e96fa833613601aacc5e29a714fa72f5c8896b8321be78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-pdfium-render/src/pdf/bitmap.rs:119-133 | crates/xberg-pdfium-render/src/pdf/bitmap.rs:152-166 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/bitmap.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08a55144b5b780cdbf9f260dbcf27e449f30ee6b244e3c6b5c96395beddf6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg-tesseract/src/result_iterator.rs:295-301 | crates/xberg-tesseract/src/result_iterator.rs:317-323 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/result_iterator.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19ca37e2d7ddd248e53930f1f16a9e0707066283c61a987b3f056a4566f7f72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/xberg/src/extraction/diagram/mod.rs:65-69 | crates/xberg/src/extractors/pdf/mod.rs:1823-1827 | crates/xberg/src/pdf/structure/pipeline.rs:6876-6880 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"28363f40d18a5f93565ee6fa4d9c297fcf49f422483dbc6e40a0308487a0d8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/plugins/processor/builtin/qr.rs:269-280 | crates/xberg/src/rendering/dot.rs:104-118 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/processor/builtin/qr.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49206a997ef561c678e2be0ec5d883f9f594e08794be45aadec550fcb21d319"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-native-pdf/src/structure/types.rs:356-366 | crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:115-125 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/types.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"679849c30729a8cab9f92cacb79179562080f4a29d17d769b7a635a45f9ea4e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/fonts.rs:356-367 | crates/xberg-pdfium-render/src/pdf/document/fonts.rs:491-502 | crates/xberg-pdfium-render/src/pdf/font.rs:281-293 | crates/xberg-pdfium-render/src/pdf/font.rs:457-469 | crates/xberg-pdfium-render/src/pdfium.rs:427-438 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/fonts.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a863774535969568b172aa354014aead030f0740029d2d02789be6f4a81c11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 6\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:621-626 | crates/xberg-tesseract/src/api.rs:921-926 | crates/xberg-tesseract/src/api.rs:989-994 | crates/xberg-tesseract/src/api.rs:1005-1010 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e67183299714863ba5384f6dc5b2a25b461a88ba32d497e3328c3430f16eeb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/core/image_encode.rs:600-608 | crates/xberg/src/core/image_encode.rs:628-636 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/image_encode.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b347fc820e0514f1260fc4240d5dd6aa0199e35c6c2020fadd992cb5dbcd0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/doc_orientation/detector.rs:106-114 | crates/xberg/src/doc_orientation/detector.rs:125-133 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/doc_orientation/detector.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4df529951cb11394fe0d50f2e940ea0bd62fa603bdd1ca9a45ec2ea90f05b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 8\u002B corresponding lines): crates/xberg-libheif/src/regions.rs:518-532 | crates/xberg-libheif/src/regions.rs:536-543 | crates/xberg-libheif/src/regions.rs:551-563 | crates/xberg-libheif/src/regions.rs:573-585 | crates/xberg-libheif/src/regions.rs:589-606 | crates/xberg-libheif/src/regions.rs:618-634 | crates/xberg-libheif/src/regions.rs:652-667 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/regions.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33380fcdb7f137e15d916e8bfa7aeb2787ac58dced070afd707349c7116f67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/xberg-native-pdf/src/pipeline/metrics.rs:113-128 | crates/xberg-native-pdf/src/pipeline/metrics.rs:131-159 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/metrics.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f2c8cd19cb926a42df616ea005b7a6a2bff8687b8f9ba43578c41645d3648c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/permissions.rs:92-105 | crates/xberg-pdfium-render/src/pdf/document/permissions.rs:127-139 | crates/xberg-pdfium-render/src/pdf/document/permissions.rs:158-173 | crates/xberg-pdfium-render/src/pdf/document/permissions.rs:177-191 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/permissions.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33c47d6bd3edf3413a45aa9462529747329bdcb6a891fe1bc9a976146c9f04b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/chunking/page_spans.rs:235-245 | crates/xberg/src/pdf/structure/pipeline.rs:6781-6790 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/page_spans.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3d3b90bfec2fc593c72e35cc2e1427377763cd91abbc76b4b81cf6fddcad55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/extraction/email/eml.rs:574-583 | crates/xberg/src/extraction/email/eml.rs:586-595 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/eml.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"e495a2add16536061b501fa093b81463298cf384fd3ecf3aa1470a8509276e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/xberg-native-pdf/src/fonts/unicode_fallback.rs:138-155 | crates/xberg/src/extractors/pdf/reading_order.rs:608-628 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/unicode_fallback.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64bec7afc7688cd6b4320f58e70614b5361f46e34b219d2e594419bd38cbae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-pdfium-render/src/pdfium.rs:137-147 | crates/xberg-pdfium-render/src/pdfium.rs:155-165 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdfium.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80c1e7b5e91be6fa341a88c62d8fd3402c454609e3fffbdb96efd4e678e2a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-tesseract/src/leptonica.rs:498-508 | crates/xberg-tesseract/src/leptonica.rs:516-526 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/leptonica.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaacdd5297f786169d689f34a29c3415d9ed5bcac0ccfeb42105b085c5f349f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/xberg/src/embeddings/mod.rs:1167-1179 | crates/xberg/src/extractors/transcription.rs:162-175 | crates/xberg/src/reranking/mod.rs:857-869 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6065db06c87ae6cb957b9f427be13fdd67bd2b1188fd836bc7c347a7662f2af4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/extraction/excel/package_metadata.rs:8-19 | crates/xberg/src/extraction/excel/package_metadata.rs:76-87 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cf52532ae79d01fd15415679136c17536bceed542b31a98940d93a3bba1948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/extraction/image_ocr/pdf_gap.rs:172-178 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:11148-11156 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_ocr/pdf_gap.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d731dc75747b8855d14047552f4a21818536a73fce861bfdfccf1e25e94e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/extractors/image_table_reread.rs:273-280 | crates/xberg/src/extractors/image_table_reread.rs:332-341 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image_table_reread.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6182fceceb5a922b6950769652059200be197f570fc5348d5e2f7eaca799d6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/extractors/pdf/ocr/caption_conversion.rs:38-45 | crates/xberg/src/extractors/pdf/ocr/number_recovery.rs:687-694 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/caption_conversion.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8431d81d82cec99487bdce3094d95c8f473ae0e93c5a672a3e49b6f8cd5e74f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/paddle_ocr/model_manager.rs:883-893 | crates/xberg/src/paddle_ocr/model_manager.rs:968-979 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/model_manager.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1b43c6fea3212024675921913683d3911ac23b7063c5e93501c1d2ca4f1bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg-libwpd/src/dto.rs:291-296 | crates/xberg-libwpd/src/dto.rs:302-308 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libwpd/src/dto.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2cb4e12e6c2d162d1e9c4014a66dee630d9ec09e44337570ffc9109984db28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/xberg-native-pdf/src/fonts/unicode_decode.rs:74-87 | crates/xberg-native-pdf/src/fonts/unicode_decode.rs:94-107 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/unicode_decode.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb8d9a5e2c7cb0d85ebbc7cd065a106f37a8845862065628e48360ce03e7822"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object.rs:274-285 | crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:774-788 | crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:795-809 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d23c47e86c4fe5e10c472ba6a710133cc5240c0ea1fed8b349c0456e8f7761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/xberg/src/extraction/typst_math.rs:462-477 | crates/xberg/src/extractors/epub/content.rs:886-903 | crates/xberg/src/rendering/comrak_bridge.rs:64-80 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/typst_math.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ae34bda86f620368450c1758a350e382f13eb79a0bec23c2c59a5b1abed6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/xberg/src/layout/models/pp_doclayout_v3.rs:120-126 | crates/xberg/src/layout/models/rtdetr.rs:74-81 | crates/xberg/src/layout/models/rtdetr.rs:88-95 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/pp_doclayout_v3.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6daf35c3775fed5d41b69361ffccf2ec9381fa9b99c78dea65c2492e869b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg-native-pdf/src/color/mod.rs:332-340 | crates/xberg-native-pdf/src/color/mod.rs:414-421 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/color/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c543784eedcefac64419dfe81674dc77325b16dce6fedcebf9ebeb27e3f9ebab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/xberg-native-pdf/src/extractors/images.rs:119-138 | crates/xberg-native-pdf/src/extractors/images.rs:199-218 | crates/xberg-native-pdf/src/extractors/images.rs:249-268 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36718d15d9395c5543eef7c0f8e996f79b047e57a1644c8783bee156d443c7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object/image.rs:300-312 | crates/xberg-pdfium-render/src/pdf/document/page/object/image.rs:327-339 | crates/xberg-pdfium-render/src/pdf/document/page/object/image.rs:351-363 | crates/xberg-pdfium-render/src/pdf/document/page/object/image.rs:378-390 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/image.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e09c62434c8f313e7012799d271eb84ef9b03008d530ca51680197b064a3583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:976-984 | crates/xberg-pdfium-render/src/pdf/font/glyph.rs:98-108 | crates/xberg-pdfium-render/src/pdf/path/clip_path.rs:164-174 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"4741eb0135f363e1499efb74dbd4770046d84fd3a3cfefb6cae35d3777601632"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-pdfium-render/src/pdf/font.rs:603-614 | crates/xberg-pdfium-render/src/pdf/font.rs:619-630 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/font.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cfd0bc28e38d7a128f96aafa1c512370d57a908ec3286b3468fd4d4c65b37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg-tesseract/build_support/source_cache.rs:284-294 | crates/xberg-tesseract/build_support/source_cache.rs:297-306 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/build_support/source_cache.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"db24472f3ac17ce20db622b1e31ca04ab71087e87ccf09aebbf4008e772b7264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg-tesseract/src/leptonica.rs:394-403 | crates/xberg-tesseract/src/leptonica.rs:607-616 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/leptonica.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"acecb845cc9ce52a20b33830af4347cd14fb40e3dc7b64ccd0c87acdbc663594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/xberg/src/core/config_validation/sections.rs:274-288 | crates/xberg/src/core/config_validation/sections.rs:321-335 | crates/xberg/src/core/config_validation/sections.rs:356-371 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config_validation/sections.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2939a18c2b444eb0747e9a66efb78fa0ee783adc8146c5a2548a651464d141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/xberg/src/extraction/docx/drawing.rs:349-357 | crates/xberg/src/extraction/docx/table/mod.rs:778-786 | crates/xberg/src/extraction/excel/table_budget/ods.rs:286-297 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c414695cc71138bd33d647c34ce8d50e1350ccadc3caa5e031c813fd7554b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/xberg/src/extractors/archive.rs:425-442 | crates/xberg/src/extractors/archive.rs:511-528 | crates/xberg/src/extractors/archive.rs:592-607 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/archive.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c141da7dc9134914f24c041c2c879e8545cf2951c6a1cc39274ccea6ad4e1be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/xberg-native-pdf/src/elements/path.rs:68-83 | crates/xberg-native-pdf/src/elements/path.rs:86-102 | crates/xberg-native-pdf/src/elements/path.rs:745-760 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/elements/path.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2613986895074be19f171f961224abe9138bc860f2af4c49cfdb2390de9409c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg/src/pdf/native/hierarchy.rs:110-119 | crates/xberg/src/pdf/native/hierarchy.rs:803-812 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa62795ebddec12ad0078e934697cacb3bb8efe67d8e7983672d1f600d9a878"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg/src/pdf/native/table.rs:1671-1675 | crates/xberg/src/pdf/structure/regions/geometric_tables.rs:396-400 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb0254822884d1c933e661b1801980d0009aab51118b52397b490effa4f42a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/xberg-libheif/src/image.rs:335-343 | crates/xberg-libheif/src/image_handle.rs:119-129 | crates/xberg-libheif/src/image_handle.rs:149-159 | crates/xberg-libheif/src/image_handle.rs:319-330 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/image.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"126a6d2315ad17d7dfe953fd827acc164bdeb4e8624f9d4782265223aea7703c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:240-248 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:251-262 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:265-276 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"931908fe70a5cfbea2ae9aee207d7a660e376898cd4e8a1b8e98aff7ae6b997b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 9\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:1064-1073 | crates/xberg-tesseract/src/api.rs:1473-1481 | crates/xberg-tesseract/src/api.rs:1488-1496 | crates/xberg-tesseract/src/api.rs:1503-1511 | crates/xberg-tesseract/src/api.rs:1522-1531 | crates/xberg-tesseract/src/result_renderer.rs:149-158 | crates/xberg-tesseract/src/result_renderer.rs:171-180 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fbcf8f3be18ef009a3933a2afa8ac0a50853b47db49eef7e9c7175240a0739"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/xberg/src/extraction/html/stack_management.rs:95-103 | crates/xberg/src/onnx/mod.rs:95-103 | crates/xberg/src/pdf/native/mod.rs:48-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/stack_management.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a89eacaef12d6d0b72ff0bfb58e84ff6f15f4353ed59f112a3c01b901307a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:274-284 | crates/xberg/src/pdf/native/hierarchy/script_evidence.rs:276-284 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb235bb128b4787a9afad849e97af7cb326ef569ad7eb9d38e6eea5523a78bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:213-224 | crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:454-467 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcc8a361e3ebd5b5bff847e42d373e75053236887fdf08d3d65bb5d964c87ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/extractors/pdf/ocr/document.rs:1011-1019 | crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs:634-640 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70bd2b72628b5533fc41744cb968d74f6b8c45550d082d672e974d6a4a60d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/size.rs:453-465 | crates/xberg-pdfium-render/src/pdf/document/page/size.rs:471-483 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/size.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d336155fb6ca630364bcbfd450099d636b4f0df73c009e25e81129b9c8edba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 8\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:633-641 | crates/xberg-tesseract/src/api.rs:648-656 | crates/xberg-tesseract/src/api.rs:873-880 | crates/xberg-tesseract/src/api.rs:1534-1541 | crates/xberg-tesseract/src/choice_iterator.rs:40-50 | crates/xberg-tesseract/src/mutable_iterator.rs:65-73 | crates/xberg-tesseract/src/result_iterator.rs:170-178 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3baf73f293c136f951b49bb5aa06a82f94c2e9b7325a595e0c3be217dee3252"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/pdf/table_reconstruct.rs:2626-2633 | crates/xberg/src/table_core.rs:1660-1667 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"65578976b7c6ae8e34cee885ab7f26a3d505d0662aee71b0aed55a85e142e0b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/xberg/src/extractors/image_photo_title.rs:56-72 | crates/xberg/src/ocr/caption_grid_proof.rs:41-57 \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":"crates/xberg/src/extractors/image_photo_title.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d7c9328c3eb8a123359a6b81e478aaba0f7240909d231e0b9c61d07657cd90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg/src/extractors/pdf/ocr/tall_source/ordered.rs:133-138 | crates/xberg/src/pdf/structure/list_marker.rs:110-115 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source/ordered.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d2c69adc418ece7bee98d885f07831153d4c1fe36c0fb7519ff34b586aecac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/xberg/src/types/djot.rs:45-54 | crates/xberg/src/types/formats.rs:680-689 | crates/xberg/src/types/formats.rs:737-746 | crates/xberg/src/types/ocr_elements.rs:62-71 | crates/xberg/src/types/page.rs:103-112 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/djot.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1e8436b606e80c99bee19b3afc266dcf75e35e0b37b2fafab7237511775162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/late_interaction/mod.rs:317-328 | crates/xberg/src/sparse_embeddings/mod.rs:199-209 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab36dc74b01159b7b12da82b62bdccccad0ed05d0900acd79f6aab0b7b92d213"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/xberg-tesseract/src/api.rs:1185-1189 | crates/xberg-tesseract/src/result_renderer.rs:99-103 | crates/xberg-tesseract/src/result_renderer.rs:118-122 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d0c8e2b9f924294d620e94c094fb32354bd76e2f12033cdb50fc57f2254b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/xberg/src/extractors/pdf/ocr/plausibility.rs:126-133 | crates/xberg/src/pdf/native/table.rs:2572-2579 | crates/xberg/src/pdf/table_reconstruct.rs:2473-2480 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/plausibility.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14c05f6c0b6b80747e03743334170bdf4aee26f1501ecfacb01d639a9863696"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/extractors/pdf/ocr/symbol_noise_lines.rs:48-63 | crates/xberg/src/extractors/pdf/ocr/document.rs:1152-1159 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/symbol_noise_lines.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4177de90ac86faab958287a0b3370133f64538409271ab034d9575e1195dc1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg-libheif/src/context.rs:74-80 | crates/xberg-libheif/src/context.rs:117-124 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/context.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4555896c2dfef92749e8b6e5de6d6ada538446098f4b4b8cc916d59a53cb195a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg-native-pdf/src/rendering/page_renderer.rs:4057-4066 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2629-2635 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4057}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63b06083da2c9dccbc4cae23c7a8e7caf6fc909a825b261a95a8a5a8d9f02a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg-paddle-ocr/src/crnn_net.rs:67-73 | crates/xberg-paddle-ocr/src/angle_net.rs:19-24 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/crnn_net.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"029be0590171557d9bc3cae23640f9cef90b486ab8efb9e696b85aac7acf301e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object.rs:262-271 | crates/xberg-pdfium-render/src/pdf/document/page/object/text.rs:312-321 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce917a754ba09bb320ef14a922a374fcfb05f057105629803a737eee77d562b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/xberg/src/extractors/pdf/ocr/number_recovery.rs:412-424 | crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs:62-73 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/number_recovery.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8533d49fbfbb90dc0819a4b5039cc93cfc30144d26f17c81e85c43ffe5f340bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/xberg-native-pdf/src/encryption/algorithms.rs:618-628 | crates/xberg-native-pdf/src/encryption/certificate.rs:508-514 | crates/xberg-native-pdf/src/encryption/write_handler.rs:229-235 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"822f5ca38a6fa72a7b466828eccee424a998b4f2dfe0de6d5aa7fbe68f83a670"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs:144-151 | crates/xberg/src/extractors/pdf/ocr/pipeline/detached_table_pair.rs:28-35 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6f7022cf5e34044ea17e590d77e071709cd650b253e8155de8e354825344f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:375-384 | crates/xberg-pdfium-render/src/pdf/document/page/struct_tree.rs:87-96 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"5300dc89da086297f2904b084fb2560ebdea0e6bf54706eba27cd6b07982e69e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/extraction/doc/mod.rs:339-345 | crates/xberg/src/extraction/doc/piece_table.rs:20-30 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/mod.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b64e487553b99fa524699c8f64728e758fb3bbc8c72a147d1c0806422543f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg-native-pdf/src/geometry/mod.rs:155-160 | crates/xberg-pdfium-render/src/pdf/rect.rs:194-199 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/geometry/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d40f26e7cdbc7b41a73768780677aed60a1fe2c071edb52a523b8bca20ffe04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg/src/extractors/image_table_reread.rs:69-73 | crates/xberg/src/pdf/native/table.rs:1040-1047 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image_table_reread.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac292fab4e3d41ffa6604457bbf3598d1b2e34b523bb778f8bb0cc7e459aad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:816-826 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/attachment_points.rs:126-136 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"86482b988c06a3238ae05beaa2ef4135c29a730387da696a7b03afda727bd426"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/xberg/src/extractors/image.rs:1451-1453 | crates/xberg/src/pdf/native/table.rs:35-41 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eda205d955dabbfa04a1bc20314b88c4815e1e4f1f8aaaeeffc1d14d31efea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/xberg/src/extraction/doc/list_numbers.rs:626-629 | crates/xberg/src/extraction/ppt/mod.rs:309-312 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"26afa3197b361311e74c01a2792854bef3ec0c628f2b1b24b0511499de1d21a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): integrations/python/langchain/src/langchain_xberg/loader.py:65-71 | integrations/python/llama-index/readers/llama-index-readers-xberg/llama_index/readers/xberg/base.py:111-117 \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":"integrations/python/langchain/src/langchain_xberg/loader.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"386503d4e1d4ae8db7b3b9403b8dd4e0b89321be9981d162d82672bdc998b936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg-native-pdf/src/color/mod.rs:207-212 | crates/xberg-native-pdf/src/fonts/font_subsetter.rs:187-194 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/color/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d53decacd756bda289f6b3b1076e8f15173a98a4e370865386a21040aa0e85a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg/src/core/config/ocr.rs:1154-1158 | crates/xberg/src/ocr/tesseract_backend.rs:131-135 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/ocr.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"29eab3c8d4f06e17aa9ea0fa80a2fae5a9033b32b1aee3b0f178db19b0e000ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/rendering/common.rs:685-693 | crates/xberg/src/rendering/markdown.rs:320-329 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/common.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d7cd382e384dfd63ff052311e84c4d228459ba4f4fc683ed010510310fbfc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg-gliner/src/candle/encoder.rs:63-67 | crates/xberg-gliner/src/candle/heads/mod.rs:66-70 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/candle/encoder.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7afe6cad8bf498af9de40e9d7548c59ebf708151855b7faecff058533cb1eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/core/config_validation/dependencies.rs:46-58 | crates/xberg/src/core/config_validation/sections.rs:625-637 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config_validation/dependencies.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"488da6f3fa0e75e7330f4bf683e1758d2dc406b73ea3516b329b0aa4037453c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/core/pipeline/features.rs:45-51 | crates/xberg/src/extractors/ppt.rs:40-47 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e05435f5feda65781730e2a1a4e8f3b981bb9e2dea9c511feedae27baf72d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/xberg/src/core/config/late_interaction.rs:75-86 | crates/xberg/src/core/config/sparse_embedding.rs:62-72 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/late_interaction.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed57e674d5eb3c86cb777be8076e40d2cfaec2067202c6410b6ea08a87b2f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg/src/extraction/image.rs:635-642 | crates/xberg/src/ocr/tesseract_backend.rs:297-304 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edd32ab1fcb71ef46946035320e47275590e6ab77775fd70d7ac006367d8779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg-native-pdf/src/rendering/mesh_shading.rs:1158-1163 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:8062-8066 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a155b5e0497e542eb0c31bc6119ceb0dc28c99e66c2bb7e22ca91e8c16eb0b8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg-native-pdf/src/xfa/parser.rs:538-545 | crates/xberg/src/extraction/docx/parser.rs:421-429 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xfa/parser.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2099e4fb9da00a83549280b149a99e00dd401b392aff2a8a5bd94037a80ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/fonts.rs:291-297 | crates/xberg-pdfium-render/src/pdf/font.rs:198-205 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/fonts.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a268f38b488fef7989fcc030d5148b571b75834451b304cd07a6f9cd44e2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg-pdfium-render/src/pdf/document/fonts.rs:422-428 | crates/xberg-pdfium-render/src/pdf/font.rs:374-381 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/fonts.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ee069edc95342831e35560ec77d1b9650656d1cf490ca99a8467c9afef14e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/xberg/src/embeddings/engine.rs:45-54 | crates/xberg/src/late_interaction/engine.rs:86-97 | crates/xberg/src/reranking/engine.rs:112-122 | crates/xberg/src/sparse_embeddings/engine.rs:56-63 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/engine.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8570383a88ec610aef2cc27ed37a4a24092f5abc3f3bbde75d5d4141d381f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/extraction/excel/table_budget.rs:68-74 | tools/benchmark-harness/src/quality/mod.rs:526-532 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"14afecef8e3de89a52e0be8cb5f9a8a711b01f2c52139540f5ebfc33b63c82c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/xberg/src/late_interaction/mod.rs:482-485 | crates/xberg/src/reranking/mod.rs:534-537 | crates/xberg/src/sparse_embeddings/mod.rs:342-345 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02472415a0f7829745b5d221b9d91848dfbebb9d32f35b43f7a49c53ab03179"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/xberg-native-pdf/src/document/paths.rs:476-481 | crates/xberg-native-pdf/src/optional_content.rs:91-97 | crates/xberg-native-pdf/src/structure/article_threads.rs:48-53 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfb8544bc640aabcf75490dfbdddcf5ca488e6d8daf30fe74216a3b643e1825"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/xberg/src/extraction/doc/list_numbers.rs:620-623 | crates/xberg/src/extraction/doc/style_scripts.rs:161-164 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac632eb304f7b3d4ce01e7e989bbca86212d9548b627364457a4bc7537d1877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/extraction/html/structure.rs:75-86 | crates/xberg/src/extractors/rtf/tables.rs:20-28 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf21b5fbc51c43d5a1800e165bc3a7d4740b5c229645c67df0c48da21da346af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg-libheif/src/decoder.rs:300-305 | crates/xberg-libheif/src/encoder.rs:384-389 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/decoder.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58c224d0fe349afe45f36a9d4c15e860f9cef7d77f2ff5d0ca6dc02d6ef897e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/xberg/src/core/config_validation/sections.rs:661-673 | crates/xberg/src/core/server_config/validation.rs:39-52 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config_validation/sections.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee36a61d9711a1aa39ff78697673c6a5976e50cadb31683b6a8c80773e9212bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tools/benchmark-harness/caption_export/src/caption_export/assets.py:21-27 | tools/benchmark-harness/parsebench_html/stage.py:94-99 \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":"tools/benchmark-harness/caption_export/src/caption_export/assets.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedc5f677a608461574a95334bfbca898b30fe583ff7505881a4fed1dedcb602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg/src/extraction/doc/images.rs:184-188 | crates/xberg/src/extractors/pdf/ocr/number_recovery/font_profile.rs:291-295 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/images.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"62225a96006c8f065ac6cb23f0228eeb63788a89d3568758d1889bf5086b3b36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/xberg/src/extractors/pdf/extraction.rs:339-347 | crates/xberg/src/pdf/native/table.rs:726-733 | crates/xberg/src/pdf/structure/pipeline.rs:3762-3770 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"42298b3b1c6af004a70e737386bbd90bd39ab56c3cc68f24ccd4d9b9a4507ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/xberg/src/pdf/native/text.rs:2534-2540 | crates/xberg/src/table_core.rs:668-671 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"438e71c6f728231c8a0b9c5dc077b3fbb157b00f155ff3da5a87964cb86f7784"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/xberg/src/extraction/diagram/mod.rs:60-62 | crates/xberg/src/extraction/image_ocr/pdf_gap/occurrences.rs:18-20 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a12905a913516f6f8652c399d7487152f5cfdc5104a6537bb41bff0c3300d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/xberg/src/extraction/heif.rs:21-23 | crates/xberg/src/extraction/image.rs:96-98 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/heif.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb54eb13de121b3fe5b72dac5e9bbf04e8f01fd852760628d0679b5cc2b6bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/xberg/src/extractors/image.rs:1554-1561 | crates/xberg/src/ocr/tesseract_backend.rs:1231-1237 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a204c57b684ce1f7a50374b761a3de44ecd6c56ae21c0ba6b98f23d9952a5fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/xberg/src/extractors/image_photo_title.rs:52-54 | crates/xberg/src/ocr/caption_grid_proof.rs:67-69 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image_photo_title.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fe9f5568f9872b83e6f64bfe4ce1a46a22780369c79e8075afd892360eac2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/xberg/src/extractors/pdf/ocr/orientation_retry/two_tables.rs:325-327 | crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs:105-107 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry/two_tables.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b65462369f2c6cada97480190e9e4b3586526f8f5687621fc7fa2a76d3dea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg/src/pdf/table_reconstruct.rs:1387-1391 | tools/benchmark-harness/src/quality/mod.rs:436-442 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"555430a0837bacb7334ded0ee1cfc5d72b09769abed1cd3ac8e2acc37cdf2f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/xberg/src/extraction/image_ocr/pdf_gap.rs:257-262 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:8919-8924 | crates/xberg/src/extractors/pdf/ocr/read_reuse.rs:188-193 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_ocr/pdf_gap.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84304529ef3abeee50b388ead3f0e52800f109525605c4838e91b841d4bbb73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): crates/xberg/src/extractors/email.rs:474-477 | crates/xberg/src/extractors/html.rs:925-928 | crates/xberg/src/extractors/jats/mod.rs:747-750 | crates/xberg/src/extractors/structured.rs:849-852 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7de17e158d8669acd6e6c4e499773fcf45e2dac3122d1eb838e37915b205c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/xberg-candle-ocr/src/models/glm_ocr/preprocess.rs:22-31 | crates/xberg-candle-ocr/src/models/image_processor.rs:25-32 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/preprocess.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c196ed0db8f5d682fed350ce26bf748264f71d486be17a80df3991b9050bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg-native-pdf/src/fdf/fdf_writer.rs:183-187 | crates/xberg-native-pdf/src/fdf/xfdf_writer.rs:70-74 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fdf/fdf_writer.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34d973ed93a7ee40a14d58939dfbb07ef401b273d54d905161d96d8b186d8a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/xberg-native-pdf/src/text/script_detector.rs:313-318 | crates/xberg-native-pdf/src/text/word_boundary.rs:713-731 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/script_detector.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a399206f4faf16462505ecda0b0e17ce330d0ae6a1cb5f35e388a320e73a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/xberg-pdfium-render/src/pdf/document/page/annotation/attachment_points.rs:98-104 | crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:126-132 | crates/xberg-pdfium-render/src/pdf/document/page/object/x_object_form.rs:97-103 | crates/xberg-pdfium-render/src/pdf/document/pages.rs:195-201 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/attachment_points.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13dc86126026c3433abbd5e80c8d0f282328b1d45cbb37bc283a93d7153030e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/xberg/src/extractors/pdf/ocr/document.rs:695-699 | crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs:225-228 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c34ee64fa995eac4648bcab9845dc41d476663e763cceda7610b43e93b13cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs:380-383 | crates/xberg/src/candle_ocr/glm_ocr_backend.rs:570-573 | crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs:337-340 | crates/xberg/src/candle_ocr/trocr_backend.rs:289-292 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38f48939d1edcd68170b11b00d0e5979ec6b21f21151778743ec605eeb971b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/xberg-native-pdf/src/decoders/ccitt.rs:31-34 | crates/xberg-native-pdf/src/decoders/jbig2.rs:42-45 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efc99650146ed725cc9e4f30b588b6395e34a3df957d63e11111fbd678316e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg/src/core/mime.rs:1251-1257 | tools/benchmark-harness/src/fixture/mod.rs:42-46 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/mime.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"1861befae16bdea288f603ce79ef8d19d9a53d6c4e69ab7dd10cb64d54f0c452"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/xberg/src/extractors/asciidoc/syntax.rs:61-65 | crates/xberg/src/types/internal_builder.rs:747-751 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/asciidoc/syntax.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6c5b4df1ccae7f90b45bc88994b16f3b1565a15a92794f16c7f0835eccc37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): crates/xberg-native-pdf/src/rendering/page_renderer.rs:8758-8760 | crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:256-258 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2560-2562 | crates/xberg-pdfium-render/src/pdf/matrix.rs:46-48 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8758}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a10dab19e57c08c724ebb94976f16e17904da077e64a2709ca310b874f545ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u2013107 lines \u00D7 3): crates/xberg/src/extractors/docx.rs:1121-1124 | crates/xberg/src/extractors/odp.rs:444-549 | crates/xberg/src/extractors/odt.rs:1850-1956 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/odp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 133 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f099a936fb78b24e7abf31ce091d6fc2bdab8baf022a26afeff1fe61975afc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:7382-7453 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:7507-7578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:7382\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":7382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ed4c9ded974cebf71f35445e04f56f325cea8dc5f81fe08dd51cec87283c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (64\u201368 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:5913-5980 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6378-6441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6378\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":5913}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b6929fbfea7235a0b4966a6018140ec5e7b2225f23b32e1d002b02f71b9730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): crates/xberg/src/candle_ocr/ocr_result.rs:211-260 | crates/xberg/src/llm/vlm_ocr.rs:323-372 \u2014 before extracting anything, compare \u0060crates/xberg/src/candle_ocr/ocr_result.rs\u0060 and \u0060crates/xberg/src/llm/vlm_ocr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/llm/vlm_ocr.rs:323\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/ocr_result.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"927785cee5cbb1261e83385d240cd887a2556099737d5878233816fe4f326751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201347 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/cff_encoding.rs:161-202 | crates/xberg-native-pdf/src/fonts/cff_encoding.rs:215-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5555ed86232fbef2de6b8ba51ba5d813d707c08603b1aa58664f199f2b13356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201346 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:270-315 | crates/xberg-native-pdf/src/extractors/text/advance.rs:513-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 \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:270\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5c99b4485c9e0933f713d61083b269e7b0ea8ed742eb84118c52ba9365a606"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43\u201344 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2196-2238 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2353-2396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf0b700c08c0c0862b89f19d25ae5f2afce172c1995a731e898421c0647548f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): crates/xberg/src/extraction/doc/metadata.rs:60-102 | crates/xberg/src/extraction/ppt/mod.rs:1458-1500 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/doc/metadata.rs\u0060 and \u0060crates/xberg/src/extraction/ppt/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/doc/metadata.rs:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060meta\u0060 to \u0060\u0026mut DocMetadata\u0060 in one and \u0060\u0026mut PptMetadata\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/metadata.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2887e432623a7d1c935f2bcb83ba66588d7bc1587f48ab7bbb1f549f3997e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38\u201341 lines \u00D7 2): crates/xberg/src/pdf/structure/regions/table_recognition.rs:1632-1669 | crates/xberg/src/pdf/structure/regions/tables.rs:295-335 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/regions/table_recognition.rs:1632\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8167fdebd8f7b318c97b37a12a75424d8199e5a72e5b5cbb37cabe6e8c512db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201346 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1545-1590 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1702-1741 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1545\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"774158bfed40a16af514bfc233c91f833018b6d59021905b20141abb1fcc00b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:7924-7963 | crates/xberg/src/pdf/structure/pipeline.rs:7989-8028 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/pipeline.rs:7924\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7924}}}],"partialFingerprints":{"codehealthFindingId/v1":"af07e3136e4ef082d8f6d6e6d6d300045c59853304b525281d9d487650c2536d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/xberg-tesseract/src/mutable_iterator.rs:82-119 | crates/xberg-tesseract/src/result_iterator.rs:187-224 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-tesseract/src/mutable_iterator.rs:82\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/mutable_iterator.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4bf4d07449911c7f57ea767a5ba7318158f86322dde15afc4fc5f4f9e8923b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201337 lines \u00D7 2): crates/xberg-native-pdf/src/document/fonts.rs:976-1012 | crates/xberg-native-pdf/src/document/fonts.rs:1090-1122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/fonts.rs:976\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7a31a605a1511bcc0c53ef37fa41b1c20b0ce9c5c98cdc484dcc525c23ec0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51 lines \u00D7 2): crates/xberg/src/core/extractor/bytes.rs:116-166 | crates/xberg/src/core/extractor/file.rs:246-296 \u2014 before extracting anything, compare \u0060crates/xberg/src/core/extractor/bytes.rs\u0060 and \u0060crates/xberg/src/core/extractor/file.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/extractor/bytes.rs:116\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/bytes.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0644a7321880241d92fc7dfd5c3375376a5859168bf2eb04d94d02892695fa65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/xberg-native-pdf/src/structure/parser.rs:593-627 | crates/xberg-native-pdf/src/structure/parser.rs:652-686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/structure/parser.rs:593\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22094a7ea89b14d46336ade6fa790cdb8c31ccc0d4b2133150bd74b6a8c6588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): crates/xberg-native-pdf/src/document/extract_api.rs:2210-2242 | crates/xberg-native-pdf/src/document/extract_api.rs:2247-2278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:2210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":2210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f968e73d6d6ac11b10047b17982c1ab81d33ffd2ecb11db9ce08411d2d649c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1906-1937 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1961-1992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1906\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efe958ec2da4544fefa52485185339fc37668f24784ac81e2d8cfb2a780c474"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/xberg/src/extractors/odp.rs:554-599 | crates/xberg/src/extractors/odt.rs:1961-2006 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/odp.rs\u0060 and \u0060crates/xberg/src/extractors/odt.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/odp.rs:554\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9f180242f6c717fe61823b1aced4ecd41f00b4d3f5778d68a9a3fd57752e24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201331 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5922-5952 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6843-6860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5922\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5922}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c976341a375c6da922fda7c8f76beb2dfa9ce743b83693a65ba28dffcbdcf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): crates/xberg/src/keywords/yake/preprocessor.rs:257-286 | crates/xberg/src/pdf/structure/classify.rs:1946-1976 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/keywords/yake/preprocessor.rs:257\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/keywords/yake/preprocessor.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43bcc9df38d4ad5f89f7d7376922e749a855c6747ebd60727510b25ba687504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201339 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5271-5303 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5888-5926 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6818-6847 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2624b86a30db21a930e2ddba92e8f874f1bf89a715a24f1cfc4f162d1559ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/xberg-tesseract/src/api.rs:1567-1596 | crates/xberg-tesseract/src/api.rs:1621-1650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-tesseract/src/api.rs:1567\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cbd191592797fd30dd9cea0c530b1f26fb2ea8f16be221d9aaedac4aac02e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): crates/xberg/src/pdf/structure/assembly.rs:158-187 | crates/xberg/src/pdf/structure/assembly.rs:832-860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/assembly.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/pdf/structure/assembly.rs:863\u0060 calls \u0060push_table_element\u0060 and \u0060crates/xberg/src/pdf/structure/assembly.rs:189\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea62643bacb689134577da028271a59a30807800ad2a638f9deeab90aa0d200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:604-631 | crates/xberg/src/extractors/fictionbook.rs:991-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:604\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a07173e64e7fa661844eead5ec95df904b4b8004c6bcf86b23c2423116bb820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/xberg/src/extractors/pdf/mod.rs:3262-3290 | crates/xberg/src/extractors/pdf/mod.rs:3382-3410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":3262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcabe1c833472098c57548ca030dfd83dffb85616a4ac2287d0cfc9a3e611954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/xberg/src/ocr/tesseract_backend.rs:650-678 | crates/xberg/src/ocr/tesseract_backend.rs:770-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 \u0060crates/xberg/src/ocr/tesseract_backend.rs:650\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/ocr/tesseract_backend.rs:679\u0060 calls \u0060select_byte_read_elements\u0060 and \u0060crates/xberg/src/ocr/tesseract_backend.rs:799\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7de1e39f8d6d5307b0f34aea3f84cd5bd5e6da268150df584964702be6f6eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201337 lines \u00D7 2): crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1454-1490 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1636-1658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc1554943c970149f7ab0d27e4dc0560ff90561e0dc462fbbb41244beda4b84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1863-1889 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1975-2002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1863\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1863}}}],"partialFingerprints":{"codehealthFindingId/v1":"3950ec4cfd1c2c9d8921cdd31723f45af8102978c3043bbeabe5bad658b2a356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201340 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2092-2131 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2286-2321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2132\u0060 calls \u0060get\u0060, \u0060copied\u0060 and \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2322\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f4ec4b17a120ce8e13799603e041dd8be694aa72a6265e9e92b49130393bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): crates/xberg/src/ocr/tesseract_backend.rs:683-723 | crates/xberg/src/ocr/tesseract_backend.rs:803-843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/tesseract_backend.rs:683\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 before the matched lines, \u0060crates/xberg/src/ocr/tesseract_backend.rs:801\u0060 calls \u0060select_output_ocr_elements\u0060, \u0060take\u0060 and \u0060crates/xberg/src/ocr/tesseract_backend.rs:681\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf47ce1a585b3b1afd0b91929f24c93194c1321dc3c88684e1cc770e2eabe2cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/xberg/src/pdf/structure/regions/table_recognition.rs:1864-1891 | crates/xberg/src/pdf/structure/regions/tables.rs:113-140 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a6dd10dcef0ea7388292ce92ddf6e7f9b0d8233d60dc595b1cdd0d65dcca12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201325 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5761-5776 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5836-5860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5761\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5761}}}],"partialFingerprints":{"codehealthFindingId/v1":"270a16f26e4d8f755cde9a7b4ccc62fa31ebb29c0bfd23474e795dd00c594a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/xberg/src/core/config/ocr.rs:23-47 | crates/xberg/src/types/formats.rs:17-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/ocr.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c5db063df10a4c82a8b1f147834848dc9b27f137a6a9a500b8aea27232dda0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/xberg/src/engine/extract_impl.rs:1719-1743 | crates/xberg/src/engine/extract_impl.rs:1758-1782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/engine/extract_impl.rs:1755\u0060 calls \u0060clone\u0060 and \u0060crates/xberg/src/engine/extract_impl.rs:1717\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f4d15a23911a7c537b4830584124e771eb1570bbb764ce4ae2a1d36af2c80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 3): crates/xberg-native-pdf/src/fonts/font_dict.rs:3410-3433 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3497-3520 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3584-3607 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:3410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ee9e9a3b48d1c10b0cea4267b9d2f7082622e406da99c4b458a1d565d8327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:923-946 | crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs:93-116 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs\u0060 and \u0060crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:923\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn flush_tj_span_buffer(\u0026mut\u0060 in one and \u0060super) fn flush_tj_buffer(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b12b9883cb3c274016a537467e39044bfd4edd9332a4293e23f16d1b825c91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:6269-6292 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6350-6369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:6269\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6269}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a21e9682258c1931a685eaa1c1623592beb776331c0db67d794b8c0066a3c30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:2548-2571 | crates/xberg/src/pdf/structure/pipeline.rs:2614-2637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd740e4fc64e2bfdf617d110598a14a180cf673df61c58c8ae9f47fbd379601"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): crates/xberg-native-pdf/src/decoders/ccitt.rs:70-92 | crates/xberg-native-pdf/src/decoders/ccitt.rs:146-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/decoders/ccitt.rs:70\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/decoders/ccitt.rs:164\u0060 calls \u0060skip_eols\u0060 and \u0060crates/xberg-native-pdf/src/decoders/ccitt.rs:93\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3217bc4e902bd593827c9a08d4f943e15e6ea8d5fec597801eeb33c0fff8e93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1818-1840 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1896-1918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"779c0efa2d4a0871915e5fb3180c9a858424bc8098617891a46fbaeae877e386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1857-1879 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1951-1973 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c832ac0176d8ea3563275c469834a69666960633a5aa14728b1111d054c1bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/xberg/src/extractors/djot_format/extractor.rs:678-700 | crates/xberg/src/extractors/djot_format/extractor.rs:702-724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7a332ea3e7d7eabe2660631fec0765438ef4d5f254662b65c67a4ff10595b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201322 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/text/advance.rs:55-76 | crates/xberg-native-pdf/src/extractors/text/advance.rs:251-263 | crates/xberg-native-pdf/src/extractors/text/advance.rs:487-496 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb0e7f17ff1d36aa7f3ac12209bba0be73a6a4254ff5a3747507cecdf75429e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:1013-1034 | crates/xberg/src/extractors/docbook.rs:1318-1336 | crates/xberg/src/extractors/docbook.rs:1378-1396 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1013\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4015845d6ba81d16d95b2d14375cde9d08273612917d5a3bd00269b6e2bb51a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/forms.rs:234-255 | crates/xberg-native-pdf/src/extractors/page_labels.rs:158-176 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/forms.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b3425fc29aa2b3fb36194ab38101dd6a018a80a453127e96d4bfbfeb40bed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/paths.rs:558-579 | crates/xberg-native-pdf/src/extractors/paths.rs:586-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn update_from_path_state(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/paths.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65a186d08407edb7c727620a2b2b39ad6b99f9488d468be960982572c63e705"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:2448-2469 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:2526-2547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:2448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":2448}}}],"partialFingerprints":{"codehealthFindingId/v1":"902d324ee5a3d5fd733d95a15520237fb05bcdfc6939c7295e313e134738b9bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1838-1858 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1947-1968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1838\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"3feeeb1c07a9ded3469c26d2482c40c3d5e1e226ff432dcffeaa9547800590e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5212-5233 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6420-6438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5212\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e199c9fa7e756cd1eaf1d02a4cd50b30306513ac6791b862847bfec9782ece02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/xberg/src/extraction/excel/open.rs:562-583 | crates/xberg/src/extraction/excel/open.rs:706-727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/open.rs:562\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc6ae310b813db3ee85087cce3e0b085f978e78ba8d885281afd37745709a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/xberg/src/pdf/structure/classify.rs:1000-1020 | crates/xberg/src/pdf/structure/layout_classify.rs:350-371 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/classify.rs\u0060 and \u0060crates/xberg/src/pdf/structure/layout_classify.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/classify.rs:1000\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3ef70fa7138bd9f717c0aa6a2bc74864badcae928f3632b93ab4d975091ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 5): crates/xberg-native-pdf/src/fonts/font_dict.rs:3420-3440 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3507-3527 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3594-3614 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3767-3787 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3833-3853 \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":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":3420}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7baa628eb997d30173def359ae87d3b9b370d055ac23f518e132c76d33c002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2093-2112 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2171-2191 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2328-2348 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2093\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c923aff4bff6098fed4431260daa535cd213d8cbda185a5052fb495b31c4f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1314-1334 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1663-1683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9f382f5ff21e7ee54f7959760fe866a5079f8a472230af484077e75d7e0ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/xberg/src/extraction/excel/package_metadata.rs:121-141 | crates/xberg/src/extraction/pptx/metadata.rs:52-72 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/excel/package_metadata.rs\u0060 and \u0060crates/xberg/src/extraction/pptx/metadata.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 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 before the matched lines, \u0060crates/xberg/src/extraction/pptx/metadata.rs:49\u0060 calls \u0060insert\u0060, \u0060to_string\u0060, \u0060clone\u0060 and \u0060crates/xberg/src/extraction/excel/package_metadata.rs:118\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2efcdc9ae157612463f8175742948b9b021c9460d85a6226af4fae3fdb2be00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/xberg/src/pdf/structure/adapters.rs:1729-1749 | crates/xberg/src/pdf/structure/pipeline.rs:1408-1428 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/adapters.rs\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"30fffcccd95a3a12c9962c2d38efee441989091f09bfeade576d76d7b63f7270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/xberg/src/plugins/processor/builtin/ner.rs:84-104 | crates/xberg/src/text/redaction/engine.rs:1855-1875 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/plugins/processor/builtin/ner.rs:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026NerConfig\u0060 in one and \u0060\u0026crate::core::config::ner::NerConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/processor/builtin/ner.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d875830742fc4384bd826fc18017ee4acab318609d1448615f53adced08a7eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1767-1786 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1806-1825 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1845-1864 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1884-1903 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1939-1958 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1767\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1765\u0060 calls \u0060close\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1883\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa77ad7a19410e6db5723c640b119ea121de3cce706360fe509d9512fbc786af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/text/advance.rs:15-34 | crates/xberg-native-pdf/src/extractors/text/advance.rs:128-146 | crates/xberg-native-pdf/src/extractors/text/advance.rs:328-345 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn advance_position_for_string(\u0026mut\u0060 in one and \u0060super) fn append_and_advance(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99dcb621ec7a0f4e57e88407f51e183da4a42106aec5bbe3735e945ba616a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/xberg-native-pdf/src/pipeline/config.rs:82-101 | crates/xberg-native-pdf/src/pipeline/config.rs:166-185 | crates/xberg-native-pdf/src/pipeline/config.rs:194-213 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/pipeline/config.rs:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/config.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dde64f4e0b6162ae1f41c0aeb03520ca0b1768d5b8e23255f4dba66544ef2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201320 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1354-1373 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1698-1709 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1885-1896 \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":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3f4a213fa426155fe811d4184120082f86e826d6411ea6ef5ec744ab786984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg-cli/src/main.rs:1055-1074 | crates/xberg-cli/src/main.rs:1077-1096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/main.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2c9050681455d8bd67b9c3c163f419a1bb6abca79a99999ce2cde8c26df2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/algorithms.rs:409-428 | crates/xberg-native-pdf/src/encryption/algorithms.rs:679-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc147f3a16e08aeb5097b84984306dfcf1affd1e4823d64a28cad4a54f29d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:228-247 | crates/xberg-native-pdf/src/extractors/text/advance.rs:459-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eae6bf14f2901ff78e987f767ab3e08776f87c1e61d0dcc6bdb9cce1bcdf36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg-native-pdf/src/xfa/extractor.rs:75-94 | crates/xberg-native-pdf/src/xfa/extractor.rs:105-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/xfa/extractor.rs:75\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xfa/extractor.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d753b13951184e30caf606391f773d74b5777be201a4aab42a7bc4940c2a284f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:343-362 | crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:376-395 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs:343\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/text/char.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92545432b9ab7244555b99216fc60f9c7bfa5d9f2bec5f1296d30c14b0ab99f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/candle_ocr/ocr_result.rs:173-192 | crates/xberg/src/llm/vlm_ocr.rs:288-307 \u2014 before extracting anything, compare \u0060crates/xberg/src/candle_ocr/ocr_result.rs\u0060 and \u0060crates/xberg/src/llm/vlm_ocr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/ocr_result.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"636a1b2d53745c00c271084c7c617578e75e1d8825e5f77c71306193a795c222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/xberg/src/core/extractor/bytes.rs:88-108 | crates/xberg/src/core/extractor/file.rs:190-210 \u2014 before extracting anything, compare \u0060crates/xberg/src/core/extractor/bytes.rs\u0060 and \u0060crates/xberg/src/core/extractor/file.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/bytes.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd257dff001f023b11ae2474e8b3468ca78756f79c509bdc126da0ef11835086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/core/extractor/bytes.rs:235-254 | crates/xberg/src/core/extractor/file.rs:223-242 \u2014 before extracting anything, compare \u0060crates/xberg/src/core/extractor/bytes.rs\u0060 and \u0060crates/xberg/src/core/extractor/file.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 92 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/bytes.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3690ce8420763a4e6f858904b0cc79416e9ce1b4beeccec49b49a8ce7a5f220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/extraction/excel/open.rs:602-621 | crates/xberg/src/extraction/excel/open.rs:763-782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/open.rs:602\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb181eeb348925288d27ab43de69dcc3ad3c637a9ae3ae34ce63923f01ff667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/extraction/ppt/mod.rs:870-889 | crates/xberg/src/extraction/ppt/mod.rs:894-913 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/ppt/mod.rs:870\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8e2d1f7aeae735302e46d6dac2516b2d2f6631b0ffa0d248a00467e16b6f22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2071-2090 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2265-2284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2071\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e8fca256ba6189cd7d845325c153b6dc27ab49c150d2691c59835a86a52d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:392-411 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:798-817 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:390\u0060 calls \u0060update_scope\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs:797\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba69ee589a3dc801a222bd66a3d02c43eebb2e98b78ea4690359722fd11facc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/text_extract.rs:400-419 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:585-604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs:400\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/text_extract.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d380cca8cff36763cf1a906d8d654d6dc5fb47717464950790f18fbab63afe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/xberg/src/mcp/server.rs:1218-1237 | crates/xberg/src/mcp/server.rs:1280-1299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/mcp/server.rs:1218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9918eea0150902668934e6acd7d3f25e6d375775e97b5d36a890069c1301ac0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 3): crates/xberg-native-pdf/src/content/parser.rs:131-149 | crates/xberg-native-pdf/src/content/parser.rs:538-553 | crates/xberg-native-pdf/src/content/parser.rs:1767-1782 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae0bcce67e99c47358f93a3c826935a4d1109e42ec574c5b66e6cd2b94cf59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/xberg-native-pdf/src/structure/parser.rs:565-583 | crates/xberg-native-pdf/src/structure/parser.rs:595-613 | crates/xberg-native-pdf/src/structure/parser.rs:654-672 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeda41f69f7fd843274b876fbb6ed41aab90429ebebe10864b0c44ad22673e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/xberg-native-pdf/src/document/extract_api.rs:1455-1484 | crates/xberg-native-pdf/src/document/extract_api.rs:1830-1859 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/document/extract_api.rs:1860\u0060 calls \u0060is_empty\u0060, \u0060Ok\u0060 and \u0060crates/xberg-native-pdf/src/document/extract_api.rs:1485\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d871c9549ef9282f77d3a8e67bbdd67220390b42b4b760ac25e937a33e9e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:170-187 | crates/xberg-native-pdf/src/extractors/text/advance.rs:375-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:375\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12b7de0f4872eaba312ddb665df5463fbe43e6d213d21f2fa4253d1dee422d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:850-868 | crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs:49-63 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs\u0060 and \u0060crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn flush_tj_span_buffer(\u0026mut\u0060 in one and \u0060super) fn flush_tj_buffer(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"91692fa8771bce352a5af15d5008eecbbadab62c751008cccaa886b63ecdbf2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1650-1668 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1876-1894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1650\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"02860e1cdfa04cce86039f4c525aed90e41687dc25cfd248174f148498b5a082"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201319 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1805-1823 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1925-1935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1805\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87230746f8936ce4094982cf0f84c04b50fb0b9e726ade18694e1baa4f8bf86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2134-2152 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2163-2181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd2bd8edc5aa3c681096e01505c4adddbcdaa1d467e1f3f174983425a5bc7dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:3777-3795 | crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:4150-4168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:3796\u0060 calls \u0060iter\u0060, \u0060any\u0060 and \u0060crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:4169\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bf11e8312c22983951a5a786e6ec68b29f495c151392d4be1d2331369243e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:759-777 | crates/xberg/src/core/pipeline/mod.rs:1059-1077 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/pipeline/mod.rs:759\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a1da88dcd03c876df3cfc0a7abe59605b43aa2c1cf34e0a0627b0cbf2c4f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/xberg/src/engine/extract_impl.rs:1120-1138 | crates/xberg/src/engine/extract_impl.rs:1183-1199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/engine/extract_impl.rs:1120\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98c3113d83aefa08eda617d22a834a2dc511bd74606ec39742f13b30626c7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg/src/extraction/docx/table/mod.rs:594-612 | crates/xberg/src/extraction/docx/table/mod.rs:619-637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/table/mod.rs:594\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"87df6f578fa90d3898a38ee83bbd91e41bb4e20b8d1723e34766141051cdcb1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:1255-1273 | crates/xberg/src/extractors/jats/mod.rs:159-177 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1255\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"84af4d3cd6c12d70468dd00392d7c75c2abcf70a13966d8cb98b47c93420ed3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg/src/extractors/latex/utilities.rs:13-31 | crates/xberg/src/extractors/latex/utilities.rs:505-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/utilities.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"005bfe8c68ce7832356e74c1ea0166aaea10404f1fd2fa56adb2982a3fc1ebae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg/src/pdf/structure/adapters.rs:1575-1593 | crates/xberg/src/pdf/structure/pipeline.rs:1326-1344 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/adapters.rs\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/adapters.rs:1575\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/pdf/structure/adapters.rs:1594\u0060 calls \u0060Some\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs:1345\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a06dfd5717b59d44fbd9996d22cb89437bde656141d38ac1c1cc43154d72ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/knockout.rs:261-278 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1593-1610 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1744-1758 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/knockout.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"015941b293933c9b061a35c0678e23f2a13288782f09d5d0f5b66c669eb96168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/xberg/src/layout/mod.rs:447-464 | crates/xberg/src/layout/mod.rs:536-553 | crates/xberg/src/layout/mod.rs:637-654 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/layout/mod.rs:447\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/mod.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4765ce3d71d830acaacc7996fb164344dd5e41a59de6d2900f594902ac60258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:1865-1882 | crates/xberg-native-pdf/src/content/parser.rs:2073-2090 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:1865\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"a112c59dd4553fad601f1ec978c960630927fd3475670b36167c9f882f9fc58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/xberg-native-pdf/src/document/objects.rs:698-715 | crates/xberg-native-pdf/src/document/objects.rs:798-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/objects.rs:698\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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"64afe42ebb829a9b4acd4a8c1a0149bd307f1971c2ae26ffa8e9a91395ce2aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/xberg-native-pdf/src/document/objects.rs:1625-1642 | crates/xberg-native-pdf/src/document/objects.rs:1667-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/objects.rs:1625\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efce28d1f6faedc679b301f0de05db860cdc7798322f23d4bb531b413bec607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/xberg-native-pdf/src/document/paths.rs:165-210 | crates/xberg-native-pdf/src/document/paths.rs:690-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/paths.rs:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"49518bfe2119f4a5b536b4fec1936ba3c1504999818e881fade885bd0d020328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/algorithms.rs:198-215 | crates/xberg-native-pdf/src/encryption/algorithms.rs:758-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/encryption/algorithms.rs:198\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, \u0060crates/xberg-native-pdf/src/encryption/algorithms.rs:757\u0060 calls \u0060update\u0060 and \u0060crates/xberg-native-pdf/src/encryption/algorithms.rs:197\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4b8afa53dfa592e40c18439798cceb9929451e1591835b488f9ae3491a9249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg-native-pdf/src/pipeline/config.rs:90-107 | crates/xberg-native-pdf/src/pipeline/config.rs:118-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/pipeline/config.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/config.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26b3ee279000efee1ab9e80e9d476ec5fa69d260b20d7b957b0b645137aefa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2065-2082 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2026-2043 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3558b3f698966892d62b53a8ce606769ba9a7749356dec98394c987758e790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2309-2326 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2151-2166 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2309\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5983e785b4217679dff13f94187465507a33ba51a670d37a078c2204eb501aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:3334-3351 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:3467-3483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:3334\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3334}}}],"partialFingerprints":{"codehealthFindingId/v1":"901cb86e0c4ee6930a6375f302e537f85b4ac0ce416ca6469d21c728519f4549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1749-1766 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1909-1924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb03aa83767a77bd27505c30f9ae256e5941f6fdcaac992da3c651fb83d88d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/extraction/docx/table/mod.rs:298-315 | crates/xberg/src/extraction/docx/table/mod.rs:317-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/table/mod.rs:298\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"297cc798c3d655e1197d3e95517c49de9d8186816ad3c64b84a1acd1e3fe276b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/extraction/docx/table/mod.rs:723-740 | crates/xberg/src/extraction/docx/table/mod.rs:742-759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"301f26a705d4be9fbf22e3c686388b728af6e71544c6536d160acabfe7e73c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/extraction/excel/package_metadata.rs:163-180 | crates/xberg/src/extraction/pptx/metadata.rs:100-117 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/excel/package_metadata.rs\u0060 and \u0060crates/xberg/src/extraction/pptx/metadata.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad85a61acdc2fa4509520a15b3ce0085554d10781e2d858401dcd51b8e2e50eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:1130-1147 | crates/xberg/src/extractors/jats/mod.rs:63-80 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8503120af5de1cb03b3c4fc849d2d4de34813cd8367aacf26725af4694d1728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/extractors/jats/elements.rs:227-244 | crates/xberg/src/extractors/jats/mod.rs:420-437 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/jats/elements.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/jats/elements.rs:227\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadcdaa4f926fafeae6b42bbc29e422889ee7a147d00cee2057f9756a35c8073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/xberg/src/extractors/odp.rs:132-157 | crates/xberg/src/extractors/odt.rs:727-753 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/odp.rs\u0060 and \u0060crates/xberg/src/extractors/odt.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"150d471fefc136686c6ebf9a69d8647f6dadab31506f72f12b3232e6533fdfc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1788-1805 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3249-3266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1788\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21373b00da760dbe677a31feac56b476ca29bd83d4f174a34823d3f08d93565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/mcp/resources.rs:95-112 | crates/xberg/src/mcp/server.rs:408-425 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/resources.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"468accdc856442f5fb0b4213afcdc195dcd074c8cf0b62152c7ceb6701733145"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/xberg/src/ocr/types.rs:269-284 | crates/xberg/src/types/formats.rs:625-642 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/types.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63546287670e48e6ac09b2d5bad5dfdd15f7deadaef450415f51c1bbd612b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 4): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5211-5227 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5760-5771 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5835-5846 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6419-6432 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace942e7af12da004dfc4863c677449967c747a052f2d0012d4e99ee1aef9cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): crates/xberg/src/extractors/docbook.rs:213-229 | crates/xberg/src/extractors/docbook.rs:507-523 | crates/xberg/src/extractors/docbook.rs:828-844 | crates/xberg/src/extractors/docbook.rs:1092-1108 \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 \u0060crates/xberg/src/extractors/docbook.rs:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0990cb47a5925f11261de834ab09a1d93ab72be2eff04cc2adc66b5cb4444e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): crates/xberg-native-pdf/src/document/extract_api.rs:175-190 | crates/xberg-native-pdf/src/document/extract_api.rs:869-885 | crates/xberg-native-pdf/src/document/extract_api.rs:1332-1347 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:175\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg-native-pdf/src/document/extract_api.rs:864\u0060 calls \u0060page_cannot_have_text\u0060, \u0060Ok\u0060 and \u0060crates/xberg-native-pdf/src/document/extract_api.rs:1330\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2070aa47769a65f04f38c9804611d281ae3e34347672a69891e0e1da513c4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1459-1473 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:1081-1097 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1459\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6de8703232fd7c41806ece01add8f70439528efa7ee2e8d5334dbc1deb6ef7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/xberg-native-pdf/src/document/tables.rs:106-126 | crates/xberg-native-pdf/src/document/tables.rs:218-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/tables.rs:106\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"955e258de0784ab78e98b9a8d9ad43715a0fc7704bca4f0d4623f6604f98db07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:2734-2750 | crates/xberg-native-pdf/src/extractors/images.rs:2776-2792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2734}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af15cdfe60438f2a6690e765a218fd65611de26f9de1c5b11654113a70e8249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:210-226 | crates/xberg-native-pdf/src/extractors/text/advance.rs:442-458 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"67102cc95b12b9978990de87e5153652b5d22f96e7d3ac95ce8caf4d4dd42783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:6243-6257 | crates/xberg-native-pdf/src/fonts/font_dict.rs:6307-6323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:6243\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":6243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d043cbc74f59972d88cb3b6a16073ffc9a5fe8a6d9eaa64719bbf289f774f05e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1394-1410 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1494-1509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1394\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c3b2e9f48d2b4eb27f49469b8e1702c8519fc098c4789124176ff7d00b72ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2503-2520 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2722-2738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2503\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b3429b181910f56380170ff0406dee45d48ada262951efd535b97ee734dc76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:4468-4483 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2540-2556 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:4468\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4468}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a482ec62a80a56e70f5352de4b85f3a2597f7ef101880a55e64164589b4ad05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:6137-6151 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6880-6897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:6137\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7fa358dabf588cde7bf2fa2d49e814de0aef58ab557fec38bda2845e0f1cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1532-1548 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1622-1633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1622\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6ef32f58a49a7f40ebd94daab5f7a85ad00ea75a1c314a694b16c01eb4e4c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201334 lines \u00D7 2): crates/xberg-tesseract/src/api.rs:1682-1715 | crates/xberg-tesseract/src/api.rs:1772-1801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-tesseract/src/api.rs:1682\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-tesseract/src/api.rs:1716\u0060 calls \u0060Some\u0060, \u0060push\u0060, \u0060offset\u0060 and \u0060crates/xberg-tesseract/src/api.rs:1802\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b1d994af070dd2a32e652e4660decd96bf37a89f457469826dc42309b31e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/xberg-tesseract/src/page_iterator.rs:135-148 | crates/xberg-tesseract/src/result_iterator.rs:327-343 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/page_iterator.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00ae9f75c657df331c94e844872cfee345baca6a2ea3dcedaf20414ef69395d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:953-969 | crates/xberg/src/core/pipeline/mod.rs:1127-1143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/pipeline/mod.rs:953\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a2a7012c0bd3dd856d903e29853b43669d893b82785b0c3fce5482b43241c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg/src/extraction/archive/tar.rs:110-126 | crates/xberg/src/extraction/archive/tar.rs:197-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/archive/tar.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/archive/tar.rs:215\u0060 calls \u0060header\u0060, \u0060entry_type\u0060, \u0060is_dir\u0060 and \u0060crates/xberg/src/extraction/archive/tar.rs:128\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/tar.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"474d294c41e8b70694fc1c37bb6665cfa5c5e959e1b4a721e545cb81d505e211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg/src/extraction/pptx/container.rs:52-68 | crates/xberg/src/extraction/pptx/container.rs:80-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pptx/container.rs:52\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/container.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d82159daed88ed36465ca30f4fea283c8746d87120de9118909e53f905dcc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/xberg/src/extraction/pptx/container.rs:162-177 | crates/xberg/src/extraction/pptx/parser.rs:922-938 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pptx/container.rs:162\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/container.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f0f32b128b408638f31cafd5e2d399f8940a76362acd8d9e905edc7e1e3fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:10049-10065 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:10162-10175 \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":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":10049}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef1a8bd64bf8cf93ffadd3003906499a6a190d9ef8ded4ea7cc4bf1f215ec4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:265-281 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:542-558 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:265\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 before the matched lines, \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs:541\u0060 calls \u0060handle_line_break\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:264\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ad2a7d12def093a813a3d67f7c90eadf6d048b3fc4be884a61ea2804d49259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 6): crates/xberg-native-pdf/src/fonts/font_dict.rs:3479-3494 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3566-3581 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3653-3668 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3745-3760 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3816-3831 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3882-3897 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:3479\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":3479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ec418b073781a4176f3545c295e6e1612f624c056f81719238ccc556af128e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/xberg-native-pdf/src/content/parser.rs:3362-3377 | crates/xberg-native-pdf/src/content/parser.rs:3415-3430 | crates/xberg-native-pdf/src/content/parser.rs:3473-3488 \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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa755c10f0d31acce8dda0566964b4e588920ceb731c1a81f7efaa1b0569dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1838-1853 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1869-1884 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1981-1996 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1838\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1838}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d5b918da29cbfd90673c91bcea848d3a0dde3fb0fc3466fb3617a108144b7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:383-398 | crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:419-434 | crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:455-470 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:383\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5540fb37504518c93c365cb04676847d8f829c5d07a2abf6ef4f5793de0e817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): crates/xberg-cli/src/commands/overrides/ocr.rs:355-365 | tools/benchmark-harness/src/comparison/extraction_config.rs:620-635 \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 \u0060tools/benchmark-harness/src/comparison/extraction_config.rs:620\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/overrides/ocr.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b85a6ab64b037c2946169af960507bd95cf5d667dcaef5c41eb34e409e74c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg-native-pdf/src/document/tables.rs:75-92 | crates/xberg-native-pdf/src/document/tables.rs:171-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/tables.rs:75\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc68bbf021306a35a9b60900db3eeba295b18a93aa28f4e122a9bba4f9839af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:199-214 | crates/xberg-native-pdf/src/structure/converter.rs:96-111 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs\u0060 and \u0060crates/xberg-native-pdf/src/structure/converter.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/synthetic_structure.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8832efed9648d0a66dbeeda4d43f05953ca4d4c80416ca6b964e83aa2c44f751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/cff_encoding.rs:620-635 | crates/xberg-native-pdf/src/fonts/cff_encoding.rs:713-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":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa9646bb8429a4a165730b08f7765b8fd1e04c8f78ca9911072588ab1bf9a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/xberg-native-pdf/src/parser.rs:364-377 | crates/xberg-native-pdf/src/parser.rs:392-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"916a623064fadeb2e349524d0ee11c3b1735aa265006a8202a33dfd68cb3f8f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/mesh_shading.rs:1168-1182 | crates/xberg-native-pdf/src/rendering/resolution/pipeline.rs:304-319 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/mesh_shading.rs:1168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mesh_shading.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e2a1746bbc55bbdbd40edb92f6d2b50426eb8b991a7f29c6221567d620ece9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201316 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1370-1385 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1476-1485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1370\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bc6b5ccb89c0f0941f066cb56659f5a3f1cd718ad85acf3557774b2bb7a427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/xberg-tesseract/src/api.rs:1295-1310 | crates/xberg-tesseract/src/api.rs:1338-1353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-tesseract/src/api.rs:1295\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fa41a926b1f18dd66c477b73f06ea6d64ef8ff9df0e9809ab0ca0337764aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/xberg/src/extraction/doc/cp1252.rs:5-35 | crates/xberg/src/extraction/ppt/mod.rs:1394-1424 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/doc/cp1252.rs\u0060 and \u0060crates/xberg/src/extraction/ppt/mod.rs\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/cp1252.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6a933c231a56051b5baa1654a0af091e53a6700afd19fd35351aa6735a865c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): crates/xberg/src/extraction/doc/metadata.rs:112-147 | crates/xberg/src/extraction/ppt/mod.rs:1509-1544 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/doc/metadata.rs\u0060 and \u0060crates/xberg/src/extraction/ppt/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/metadata.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46b1c77d8ddf3ab2115c4b75882e4031660545f5d4d955901992494c316b2f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/xberg/src/extraction/docx/drawing.rs:536-551 | crates/xberg/src/extraction/docx/drawing.rs:588-603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/drawing.rs:536\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4cf2b278b46087e6a6076e25e937b3a54851923fa8ca7fef18874fe7d6b27f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/xberg/src/extractors/djot_format/extractor.rs:587-602 | crates/xberg/src/extractors/markdown.rs:878-893 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/djot_format/extractor.rs\u0060 and \u0060crates/xberg/src/extractors/markdown.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/djot_format/extractor.rs:587\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, \u0060crates/xberg/src/extractors/markdown.rs:876\u0060 calls \u0060is_some\u0060 and \u0060crates/xberg/src/extractors/djot_format/extractor.rs:586\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddc0eb2b43b905fb2bf09378550f2ea72690f6978abb8d7c5ea5b875ca782a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:964-991 | crates/xberg/src/extractors/docbook.rs:1272-1299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:964\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8ef8c647262f441a1567e958d2c7dfef3f5c2cc20e7d50ee8d91b35f446018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/xberg/src/extractors/epub/mod.rs:492-507 | crates/xberg/src/extractors/odt.rs:666-681 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/epub/mod.rs:492\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0366b80e74064bdd9942b1669effadb3ac4222fad58e2314137868c8d5f80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/xberg/src/extractors/image.rs:4370-4385 | crates/xberg/src/extractors/image.rs:4393-4406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/image.rs:4370\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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89fe46026ce3fac9cf87093e75c21d738bb75cacb5b528b084f317c0df0af61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/xberg/src/extractors/jats/elements.rs:266-282 | crates/xberg/src/extractors/jats/mod.rs:189-205 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/jats/elements.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/jats/elements.rs:266\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48321e6ba0eaba91166d0b7f5ff9fe882659fda1715e9391b5b1b3ca4bd1952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/xberg/src/extractors/latex/mod.rs:493-508 | crates/xberg/src/extractors/latex/mod.rs:674-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/latex/mod.rs:493\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"9356230a54f10ce438c0ecacd2010f7c6c7f541fecb74b06a961932d71136ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/xberg/src/extractors/pptx.rs:560-575 | crates/xberg/src/extractors/pptx.rs:579-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pptx.rs:560\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pptx.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"869f45f30ac23d12a5fbff6fe300cce1eb7b2932101791fafacaae2f7dcf34c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/xberg/src/late_interaction/mod.rs:367-382 | crates/xberg/src/sparse_embeddings/mod.rs:245-257 \u2014 \u0060crates/xberg/src/late_interaction/mod.rs\u0060 and \u0060crates/xberg/src/sparse_embeddings/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/late_interaction/mod.rs:367\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9577242de4166b0d97621abd96c06b0605811a1b95c0b861bd30ad2227e71f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/xberg/src/pdf/structure/lines.rs:122-137 | tools/benchmark-harness/src/quality/mod.rs:389-407 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/lines.rs:122\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/lines.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda47dbc87d6e0996bef5a86c53d27e6b0788c8f03e927285199528c1ed7de79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/xberg-pdfium-render/src/pdf/document/fonts.rs:316-330 | crates/xberg-pdfium-render/src/pdf/document/fonts.rs:447-461 | crates/xberg-pdfium-render/src/pdf/font.rs:230-244 | crates/xberg-pdfium-render/src/pdf/font.rs:406-420 | crates/xberg-pdfium-render/src/pdfium.rs:388-402 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/fonts.rs:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/fonts.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7abee928eeefe5cfb76ac6e54ed1139697e3835a626c6c642a5bf51acc50d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): crates/xberg-native-pdf/src/document/extract_api.rs:214-227 | crates/xberg-native-pdf/src/document/extract_api.rs:892-906 | crates/xberg-native-pdf/src/document/extract_api.rs:1360-1373 \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":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9045a3fc23d430b9849fa23c43ad3441afa4bf11d4c999b044f02eba67ac5f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 3): crates/xberg-native-pdf/src/fonts/encoding.rs:314-324 | crates/xberg-native-pdf/src/fonts/font_dict.rs:5933-5947 | crates/xberg/src/extractors/rtf/encoding.rs:69-79 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/encoding.rs:314\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/encoding.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b808f7de59233ddd0c3fc44d09d970219c0f2a3eb9f7caf6704ea6487313005d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2099-2113 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2139-2153 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2168-2182 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2099\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"1738ddf4aa046bf6682803b5b91140f3a01f24bf62b82091955149a4ca2567c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/xberg/src/mcp/prompts.rs:43-57 | crates/xberg/src/mcp/prompts.rs:95-109 | crates/xberg/src/mcp/prompts.rs:164-178 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/mcp/prompts.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/prompts.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25abd8f181128d6084114f23cb6a267f31b40d4c0a9ec4ce952738b6b99d01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): crates/xberg/src/rendering/djot.rs:358-371 | crates/xberg/src/rendering/markdown.rs:301-315 | crates/xberg/src/rendering/plain.rs:393-407 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/rendering/djot.rs:358\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 after the matched lines, \u0060crates/xberg/src/rendering/djot.rs:372\u0060 calls \u0060push\u0060 and \u0060crates/xberg/src/rendering/markdown.rs:315\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a41178098c1af4ba6223ca6408d37cd9ecbfede013777cb236aa8c5728f4eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/xberg-native-pdf/src/document/fonts.rs:738-751 | crates/xberg-native-pdf/src/document/fonts.rs:759-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/fonts.rs:738\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"5884e14c2d03f30e5a5eaf92bc59a64bbf9f45478df72e269dbade0468a5e509"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): crates/xberg-native-pdf/src/document/tables.rs:141-150 | crates/xberg-native-pdf/src/document/tables.rs:299-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/tables.rs:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"953d3a6b342bdeee037200972255d5f0ddf9b73d2e2b4d162b0b7ed82b8d5a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:905-919 | crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs:74-88 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs\u0060 and \u0060crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:905\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn flush_tj_span_buffer(\u0026mut\u0060 in one and \u0060super) fn flush_tj_buffer(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d08e73b3102f195d8965c49b76504994c95d905bd435104dcede0c9b311eaa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1283-1297 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1310-1320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6468e0f1efac0d50ee0973c8099b28aea76795f87945eb20dcde68f4e92eec04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201315 lines \u00D7 2): crates/xberg-native-pdf/src/text/word_boundary.rs:159-164 | crates/xberg-native-pdf/src/text/word_boundary.rs:165-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/text/word_boundary.rs:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/word_boundary.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"912a9dd556ec300529e72dd79f5fc2471b894dd177fc1c705f7fa6eb31950b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/annotation.rs:249-263 | crates/xberg-pdfium-render/src/pdf/document/page/annotation.rs:268-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6add0663d2309a3ec2f0cf251e712b3db1a84ac530f2d6af50401c6363040585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extraction/docx/theme.rs:143-157 | crates/xberg/src/extraction/docx/theme.rs:222-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/theme.rs:143\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":"crates/xberg/src/extraction/docx/theme.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"746742808ccbee69444250e303fce489da03e4a98a4ec3a04c6eb39b76ac5bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201315 lines \u00D7 4): crates/xberg/src/extraction/email/msg_props.rs:33-47 | crates/xberg/src/extraction/email/msg_props.rs:77-79 | crates/xberg/src/extraction/email/msg_props.rs:165-179 | crates/xberg/src/extraction/email/msg_props.rs:286-288 \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 \u0060crates/xberg/src/extraction/email/msg_props.rs:33\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, \u0060crates/xberg/src/extraction/email/msg_props.rs:47\u0060 calls \u0060from_le_bytes\u0060 and \u0060crates/xberg/src/extraction/email/msg_props.rs:79\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/msg_props.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c54c4180d51bc1842bbb07eb8f5a58114f3a8b6383b1e609ab8f3b969d7901"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:456-469 | crates/xberg/src/extractors/docbook.rs:766-780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:456\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f705647f61e56c0f92057896b99c51bbd0c564f876a8713af820bbc26e64d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:216-230 | crates/xberg/src/extractors/fictionbook.rs:344-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:216\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, \u0060crates/xberg/src/extractors/fictionbook.rs:343\u0060 calls \u0060check_attr\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs:215\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"996e862691263d5290accf6171c4fdcf53b6a4e08cdef9760bc7ff82e5e21de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2522-2535 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3057-3071 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3057\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"123c8e58a21cbc9a2a234efb26b96da6c83ecff2c8b8a0ec54da06f7980dac6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6360-6374 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6502-6516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6360\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":6360}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c6aae6c32377526d198ffef14af3c252bc60061068e5fa8954554df04bb704"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:244-258 | crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:289-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:244\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"3143ebb329124c5253df9eae103754a4a7e4f42e14127d9e0fd42966ef810fac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/paddle_ocr/model_manager.rs:767-781 | crates/xberg/src/paddle_ocr/model_manager.rs:812-826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/paddle_ocr/model_manager.rs:767\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/model_manager.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dcfc4883d297443a74581069f115a7e06c946e9371bc645ba2b8ececd158ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/xberg/src/pdf/structure/lines.rs:120-134 | tools/benchmark-harness/src/noise_detection/mod.rs:312-324 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/lines.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/lines.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"34941faf6734bfda88d599b2a96239db4786add3973ee95e776c6c3c37fb1f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:4111-4125 | crates/xberg/src/pdf/structure/pipeline.rs:4144-4158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":4111}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b517d4e83f267628026bacdce16e2466dc27f4ca6c7bb1b844c367ad1df820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 16): crates/xberg-native-pdf/src/fonts/font_dict.rs:3479-3492 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3566-3579 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3653-3666 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3745-3758 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3816-3829 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3882-3895 | crates/xberg-native-pdf/src/fonts/font_dict.rs:6286-6299 | crates/xberg-native-pdf/src/fonts/font_dict.rs:6427-6440 | crates/xberg-native-pdf/src/fonts/radical_forms.rs:87-100 | crates/xberg-native-pdf/src/fonts/radical_forms.rs:151-164 | crates/xberg-native-pdf/src/fonts/radical_forms.rs:228-241 | crates/xberg-native-pdf/src/fonts/radical_forms.rs:293-306 | crates/xberg-native-pdf/src/fonts/radical_forms.rs:353-366 | crates/xberg-native-pdf/src/fonts/radical_forms.rs:413-426 | crates/xberg-native-pdf/src/text/kangxi.rs:86-99 | crates/xberg-native-pdf/src/text/kangxi.rs:132-145 \u2014 there are 16 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 16 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":3479}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5da665ddb7fa81d37dd8af64b953234a8bde82a8263905e0229af416681a570"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/xberg-native-pdf/src/fonts/font_dict.rs:3410-3423 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3497-3510 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3584-3597 | crates/xberg-native-pdf/src/fonts/font_dict.rs:3669-3682 \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 \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:3410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":3410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d960cd00ddb56d25d38b4b0667d3d4bd5d55ca007514e253505c1985af81989a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 4): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5266-5276 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5880-5893 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6300-6310 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6812-6823 \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 \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5266\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:6321\u0060 calls \u0060clamp\u0060 and \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5280\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f03dc5ad6b59ccff9659973df1968e7921e7339b19e2f882d77acaad8c9566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): crates/xberg/src/extraction/docx/table/mod.rs:589-602 | crates/xberg/src/extraction/docx/table/mod.rs:614-627 | crates/xberg/src/extraction/docx/table/mod.rs:662-675 | crates/xberg/src/extraction/docx/table/mod.rs:681-694 \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 \u0060crates/xberg/src/extraction/docx/table/mod.rs:589\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"5407f917dc67d1d557a5c47d5f6e232b50cbb75e4f50aeba6be9a37421905398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/xberg-native-pdf/src/document/extract_api.rs:927-940 | crates/xberg-native-pdf/src/document/extract_api.rs:1005-1018 | crates/xberg-native-pdf/src/document/extract_api.rs:1021-1034 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:927\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6740fee268c296451e626fc44a15f4ee18b66b0c7152b5192db56f811bf1d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs:31-44 | crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs:72-85 | crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs:138-151 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs:31\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/content_mark.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d91e132c32b90afd64cf374b43b58972553fd16162f845c5fd159951b94062"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/xberg/src/embeddings/mod.rs:501-514 | crates/xberg/src/late_interaction/mod.rs:413-426 | crates/xberg/src/sparse_embeddings/mod.rs:284-297 \u2014 \u0060crates/xberg/src/late_interaction/mod.rs\u0060 and \u0060crates/xberg/src/sparse_embeddings/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/embeddings/mod.rs:501\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, \u0060crates/xberg/src/embeddings/mod.rs:499\u0060 calls \u0060clone\u0060 and \u0060crates/xberg/src/late_interaction/mod.rs:412\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cdddba0f67aec7c99d2c3608ae38e08736c86c587685daed751923dc00f5da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/xberg/src/extractors/iwork/keynote.rs:163-176 | crates/xberg/src/extractors/iwork/pages.rs:110-123 | crates/xberg/src/extractors/iwork/pages.rs:125-138 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/iwork/keynote.rs\u0060 and \u0060crates/xberg/src/extractors/iwork/pages.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/iwork/pages.rs:140\u0060 calls \u0060dedup_text\u0060 and \u0060crates/xberg/src/extractors/iwork/keynote.rs:178\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b692a1ceece44a190000aecf8c871f2c53bf123fd4b47230f90247a2d4d8faf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs:164-177 | crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs:248-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e345b12924477ae9e180109d9e0e49aee24b1e404fc4424a503e0941d67a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:2589-2602 | crates/xberg-native-pdf/src/content/parser.rs:2610-2623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b8cf54b795ab7477d9e4a4d8e97d1b6eabe61d81e580cd7bf6b29a642faec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg-native-pdf/src/outline.rs:83-96 | crates/xberg-native-pdf/src/outline.rs:131-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/outline.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a0b636cb035cdf8d354d9841a4e9e3c00b7d5f003488f460c82abbce2bf027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:611-624 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:770-782 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0cc3b89e4709dd83b37ec42de5dc8e70b497b6be80569e1bc8baeb5f5b6ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:6096-6109 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6767-6780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6096}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e56314356f7fff76b9d416f475488c7ce09be69199fe57606cedde0faf8b2f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:7887-7899 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:7958-7971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":7887}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbe638ef48bf2047f803773dfc1cb23c1c86528ddaccf3b4cc9cd295d9e23c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:8011-8024 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:8192-8203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8011}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb6196121b85e2d90d409b2bc7688d021c2db70ac1062b90c466b4499d59a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:8033-8046 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:8205-8217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8033}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d47ee36b7c9c0372a81a1f59d79607357d79dfc6fc6c74ca930042feebbf82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:804-816 | crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:834-847 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"292087ad366d8c372b7d47d9977a090a1527b0990486157b3cc2c1c86c5397cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/xberg-native-pdf/src/xref_reconstruction.rs:460-479 | crates/xberg-native-pdf/src/xref_reconstruction.rs:646-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref_reconstruction.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee2b4d8e5d4f49e10347fa0260428f7ec438bf318af777f76e7717d4e82f0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:163-176 | crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs:491-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotations.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e588b70413dbce59b120bacb7c626ea42a9ca7c10a18942daf3850b5b65c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs:181-194 | crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs:227-240 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/group.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e547a28f28a7de8d718f97ed5b93ba8a83c80b412ffe66e4ec26a66a07279dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/chunking/validation.rs:130-143 | crates/xberg/src/chunking/validation.rs:182-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/chunking/validation.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/validation.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"142dc71227978299aa806040228aa04198976ade7818bf6e52a86e2263720876"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:1588-1601 | crates/xberg/src/extractors/pdf/region_vlm.rs:520-533 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/pipeline/mod.rs:1588\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"713224dec42d5db75a40a706f1048943f9e9788fe6160342fc4ea51a48bc4da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/embeddings/mod.rs:760-773 | crates/xberg/src/embeddings/mod.rs:1069-1082 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/embeddings/mod.rs:760\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25c4f5b55711d854c25147a1105c4605902c4c6308d99ad8c703bb8d11e44bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extraction/doc/list_numbers.rs:675-688 | crates/xberg/src/extraction/docx/parser.rs:632-645 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/doc/list_numbers.rs:675\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 \u0060value\u0060 to \u0060u32\u0060 in one and \u0060i64\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"435190c5bc8e89d0342430b645346dbc02d30e193337aaa981acce3aa7065b49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extraction/docx/math/collect.rs:23-36 | crates/xberg/src/extraction/docx/math/elements.rs:870-883 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/docx/math/collect.rs\u0060 and \u0060crates/xberg/src/extraction/docx/math/elements.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/collect.rs:23\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/collect.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"139d1ff5d182fc633c2f8dbffa0547d33d63056c0d57670c16ed08f7002f4862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:1262-1275 | crates/xberg/src/extraction/docx/parser.rs:1280-1293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:1262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f262cfead5951a741ba253caa7c5d23ba2f6393041469ea5767ebad05f1382"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/xberg/src/extraction/email/rtf.rs:236-248 | crates/xberg/src/rendering/markdown.rs:79-92 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/rtf.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79712ef4d1de8e531747830dcf1809f84884918d84a7fe452f3bd7f6ad75385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extractors/djot_format/extractor.rs:429-442 | crates/xberg/src/extractors/djot_format/extractor.rs:461-474 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52d344c472b17518d89bbde8a831330bf5e4b63b4a8b23b644533f8fda85efd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/xberg/src/extractors/epub/mod.rs:628-643 | crates/xberg/src/extractors/html.rs:308-322 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/epub/mod.rs:628\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cb7421ad5f8379415cc430afbb6282ce892ef25f4fb472f31fc4ddd05a636c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): crates/xberg/src/extractors/latex/mod.rs:401-411 | crates/xberg/src/extractors/latex/utilities.rs:491-504 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf23f8c766655f006ecb6c43aab8f857b934d37ee1475cc4d36791b86339675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/xberg/src/extractors/markdown.rs:220-233 | crates/xberg/src/extractors/markdown.rs:587-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/markdown.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e2eb07914cb6a269de4c289c3e9ac803fef57b68f0ef9ac3664ba0631ade49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extractors/odp.rs:389-402 | crates/xberg/src/extractors/odt.rs:650-663 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/odp.rs\u0060 and \u0060crates/xberg/src/extractors/odt.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/odp.rs:389\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb61d2f4d7c854ba96802ca82986b71ab572b73c69a3103638605af34fc3f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2497-2511 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3043-3057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2493\u0060 calls \u0060clone\u0060 and \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3041\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":2497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e062e75fa3ac7caa99f863deb7b2069830a7e79aae50dd1786422837a193d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/scoring.rs:706-719 | crates/xberg/src/extractors/pdf/ocr/scoring.rs:747-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/scoring.rs:706\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f3a5561272a2e74e8ad896d8882bf591c658953b31e42d37764ae72585c76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extractors/pst.rs:55-68 | crates/xberg/src/extractors/pst.rs:172-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pst.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f45964cac5c3b9713a3f1dcce9b00c39f3e9da0c195d20fd8c43545515b828"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extractors/rst.rs:603-616 | crates/xberg/src/extractors/rst.rs:667-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rst.rs:603\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"908e51522db12db9c3e0eec9003af231f2e9e1e663fe00c8e46d7934113b9851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/ocr/shaded_rows.rs:162-175 | crates/xberg/src/ocr/shaded_rows.rs:176-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/shaded_rows.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91ebc0a74df204d21c2ddda1444699d5a7161279c5874c211989c0ceeeaf51f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/pdf/structure/classify.rs:977-990 | crates/xberg/src/pdf/structure/layout_classify.rs:336-349 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/classify.rs\u0060 and \u0060crates/xberg/src/pdf/structure/layout_classify.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/classify.rs:977\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/pdf/structure/classify.rs:976\u0060 calls \u0060infer_section_level\u0060 and \u0060crates/xberg/src/pdf/structure/layout_classify.rs:334\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e0a4d5c7edacfc39216ced0c91527d822e864e7e73323f32487f9bd750a264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/pdf/table_reconstruct.rs:1051-1064 | crates/xberg/src/pdf/table_reconstruct.rs:1168-1181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/table_reconstruct.rs:1051\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed21898e3f59d89fed451f7d9b988d9fce0631c294ddbe2afe15ef2c8208cef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/rendering/common.rs:660-673 | crates/xberg/src/rendering/comrak_bridge.rs:65-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/common.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d179b0b6857676f060c528eaae41491e30fbae38386e5d1460ea43542708ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/xberg/src/reranking/engine.rs:233-253 | crates/xberg/src/sparse_embeddings/engine.rs:96-115 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/reranking/engine.rs:233\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/reranking/engine.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5f90f97c8c64cb54124673b531c56ce76b09108424520e66b64e485f958ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/reranking/mod.rs:741-754 | crates/xberg/src/reranking/mod.rs:885-898 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/reranking/mod.rs:741\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/reranking/mod.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbe3973af346695ae486758696d7b16245217af0c78e915ce6a418449730bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): crates/xberg/src/extractors/docbook.rs:1027-1039 | crates/xberg/src/extractors/docbook.rs:1329-1341 | crates/xberg/src/extractors/docbook.rs:1389-1401 | crates/xberg/src/extractors/fictionbook.rs:1013-1025 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1027\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 before the matched lines, \u0060crates/xberg/src/extractors/docbook.rs:1026\u0060 calls \u0060account_text\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs:1012\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"860b89105ba3d924de0eb283005743ffc60a740c973a5a549e6dc72db033f48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): crates/xberg-native-pdf/src/fonts/cff_encoding.rs:575-587 | crates/xberg-native-pdf/src/fonts/cff_encoding.rs:630-641 | crates/xberg-native-pdf/src/fonts/cff_encoding.rs:721-731 \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":"crates/xberg-native-pdf/src/fonts/cff_encoding.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7d70c4ff34fd1f0dc11c8e0e5fdcf0ff9d960dd3df4bc2e03dd7d63250ce0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs:131-142 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_japan1.rs:80-91 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_korea1.rs:86-98 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a1ea6949e7b25459d55d8d46074ec664c0ed29a92d7170532c3693f0aeaadf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/xberg/src/extractors/markdown.rs:804-815 | crates/xberg/src/extractors/markdown.rs:899-911 | crates/xberg/src/extractors/markdown.rs:922-933 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/markdown.rs:804\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b94c170fbee28e03d5633e79e3e03810cbfb61b88f2777a79cbd5eaaa71206"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs:105-117 | crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs:234-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe5b7aa8beafeca462dcd6420ac85d8dd6eb6d08df43f68abe70b6753a115d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-cli/src/commands/chunk.rs:21-33 | crates/xberg-cli/src/commands/chunk.rs:38-50 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-cli/src/commands/chunk.rs:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/chunk.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee902bc83bdbd6459bc71623a4756b4d3e65f905b4b8b508fa2fb2027aaf3bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:510-522 | crates/xberg-native-pdf/src/content/parser.rs:2125-2137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/content/parser.rs:523\u0060 calls \u0060push_operator_cap_warning\u0060 and \u0060crates/xberg-native-pdf/src/content/parser.rs:2138\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e22b632ba21857bb878326987b4f48e70347c55082cdc49c9f7d0ec26c51fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/document/paths.rs:213-225 | crates/xberg-native-pdf/src/document/paths.rs:738-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec702b01d323eef9a465930329491c7d2b2491de0dd21322576a4d9dc568fcfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/elements/path.rs:71-83 | crates/xberg-native-pdf/src/elements/path.rs:748-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/elements/path.rs:71\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/elements/path.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"952d783a60928de45c548ec5d92db72b62882cf8868fb2823a14df5cbb88d45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:3709-3721 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:3937-3948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:3709\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3709}}}],"partialFingerprints":{"codehealthFindingId/v1":"5671784fd95faababdbcf5bad5c51ff4ecaf8eab4c89a3109197c8ef89b3ed73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5392-5404 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:497-509 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5392\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5392}}}],"partialFingerprints":{"codehealthFindingId/v1":"689110c8b13040510ccb3dd984b5b02f7c3809c331f8786a32abcf6b0a93482a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201313 lines \u00D7 4): crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:223-229 | crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:244-247 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2439-2451 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2462-2465 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:223\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:223\u0060 calls \u0060from_rgba8\u0060 and \u0060crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs:244\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/separation_backend.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"742f53e8666d61a9d8adccd144e0a89c6abc797ab786cadcb97ba2384d45d56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/xberg-native-pdf/src/structure/parser.rs:515-527 | crates/xberg-native-pdf/src/structure/parser.rs:552-561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4925f7df3bab6174b0ddeb5331161b4289ca147ebb1d3e2df0443ab0fe7cd277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:4256-4268 | crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:4274-4286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:4256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":4256}}}],"partialFingerprints":{"codehealthFindingId/v1":"513b7e6884fe19d82a41d4bc84c99eb423ed7173943b3095ad23dfdecc045ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/structure/traversal.rs:342-354 | crates/xberg-native-pdf/src/structure/traversal.rs:421-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/structure/traversal.rs:342\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/traversal.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"975478977407db5844906b5b87260655291b1ea164bc36c4014b01fa85d0871d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/api/handlers.rs:1168-1180 | crates/xberg/src/mcp/server.rs:592-604 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/api/handlers.rs:1168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62d65d6dbace21e915b135dbf507955ee9674d6c38cc7e0b3a6b5d3cd0b0340"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/xberg/src/api/startup.rs:218-228 | crates/xberg/src/api/startup.rs:283-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/api/startup.rs:218\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/startup.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3d91e0c3121f17e7e8721adbb4111a4695ebd6c64f64bf710d155090bc0ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/chunking/yaml_section.rs:95-107 | crates/xberg/src/chunking/yaml_section.rs:112-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/chunking/yaml_section.rs:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/yaml_section.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b49af155f7af66484ebcab3347fb56491b82cf941f51f1829efe380f8d8967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/core/extractor/file.rs:578-590 | crates/xberg/src/core/extractor/file.rs:1028-1040 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/extractor/file.rs:578\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/file.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"975cdb8024349e42ea60d6bf751cc00de52375bcde11a38561651abfe5958227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:824-836 | crates/xberg/src/core/pipeline/mod.rs:1101-1113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"1709b873277e384a51aef3730b8e27b2d63943040aead05a590cda09bae42c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/engine/extract_impl.rs:1031-1043 | crates/xberg/src/engine/extract_impl.rs:1056-1068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/engine/extract_impl.rs:1031\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54c4a163dd802965d626228474995138cb5819bb2b4722c26b91e3f66bec181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/xberg/src/extraction/archive/sevenz.rs:123-135 | crates/xberg/src/extraction/archive/sevenz.rs:202-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 \u0060crates/xberg/src/extraction/archive/sevenz.rs:123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/sevenz.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f4938832004d5a63ee2fddf30b8a135cd062f0ce0043890602c539b5e79b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/xberg/src/extraction/archive/zip.rs:114-126 | crates/xberg/src/extraction/archive/zip.rs:201-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 \u0060crates/xberg/src/extraction/archive/zip.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/archive/zip.rs:213\u0060 calls \u0060is_dir\u0060 and \u0060crates/xberg/src/extraction/archive/zip.rs:128\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/zip.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c1a7e0917cc9c40c79d5ef38c209d39b2167be06a5d81ede00094bea639f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extraction/docx/theme.rs:183-195 | crates/xberg/src/extraction/docx/theme.rs:226-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/theme.rs:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/theme.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc08e899b6b7a59c4705f89136656d0faa07bf892c2805e684a3fc52fd9cc16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extraction/transform/content.rs:426-438 | crates/xberg/src/extraction/transform/mod.rs:279-291 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/transform/content.rs:426\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/content.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5c42e4a393cb0823dd05d8b6adec01a75dfe867d5dca4f418b661f8519e0ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extractors/djot_format/extractor.rs:479-491 | crates/xberg/src/extractors/djot_format/extractor.rs:499-511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/djot_format/extractor.rs:479\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79923395ca32d1338758d7b79a28d6f969571130e3fed32039d99c1951eb88b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/xberg/src/extractors/epub/content.rs:701-713 | crates/xberg/src/utils/xml_utils.rs:232-242 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c8cc9c381e6bd156cdb070b462d95591d521a96aa60765b3328a6bcc7ca384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extractors/epub/mod.rs:248-260 | crates/xberg/src/extractors/epub/mod.rs:458-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2eb8534e5298cba2ba7cd2a019c9702b7f5bfac5bcfe1d9a418ef1f610f56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:144-155 | crates/xberg/src/extractors/jats/parser.rs:124-136 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/parser.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7a6d2dce7accbbc274d98eb1bdfe42148ae20f89cecb9c2f0b25a64eff2405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extractors/jats/mod.rs:282-294 | crates/xberg/src/extractors/jats/mod.rs:384-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/jats/mod.rs:282\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdff6c5171ccef5521c9f55875d1cb0d6474098b743ea66d80043e1909edac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extractors/pdf/mod.rs:3511-3523 | crates/xberg/src/extractors/pdf/mod.rs:4047-4059 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/mod.rs:3511\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b889a434522189b7dac20210dd8e0aac2331bedf79e755a13f8803f37c129f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs:780-792 | crates/xberg/src/extractors/pdf/ocr/hidden_layer/visible_raster.rs:308-320 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/hidden_layer.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4dcc51b779235d11a74e7073f0c6991b95030721ed44c9e21583da1e937582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:5790-5807 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:5812-5829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:5790\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":5790}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a8257e2107b25d30a4a504635a6695515161ee0538cc043ecb35dbbf768a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6009-6020 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6442-6454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":6009}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca03c9facfb4ae7e696273a6711cc356b96cf2a85e68d57f19ad592a48626c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:7300-7312 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:7882-7894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":7300}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd43bbdc589aee1b832937c5a2e2338c1c23f5d5f3c6cb4400bd0a38d1db128b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extractors/pdf/reading_order.rs:525-539 | crates/xberg/src/extractors/pdf/reading_order.rs:576-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/reading_order.rs:525\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/reading_order.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f09e0f4a429925e59dfa2bbbe36bc848c4cbe1b0effd40118321345869364b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extractors/typst.rs:608-620 | crates/xberg/src/extractors/typst.rs:743-755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/typst.rs:608\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c23bacb4f90b90e4479eae38c9ce7e5ec565143635e849100b78d654ccea371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/formula_recognition/mod.rs:152-164 | crates/xberg/src/paddle_ocr/model_manager.rs:498-510 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/formula_recognition/mod.rs:152\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/formula_recognition/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac89d5ac0a77f79a4ea99e106f8882c28fce17286b985bdf50b0447bd173ed7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/layout/models/slanet.rs:439-451 | crates/xberg/src/layout/models/table_classifier.rs:198-210 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c4e78ff8f4323c5c91c8586a3b750c650a9dec828ae351f68575844eeff77a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/ocr/processor/execution.rs:620-632 | crates/xberg/src/ocr/processor/execution.rs:677-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/processor/execution.rs:620\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"129bd4179b5b10845d2d16bb6b80a9f146f730668f1833795114bc5332bd16f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/text/redaction/engine.rs:1026-1038 | crates/xberg/src/text/redaction/engine.rs:1079-1091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/text/redaction/engine.rs:1026\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/engine.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab44db34e12ee9ff4521cddf316be5f27dcb2f87da42fa1dd58066e7409c9176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:210-221 | crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:235-246 | crates/xberg-native-pdf/src/structure/converter.rs:107-118 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs\u0060 and \u0060crates/xberg-native-pdf/src/structure/converter.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:210\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 before the matched lines, \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:209\u0060 calls \u0060bbox\u0060 and \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:234\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/synthetic_structure.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4919bc77e5ab6c4638c3bd64892b323916e62c52971079392052314e29d81b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/text/advance.rs:89-100 | crates/xberg-native-pdf/src/extractors/text/advance.rs:279-290 | crates/xberg-native-pdf/src/extractors/text/advance.rs:521-530 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:89\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:291\u0060 calls \u0060push_letter_widths\u0060, \u0060letter_count_of\u0060 and \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:101\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"929e97c3a1d18a7dd4eb45e14fbebe6c728e56bf55c983231571b5abc5d3e248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/xberg/src/extractors/docx.rs:1487-1498 | crates/xberg/src/extractors/odp.rs:585-596 | crates/xberg/src/extractors/odt.rs:1992-2003 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/odp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docx.rs:1487\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e62b53606068efae9b86ded858fc32e433f6d31364f53a13ced5c149830f1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/xberg/src/pdf/structure/lines.rs:121-135 | tools/benchmark-harness/src/noise_detection/mod.rs:313-324 | tools/benchmark-harness/src/quality/mod.rs:388-405 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/lines.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/lines.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b953e7ed618a81bc162eecaf7f7988adb393928054fbe0d2e033ddb449dc09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/xberg-gliner/src/decode.rs:209-220 | crates/xberg-gliner/src/v2/decode.rs:36-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-gliner/src/decode.rs:209\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/decode.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84451f707864a923adad8cfaa3f0acefc7a255ca089d680c155014074ff5068"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-gliner/src/session.rs:46-57 | crates/xberg-paddle-ocr/src/inference/ort_backend.rs:69-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/session.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5c73be95d291b3814a2266f79efd05246de3f04ec534388b9d537cbe112d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/xberg-native-pdf/src/document/extract_api.rs:1326-1336 | crates/xberg-native-pdf/src/document/paths.rs:103-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:1326\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff588bb36366341f468ebadb968021eea2d3dfb04a3ee2f2251861dd89af17c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/ccitt_bilevel.rs:237-248 | crates/xberg-native-pdf/src/extractors/ccitt_bilevel.rs:254-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/ccitt_bilevel.rs:237\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/ccitt_bilevel.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1766f1343a79e74381edd78602249132396cc204cdcd578cfdc736dd8144d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:2356-2367 | crates/xberg-native-pdf/src/extractors/images.rs:2401-2412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/images.rs:2356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84a67783ae1a8c1ed08ad74bffe139903e741e259f10a91458ae260d4bfbc70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:2894-2905 | crates/xberg-native-pdf/src/extractors/images.rs:2944-2952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/images.rs:2894\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"032d6974714667dc2fa268d5c94319b386c0459817cdb317f7cf80b7be9ef9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/redaction/text_engine.rs:313-324 | crates/xberg-native-pdf/src/redaction/text_engine.rs:327-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/redaction/text_engine.rs:327\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/text_engine.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95370a763fa5328ace93e9fa8350d618a6dec861526e66d56a13c829ee9fe05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2601-2612 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2069-2080 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2601\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2601}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb166b010dfcc0e91d24be723547b974a067561929e605931ca760541d1de166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:3263-3274 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:3381-3392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3901e46b40696acadf23cbc3915aee1b4046e1b6b97646b6c4f5e852f70c9d30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/structure/traversal.rs:319-330 | crates/xberg-native-pdf/src/structure/traversal.rs:450-461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/structure/traversal.rs:319\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/traversal.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f817d081c1de7d021d453398abcd97c6ab0f81670600ce8db52c4828a0b54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-pdfium-render/src/font_provider.rs:135-146 | crates/xberg-pdfium-render/src/font_provider.rs:197-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/font_provider.rs:135\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/font_provider.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a905104fbb2a00b71af26c9c9469c4c33c0075b7fe7bcd63dc80660a3276fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:368-379 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:430-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:368\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"698c67d58890bfa661133668b8d874131812d2bdc3775c2dba6acd35ad68c156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:395-406 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:457-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:395\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78f42b7de62ba0af5fdefbd48934f010075c635f610ed4738fdfadd567a84fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/cache/core.rs:299-310 | crates/xberg/src/ocr/cache.rs:244-255 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/cache/core.rs:299\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, \u0060crates/xberg/src/cache/core.rs:297\u0060 calls \u0060current\u0060, \u0060record\u0060 and \u0060crates/xberg/src/ocr/cache.rs:243\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cache/core.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67d1fe917c91f950eaf340ac08f9fecc0e63cdc43230602fb6c027a0d07e34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/core/extractor/file.rs:550-561 | crates/xberg/src/core/extractor/file.rs:1002-1013 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/extractor/file.rs:550\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/file.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bf5a13de5f20f288cdad9be06c1ef4bb7b512c0786046234ee3a85b48fa72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:577-588 | crates/xberg/src/core/pipeline/mod.rs:1008-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3b81429b79d4ea09ffa9fb88753bf02af87812f692c192f9cd1c5eac1a2964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:1672-1683 | crates/xberg/src/core/pipeline/mod.rs:1734-1745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/pipeline/mod.rs:1672\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd68d0bce0ffef287972a89926ffcbac3bafb60e1a65e90e0b35634fb92f7ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/xberg/src/embeddings/mod.rs:800-811 | crates/xberg/src/embeddings/mod.rs:1101-1111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/embeddings/mod.rs:800\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1d94a8b5268cd7a7728859453d6472be24970e1dc6fe5cb341a9189ecf410e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/engine/extract_impl.rs:165-176 | crates/xberg/src/engine/extract_impl.rs:397-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/engine/extract_impl.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca619d3b4264384bedec3ce9557a60d632e1e87d427b105e4c94273a47635f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extraction/archive/sevenz.rs:94-106 | crates/xberg/src/extraction/archive/sevenz.rs:178-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":"crates/xberg/src/extraction/archive/sevenz.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"db257641092606e693fe746ca7177b1368ea67edb5645cc2b0078a9f02055b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extraction/derive/mod.rs:196-207 | crates/xberg/src/extraction/derive/mod.rs:304-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/derive/mod.rs:196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbef805d4776a9ba920e62ae29afa458df412741a94a6eb052c17b034f392cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:3572-3583 | crates/xberg/src/extraction/docx/parser.rs:3734-3745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:3572\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"776f36d18e8ea2ab9af6c36a8b5630995ace2fd7d804ca2a0c4cc4fb5fdddaf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extraction/pptx/parser.rs:141-152 | crates/xberg/src/extraction/pptx/parser.rs:621-632 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pptx/parser.rs:141\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"e849bbbc5fbe8a9dea3245c7d8f534235f121f1457cc9139538507511c8eed91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extractors/docx.rs:665-676 | crates/xberg/src/extractors/odt.rs:1447-1458 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/odt.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 145 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf95aa1aa5d025d6695509153813ed54b17ddfc2889f47ef29dc591b8df8835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:429-440 | crates/xberg/src/extractors/jats/mod.rs:512-522 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:429\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ce0608a9bb5bdf63ac95a35096d454e87a5752bec9443b69a8f0f5a5cda5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/xberg/src/extractors/latex/mod.rs:525-536 | crates/xberg/src/extractors/latex/mod.rs:549-559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/latex/mod.rs:525\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dd8088c116951f3c805f133c60c19dbe2314a91c3e9b8139fb745aa7de5482"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extractors/orgmode.rs:538-549 | crates/xberg/src/extractors/orgmode.rs:581-592 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/orgmode.rs:538\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9927d10c334ac9b0762b7d83ad33fcb0d2f55f854159ee894b24d1ea0752d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 3): crates/xberg/src/extractors/pdf/mod.rs:1589-1592 | crates/xberg/src/extractors/pdf/mod.rs:1644-1655 | crates/xberg/src/extractors/pdf/mod.rs:1738-1749 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/extractors/pdf/mod.rs:1644\u0060 calls \u0060numeric_repair_enabled\u0060 and \u0060crates/xberg/src/extractors/pdf/mod.rs:1588\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"049ee31f74a68f89e1e9c9543c53df645ecc7471c915cafc6588199bf16c742a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extractors/pdf/mod.rs:2412-2423 | crates/xberg/src/extractors/pdf/mod.rs:2442-2453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/mod.rs:2412\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb02ffde286d158af579e93164b30216e83babaa5629360719e12f6bc78fd478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1825-1836 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3315-3326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39985943dae0ef8926cf1002be9491c38ee69b063b65813bd69cec20236aa90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/rendering.rs:1005-1019 | crates/xberg/src/extractors/pdf/ocr/rendering.rs:1134-1145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/rendering.rs:1005\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cce0100ff7642d3d19a81a5a0af69d1d361035cf2bccf4915954a2861c1730e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extractors/pst.rs:71-82 | crates/xberg/src/extractors/pst.rs:188-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pst.rs:71\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pst.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"77be70866c23b2fc1177699b8ca07444306c7aa9645a2d8277cd8f6ddffde116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/mod.rs:123-134 | crates/xberg/src/extractors/rtf/parser/mod.rs:185-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/mod.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d19c809d8f5bc54c395be5348c37ad6e3851a1468c955518f8c2d4913cd536b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/layout/models/rtdetr.rs:143-154 | crates/xberg/src/layout/models/rtdetr.rs:406-417 \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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060crate) fn run_batch_inference( \u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/rtdetr.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc95cd5d70192c7ccb51da161ad885391d7974962f67af4b538e8518063e6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/layout/types.rs:130-141 | crates/xberg/src/layout/types.rs:157-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/layout/types.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/types.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75c332a76de5e3058e364c51cc66875f947552c9b5d8158a89e8b5255a62e74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/mcp/resources.rs:109-120 | crates/xberg/src/mcp/server.rs:430-441 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/mcp/resources.rs:109\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/resources.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2742bbd59718dedfb6ef5b899a42bbe89cf946febaa15616599ebbd0e409e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/pdf/structure/classify.rs:401-412 | crates/xberg/src/pdf/structure/classify.rs:419-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/classify.rs:401\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8110a6d85ae37efbf125a7f95577510f77058164d6e249c2b3976285f8edabc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:261-271 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:378-388 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:704-714 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:885-895 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"592400f83ec747f1a061ac87e1d0ca5358b346352811e94b7304fd05b03be151"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/xberg/src/extractors/djot_format/extractor.rs:480-490 | crates/xberg/src/extractors/djot_format/extractor.rs:500-510 | crates/xberg/src/extractors/djot_format/extractor.rs:687-696 | crates/xberg/src/extractors/djot_format/extractor.rs:711-720 \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 \u0060crates/xberg/src/extractors/djot_format/extractor.rs:480\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 after the matched lines, \u0060crates/xberg/src/extractors/djot_format/extractor.rs:696\u0060 calls \u0060push\u0060 and \u0060crates/xberg/src/extractors/djot_format/extractor.rs:490\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9af1c717c367ca637add3361107edd323c854dde29e508d017969bb38c7d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/xberg/src/extraction/archive/zip.rs:32-42 | crates/xberg/src/extraction/archive/zip.rs:100-110 | crates/xberg/src/extraction/archive/zip.rs:188-198 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/zip.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8730bb21eb57fed884d29d579140e1d0fbfdba03c4457afb6c85401386b517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/xberg/src/extraction/structured.rs:258-268 | crates/xberg/src/extraction/structured.rs:477-487 | crates/xberg/src/extraction/structured.rs:589-599 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/structured.rs:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/structured.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"235810b7bd2fdc4c21fdb5a314216ead87dc7f2c8358dbfa642561f89b22f883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/xberg/src/extractors/fictionbook.rs:323-333 | crates/xberg/src/extractors/fictionbook.rs:620-630 | crates/xberg/src/extractors/fictionbook.rs:1008-1018 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e81d87dd74b34b253795390f2c65c19e2de02dd87f9426795983cb73f9625f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/xberg/src/extractors/pdf/mod.rs:3279-3289 | crates/xberg/src/extractors/pdf/mod.rs:3399-3409 | crates/xberg/src/extractors/pdf/mod.rs:3489-3499 \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":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":3279}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bb76e66c4ce41cb65650848d38d9e76ce7a0725e2fea6fdf25928a8988beb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/xberg/src/extractors/rtf/parser/text_extract.rs:404-414 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:589-599 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:627-637 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs:404\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/text_extract.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5404a88569ad5881796c3b9862ddc55dc64c7c9dbd52c81bc12fe8b89edd83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:4068-4078 | crates/xberg-native-pdf/src/content/parser.rs:4085-4095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":4068}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b20cd0ac06b83a20f6f33e6f6b3617312650d8bc792288b575d32e6b3373b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): crates/xberg-native-pdf/src/decoders/ccitt.rs:104-125 | crates/xberg-native-pdf/src/decoders/ccitt.rs:188-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/decoders/ccitt.rs:104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"50221b7251c637e2d6a816f287dac64b13c5868c5214c705b67897b5bdd9f035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-native-pdf/src/document/fonts.rs:856-866 | crates/xberg-native-pdf/src/extractors/text/marked_content.rs:707-717 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"258e5df8fc0165b9d56ec54ed553a53cb6d7fe2e76235c0e30ee986223873e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-native-pdf/src/document/paths.rs:152-162 | crates/xberg-native-pdf/src/document/paths.rs:677-687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/paths.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca445e5d18d755fd6ed3e01f0a18d7d3337a531c164a78ff42be9885d33e213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/document/paths.rs:233-244 | crates/xberg-native-pdf/src/document/paths.rs:754-765 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"33382800f2fcec6fe1731283c9a85fb7beb8107c9cfcb0cad28a772d7f12082b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:652-662 | crates/xberg-native-pdf/src/extractors/text/clustering.rs:123-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:652\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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn insert_space_as_span(\u0026mut\u0060 in one and \u0060super) fn cluster_to_span(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbf2f1a09b97f401be4f7d9ff338bf557c09f504306506b0a5d92567e186b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs:100-110 | crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs:330-340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"59207b983d32bad3c9bcc5e0da0bc862e4ae082aceb375af3ab225b4f284eaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 3): crates/xberg-native-pdf/src/redaction/text_engine.rs:392-394 | crates/xberg-native-pdf/src/redaction/text_engine.rs:410-420 | crates/xberg-native-pdf/src/redaction/text_engine.rs:440-450 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/redaction/text_engine.rs:420\u0060 calls \u0060current\u0060, \u0060show_string\u0060 and \u0060crates/xberg-native-pdf/src/redaction/text_engine.rs:394\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/text_engine.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecf4ae987abc2081e1bc251a9fb4814fbf6c3dd2be9ff19e584a2634d8db9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2159-2169 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2128-2137 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bec7ca09de1f241c812a9baa04c63c1ce67be3c245eb68280a5ed3aa9dc18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/xberg-native-pdf/src/xfa/parser.rs:509-519 | crates/xberg-native-pdf/src/xfa/parser.rs:524-533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/xfa/parser.rs:509\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xfa/parser.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddaca4affe7afb6f89e268dc776e8948c25a142f0f15fa790f2cf96e91997181"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-paddle-ocr/src/inference/ort_backend.rs:148-158 | crates/xberg-paddle-ocr/src/inference/tract_backend.rs:118-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-paddle-ocr/src/inference/ort_backend.rs:148\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 \u0060input\u0060 to \u0060Tensor) -\u003E (Vec\u003Ci64\u003E\u0060 in one and \u0060Tensor) -\u003E (Vec\u003Cusize\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/inference/ort_backend.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0445438b9673c83f32c114eb7bc32530a7d1fd7ceeea74271d50ffb1c2efabaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-pdfium-render/src/font_provider.rs:152-162 | crates/xberg-pdfium-render/src/font_provider.rs:167-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/font_provider.rs:152\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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/font_provider.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcb1eb40e8a257164f3358b1f3973bdccbe3e14bcfd92facb05218b44577379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/paragraph.rs:548-557 | crates/xberg-pdfium-render/src/pdf/document/page/paragraph.rs:559-569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/paragraph.rs:559\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/paragraph.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"d700c11b7b347e473426c0d6898c052c636a63bbebeba7d6a798ed00f8085853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/api/startup.rs:16-26 | crates/xberg/src/mcp/server.rs:1125-1135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/api/startup.rs:16\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/startup.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7cf6bb7f38fb695b8e83c02da8aac6a219baa541dea6160472b69e9fc38f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/chunking/text_splitter/splitter.rs:71-81 | crates/xberg/src/chunking/text_splitter/splitter/markdown.rs:210-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/chunking/text_splitter/splitter.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":"crates/xberg/src/chunking/text_splitter/splitter.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"05063293faad723013e8a96c6fb61ad51baca8b85e9bc1346f68fb4ce9848e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/embeddings/engine.rs:186-196 | crates/xberg/src/embeddings/engine.rs:226-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/engine.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4bce0292eeb540d39914496d7cfc7784c5a055777bcb851cfbd11778b86f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:1170-1180 | crates/xberg/src/extraction/docx/parser.rs:1185-1195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:1170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d959b5988f1b4e0415e6ccda7829c707252b700993c87bad5f8553f28a9a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:3475-3485 | crates/xberg/src/extraction/docx/parser.rs:3631-3641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3475}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f7ecce9d3417831dc47b9a7b444bca268f89b3620af739710960581ddfef7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extraction/docx/theme.rs:147-157 | crates/xberg/src/extraction/docx/theme.rs:250-260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/theme.rs:147\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/theme.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d3a04600e7648a715de95eb997dac02f7a54d5596137528cbe426f84c2759a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extraction/excel/package_metadata.rs:194-204 | crates/xberg/src/extraction/pptx/metadata.rs:124-134 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/excel/package_metadata.rs\u0060 and \u0060crates/xberg/src/extraction/pptx/metadata.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/package_metadata.rs:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacf4e7f22ab73cb5ef7a43701f511cf74d73e52e922d63d49363c232ec37918"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/xberg/src/extractors/docx.rs:832-841 | crates/xberg/src/extractors/wordperfect.rs:668-678 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/wordperfect.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 \u0060crates/xberg/src/extractors/wordperfect.rs:668\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, \u0060crates/xberg/src/extractors/docx.rs:831\u0060 calls \u0060is_mergeable\u0060 and \u0060crates/xberg/src/extractors/wordperfect.rs:667\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e4f96f8cf6b38e5f6daee5a76084112b15d57a18516a05b6bb5284c2e936f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:110-120 | crates/xberg/src/extractors/jats/parser.rs:86-96 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/parser.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:110\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"123edf62e01a0e07403395fc751e1f3ac43b8a7fcdac6f478dd9f90ddd39f86c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/xberg/src/extractors/jats/elements.rs:19-28 | crates/xberg/src/extractors/jats/elements.rs:35-45 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a455d483843aa58b9f44dbf701800be4ac669f9e33295398a7dccaf378727520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extractors/jupyter.rs:737-747 | crates/xberg/src/extractors/jupyter.rs:779-789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/jupyter.rs:737\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"447cceaa0d36ea4e794cfe0e317cce608c40d213f30a80970dae68f0acd1f5a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:168-178 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:216-226 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:179\u0060 calls \u0060default\u0060, \u0060close_span\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs:227\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"79518147bca6254e94e412be37de7b7ca11c0ee627cad44852333e0578b00128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/image/dpi.rs:32-42 | crates/xberg/src/image/dpi.rs:67-77 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/image/dpi.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09bcb39f552d0a371a24da531ddaed6e6e1b75d1bba0a88b888b90bd9791317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/reranking/mod.rs:776-786 | crates/xberg/src/reranking/mod.rs:909-919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/reranking/mod.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":"crates/xberg/src/reranking/mod.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a564b8173c6d078ed332388a8749a9b3d5626a90e79138b3fca78d4aa9ee6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 7): crates/xberg/src/pdf/structure/classify.rs:134-141 | crates/xberg/src/pdf/structure/classify.rs:283-290 | crates/xberg/src/pdf/structure/classify.rs:381-388 | crates/xberg/src/pdf/structure/classify.rs:613-620 | crates/xberg/src/pdf/structure/layout_classify.rs:297-306 | crates/xberg/src/pdf/structure/layout_classify.rs:410-417 | crates/xberg/src/pdf/structure/pipeline.rs:204-211 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/classify.rs\u0060 and \u0060crates/xberg/src/pdf/structure/layout_classify.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/classify.rs:134\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fd59d954d10b8479d96cdcbd7164cc1793b4ff58d9337aedc74b58683a1536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:199-208 | crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:225-234 | crates/xberg-native-pdf/src/structure/converter.rs:96-105 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs\u0060 and \u0060crates/xberg-native-pdf/src/structure/converter.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:199\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:209\u0060 calls \u0060bbox\u0060 and \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:235\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/synthetic_structure.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6191dfb27eb42ba09980e9c08cec2853108bc2e754785ce72f47b71b6862c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1538-1545 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1596-1605 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1623-1630 \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":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd46517bc94fd2c1753b7f1e21677f59d1dd88ee85678f0370017ff6cb365c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:265-273 | crates/xberg/src/extractors/jats/elements.rs:38-47 | crates/xberg/src/extractors/jats/mod.rs:237-245 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32fde50f7a472b791d0e4b9471eb0cf4fbdf820ffa9c490dace68d57e1ae127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/xberg/src/extractors/rtf/parser/mod.rs:124-133 | crates/xberg/src/extractors/rtf/parser/mod.rs:186-195 | crates/xberg/src/extractors/rtf/parser/mod.rs:208-217 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rtf/parser/mod.rs:124\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd4982d0538c7a493aeb47a89b99bea1afc50e9922130ed606fc35f8158602c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/xberg/src/text/redaction/patterns/email.rs:22-31 | crates/xberg/src/text/redaction/patterns/postal_code.rs:51-60 | crates/xberg/src/text/redaction/patterns/swift_bic.rs:25-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/text/redaction/patterns/email.rs:22\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/patterns/email.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf22c81791adc66c1e2cf84cf156903df34d1eda4efb1336af8b1a0dc8407861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201310 lines \u00D7 3): crates/xberg-candle-ocr/src/download_guard.rs:176-185 | crates/xberg/src/layout/model_manager.rs:42-45 | crates/xberg/src/model_download.rs:489-498 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/download_guard.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0f3f6546ae79117636a3b906f9180f2df4aeea2376b329e43da2c3fe8e0c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:721-730 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:786-795 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"29246c69036092ecd836bd1fe32c8a56aaa40297b680a05a48a1088bfff4bad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/annotations.rs:297-306 | crates/xberg-native-pdf/src/annotations.rs:328-337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/annotations.rs:297\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/annotations.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bf4f8d0e396aba8b02b640aa14e6ed38964836275a7aeb03e0c68016c4ed46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:1219-1228 | crates/xberg-native-pdf/src/content/parser.rs:3436-3445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:1219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3825878516fe6782b2c2bfa8509928c9ec210086933a7c38c581ae23fc84c7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/document/picture_text.rs:90-99 | crates/xberg-native-pdf/src/document/tables/body_paint.rs:289-298 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/picture_text.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/picture_text.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c3063fe7df8c91cecc279b29db77629f02373560c329d935f3180ea8c3af37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:4592-4601 | crates/xberg-native-pdf/src/extractors/images.rs:4685-4694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/images.rs:4592\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":4592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6f25e84235b2e0c2e0e44c3c2cb5087db462e6491502a634dd39dd61b4dcce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:876-888 | crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs:141-153 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs\u0060 and \u0060crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1403a03a9364a46c5b4f0e156548f21ae18714957e6bc74f6ce63fa04d4f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/xberg-native-pdf/src/optional_content.rs:170-178 | crates/xberg-native-pdf/src/structure/parser.rs:112-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/optional_content.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/optional_content.rs:179\u0060 calls \u0060from_utf8\u0060, \u0060to_vec\u0060, \u0060unwrap_or_else\u0060 and \u0060crates/xberg-native-pdf/src/structure/parser.rs:122\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/optional_content.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7a455cc1922590f2fe166bf6054445ded68f1d97747f7a7d065c4b265a0950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1417-1426 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1527-1536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1417\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"a365230f34964824c52785f278228c878be1f09a053654ddd88c0b68be33aae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:3768-3777 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:4304-4309 \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":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3768}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bf274625e3bad94a70a1133709308ffdf94cf9e55e02166ce961e8be28fcf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/resolution/color.rs:300-309 | crates/xberg-native-pdf/src/rendering/resolution/color.rs:347-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/resolution/color.rs:300\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aeac8e103dabc8bd977ffbb7ea8840f61b78a1a96bd420a4383326e3b5c7721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1800-1809 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1966-1975 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1800\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"9079d43234c28ea80ed5993a7bee34e374dbc7fef75cf4fd815d91030cd49d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:3596-3603 | crates/xberg-native-pdf/src/structure/table_extractor.rs:888-897 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:3596\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3596}}}],"partialFingerprints":{"codehealthFindingId/v1":"716a52cedbd57fe90a901c0c49c3673a784605d82cafc9ed119131a55002f9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-pdfium-render/src/bindings/dynamic_bindings.rs:23-32 | crates/xberg-pdfium-render/src/bindings/static_bindings.rs:21-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings/dynamic_bindings.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a852d2fcbf46923fba66ae32081798f05db61b983c8309e8c6e9864bcd04bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/annotation/objects.rs:82-91 | crates/xberg-pdfium-render/src/pdf/document/page/objects.rs:150-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/objects.rs:82\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/objects.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f561353e39ee5d7840c038ef5105324b003efd31bea61b959909374468800ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs:222-231 | crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs:267-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs:222\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8740b9af9e2e8917670bef2a48d5653d76dbe3d6a5aa0947255a31d569044d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/font.rs:282-291 | crates/xberg-pdfium-render/src/pdf/font.rs:458-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/font.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"401216a238f2d7948c5b0ce8ffba6bbc3738de3bdbb4ca9d56f0a6aefcad5629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-pdfium-render/src/utils.rs:35-44 | crates/xberg-pdfium-render/src/utils.rs:74-83 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/utils.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa5eb0c73b154197067a06c2f3ad8e64d8052a3b5638e1d7739840530a33086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-tesseract/src/leptonica.rs:258-267 | crates/xberg-tesseract/src/leptonica.rs:313-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-tesseract/src/leptonica.rs:258\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg-tesseract/src/leptonica.rs:257\u0060 calls \u0060and_then\u0060, \u0060checked_mul\u0060 and \u0060crates/xberg-tesseract/src/leptonica.rs:312\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/leptonica.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1ab9a6a87938aa0a6ecb0ab006eaea670214a0c831f051c55b3dc4ab71693f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/core/image_encode.rs:290-299 | crates/xberg/src/core/image_encode.rs:330-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/image_encode.rs:290\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/image_encode.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c962340cfcfa39de42941c71ec6b6a65d6806f6dbd23c026e49dd22b4cd16f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:717-730 | crates/xberg/src/core/pipeline/mod.rs:1034-1047 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2312a8cdcf9c1780200f27bd6b9d6b72b0d537fb2c322c450e4d2410e88a7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/core/split.rs:167-176 | tools/benchmark-harness/src/split_benchmark.rs:162-171 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/split.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/split.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dca27950cc2c175ef9a34d5eba5d1aef29714676cd08ca2bcab0ec28d5d54f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/doc/mod.rs:975-984 | crates/xberg/src/extraction/ppt/mod.rs:1428-1437 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/mod.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc5b0fc7699b2299cb183ea2d72259316ceec699254cbf4d3d129d02da428d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/html/structure.rs:452-461 | crates/xberg/src/extraction/html/structure/tag_handlers.rs:459-468 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/html/structure.rs:452\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec31f89f8780dc148cdecf8dbf4d49fde57a81c6e30bda0cc68c12054072421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/image.rs:171-180 | crates/xberg/src/extraction/image.rs:268-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/image.rs:171\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b05b4d1c6dbe485af2c684504a1f3c178c3c2b98f4ec6df6152a8cf0d2ee00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/pptx/elements.rs:400-409 | crates/xberg/src/extraction/pptx/elements.rs:473-482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/elements.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2891e1ac846792714a97dfcb4ade33da88927d905bbf38f487ab01c9a22ec7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/csv.rs:539-548 | crates/xberg/src/pdf/structure/regions/table_recognition.rs:1254-1263 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/csv.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec8865c38958d3e38163c862dcae3a27b366f8b3e0d5f95277de7c970a1f851"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/djot_format/extractor.rs:43-52 | crates/xberg/src/extractors/markdown.rs:159-168 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/djot_format/extractor.rs\u0060 and \u0060crates/xberg/src/extractors/markdown.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaddba18e36d780fd084ddd7070237e136b9986bdea25901bf6dead9504a48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:283-301 | crates/xberg/src/extractors/docbook.rs:564-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa41d66c0f9b372c5c036ed22fa56a80d7609ac6fb818cd1f2cb054be47bd4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:1335-1344 | crates/xberg/src/extractors/jats/mod.rs:199-208 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1335\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93a66da22bcf1bbd86c6854634bf09ee6527485d70a97a3663cdb1813ba414e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/epub/mod.rs:474-483 | crates/xberg/src/extractors/odt.rs:649-658 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/epub/mod.rs:474\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"893b5793af57207764792f5217efbf146fc293d14e9dc5fd6a679f618933ce62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:990-999 | crates/xberg/src/extractors/jats/elements.rs:245-254 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/elements.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:990\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba1802ecd56fd886b38a75a4c65fbd040ad47a66d2925a587c99cd5c19ba08c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/xberg/src/extractors/image.rs:4347-4355 | crates/xberg/src/extractors/image.rs:4412-4421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/image.rs:4347\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":4347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f712e984a6043254e5c341d3fd63b2bf4564010d0d43971de3cddf48ee8ae841"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/latex/mod.rs:586-595 | crates/xberg/src/extractors/latex/mod.rs:699-708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/latex/mod.rs:586\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c9b652088726954821b9ea1112abceec9563f084f20981da05e0a8dab9233e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/latex/mod.rs:1203-1212 | crates/xberg/src/extractors/rst.rs:1647-1656 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/latex/mod.rs:1203\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, \u0060crates/xberg/src/extractors/latex/mod.rs:1201\u0060 calls \u0060replace\u0060 and \u0060crates/xberg/src/extractors/rst.rs:1645\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"105f9e3e091d26165546b082881011cc1514f6170229192c4148109470d1328f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/odt.rs:1432-1441 | crates/xberg/src/extractors/odt.rs:1504-1513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"449e3d9239dcab7cf78c876eae840dcd4afa5ae7cc6839c3de61cc6a50a00526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/orgmode.rs:198-207 | crates/xberg/src/extractors/rst.rs:552-561 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/orgmode.rs:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060raw\u0060 to \u0060\u0026str) -\u003E (String\u0060 in one and \u0060\u0026str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5814d8405784235b2d46e41da953cc8188ee1b4cf9e353b2faeb3830fe418c35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/orgmode.rs:495-504 | crates/xberg/src/extractors/orgmode.rs:1005-1014 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/orgmode.rs:495\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/extractors/orgmode.rs:1004\u0060 calls \u0060is_structural_start\u0060 and \u0060crates/xberg/src/extractors/orgmode.rs:493\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a69387ade3568c74063236eca49c77d790808eac22327d0330f994f815207f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3000-3009 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3147-3155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3000\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":3000}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b14118981439d14380b757d1aec8f1a52775be8f1be4af93171bd14ba90e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:9098-9107 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:9140-9149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:9098\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":9098}}}],"partialFingerprints":{"codehealthFindingId/v1":"9434af061d74208ead991e973854b38be5211993640e10697286c8730dfde5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extractors/pdf/reading_order.rs:424-437 | crates/xberg/src/extractors/pdf/reading_order.rs:463-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/reading_order.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cabeee1ee787c582ac343f0944374d6875dad1c72fb7415fb7b383f341972b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extractors/pst.rs:150-160 | crates/xberg/src/extractors/pst.rs:202-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pst.rs:150\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pst.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fea76ea7e102a920172465382ce0b9844ff953ddc247179bf6506d5a24dfad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:491-500 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:857-866 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"44594d2755169ce69f904b069d509bf58949e9c6c23efd62303b293e170ebcd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/xberg/src/extractors/typst.rs:823-832 | crates/xberg/src/extractors/typst.rs:837-846 | crates/xberg/src/extractors/typst.rs:849-856 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/typst.rs:823\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c24031a22c0d29ffa48f2fc3d2bc229112057555779313e8cff8f96f62a73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/formula_recognition/mod.rs:137-146 | crates/xberg/src/paddle_ocr/model_manager.rs:483-492 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/formula_recognition/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ac09794016a8af5210a8b4ad1df278ceee8c8d09e91ed1e508914d06f2b508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/mcp/server.rs:181-190 | crates/xberg/src/mcp/server.rs:210-219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c018ac9f6818a6a0e631a117aeb9d2ec2e25f31ad0f3f298d29482d137dff7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/pdf/native/hierarchy/script_evidence/decimal_power.rs:265-274 | crates/xberg/src/pdf/native/hierarchy/script_evidence/decimal_power.rs:330-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy/script_evidence/decimal_power.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"75707f6e1b0ccdae5fde12999355c0dd35653cd2856365c5377d2cfa2a8df9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/pdf/structure/adapters.rs:1698-1707 | crates/xberg/src/pdf/structure/pipeline.rs:1382-1391 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/adapters.rs\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/adapters.rs:1698\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9995c52da3c282f071500f2c075fcd94c922a1d82d92179efcc14a30546909fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/types/document_structure.rs:720-729 | crates/xberg/src/types/document_structure.rs:764-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/types/document_structure.rs:720\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/document_structure.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b26ffd2b9b7541465feb0b91dd7c673a4b04a890b8bd28b18335efe540f461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs:91-99 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs:130-138 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_japan1.rs:79-87 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_korea1.rs:85-93 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs\u0060 and \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs:139\u0060 calls \u0060Some\u0060 and \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs:100\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0c48d1dd4dd678dc7e3b4477468b800d4a3ad329ec6cfb4e02972ccdbda658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/xberg-native-pdf/src/fonts/encoding.rs:294-302 | crates/xberg-native-pdf/src/fonts/font_dict.rs:5798-5806 | crates/xberg-native-pdf/src/fonts/font_dict.rs:5968-5976 | crates/xberg/src/extractors/rtf/encoding.rs:47-55 \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 \u0060crates/xberg-native-pdf/src/fonts/encoding.rs:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/encoding.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"51413f753cb0e5e70ce3bc07fc283114087891d72f852111c043fd1ffae7a391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2107-2114 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2185-2193 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2256-2263 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2342-2350 \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 \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9775a03990611613de5069453d834ab13cd58fce9b59e49d52fe975ab89c61ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/xberg-native-pdf/src/document/fonts.rs:919-927 | crates/xberg-native-pdf/src/document/fonts.rs:979-987 | crates/xberg-native-pdf/src/document/fonts.rs:1092-1100 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/fonts.rs:919\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6038025f53a8fb7be18918079294ae712ccb0a3141c0c57cbaddd94ed529900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/xberg-native-pdf/src/encryption/algorithms.rs:81-90 | crates/xberg-native-pdf/src/encryption/algorithms.rs:415-424 | crates/xberg-native-pdf/src/encryption/algorithms.rs:684-692 \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":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"222145fe6d489e426be5a8a86bcd35b93c84adfbed650c101ccbdbebc1febd57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/resolution/color.rs:231-240 | crates/xberg-native-pdf/src/rendering/resolution/color.rs:284-293 | crates/xberg-native-pdf/src/rendering/resolution/color.rs:335-344 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/resolution/color.rs:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/rendering/resolution/color.rs:243\u0060 calls \u0060clamp\u0060 and \u0060crates/xberg-native-pdf/src/rendering/resolution/color.rs:296\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4867f8843f5194f43953434ce59086839a3bda94eeace3e7490838e1f08ad63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/xberg/src/extractors/fictionbook.rs:56-63 | crates/xberg/src/extractors/fictionbook.rs:397-404 | crates/xberg/src/extractors/jats/mod.rs:250-258 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb6dee61ac180d53349ff0bb5ce94c652eb0a8b71c2a2cb796d580c934189cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/xberg/src/extractors/fictionbook.rs:603-611 | crates/xberg/src/extractors/fictionbook.rs:990-999 | crates/xberg/src/extractors/jats/elements.rs:245-254 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/elements.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:603\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"df37a27cff1cde8969e69855fcfcdbfd8100cda782d63ddc7263b171d7c12783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): crates/xberg/src/text/token_reduction/core/word_filtering.rs:59-67 | crates/xberg/src/text/token_reduction/core/word_filtering.rs:94-101 | crates/xberg/src/text/token_reduction/core/word_filtering.rs:126-131 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/text/token_reduction/core/word_filtering.rs:59\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060words\u0060 to \u0060\u0026[String]) -\u003E (AHashMap\u003CString\u0060 in one and \u0060\u0026[String]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/token_reduction/core/word_filtering.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b240c1df2301dc8bc21916e33c1cdb4afe78e4443a2697a564030c93ec896084"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:687-695 | crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:704-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:687\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"613d7e3eabb2de3e4287eeea018f6421019345bbd905a8f9603d658d45d365cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:314-322 | crates/xberg-native-pdf/src/content/parser.rs:4429-4437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58f3f47a5b378b8fe5ef27e6abf5ba3994eaeee6882a23979b0ccb032e2fe59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg-native-pdf/src/document/mod.rs:1240-1254 | crates/xberg-native-pdf/src/rendering/sidecar.rs:1525-1539 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8a6945dfc5a3496618b78730d30307e7521d46f5cdd245881fa5c14050c69e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/algorithms.rs:572-580 | crates/xberg-native-pdf/src/encryption/algorithms.rs:586-594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a41436257e1121e17774f87785d46bdf6b02e6be80798ee349b7eaad61435af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:2008-2016 | crates/xberg-native-pdf/src/extractors/images.rs:2034-2042 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31c96c8fda2af119142e24e95978600146d68e24e4a48e61400712ef7200ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/marked_content.rs:294-302 | crates/xberg-native-pdf/src/extractors/text/marked_content.rs:304-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/marked_content.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68d7bfdb46ab6ddb956ecc5e85e1d0e3613386e8670ceccd72fc79e29f81261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:5918-5927 | crates/xberg-native-pdf/src/fonts/font_dict.rs:6107-6115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":5918}}}],"partialFingerprints":{"codehealthFindingId/v1":"34708312361451ed241d473d229fd45b0daf03cd3dd17ec0e6aa6d5135b2ac34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:6061-6069 | crates/xberg-native-pdf/src/fonts/font_dict.rs:6074-6079 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":6061}}}],"partialFingerprints":{"codehealthFindingId/v1":"151035c416128cc1a9794bc9b0643a79eeccf10f7829624a8790f77268548ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/lib.rs:282-291 | crates/xberg-native-pdf/src/lib.rs:345-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/lib.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"650f0c9119c6db1011fd4828fbd2e88585ea1989809504dc13686bb66acc13fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/redaction/classify.rs:23-31 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1167-1175 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/redaction/classify.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/classify.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"436f91a08bd5ccca758f3229e29813ce2cbdcef4ee477f351b5b3968266e898f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/structure/spatial_table_detector/filled_cells.rs:289-297 | crates/xberg-native-pdf/src/structure/spatial_table_detector/filled_cells/record_bands.rs:94-102 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector/filled_cells.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c35ef1878bfe504234b53a7127085eb2575def09292913731eaeb82a7f9e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/xref.rs:628-636 | crates/xberg-native-pdf/src/xref.rs:639-647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15773fbb5f5bd6ddee79603c2e012e85130c6c645548b135faf836255fa334b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/action.rs:88-96 | crates/xberg-pdfium-render/src/pdf/action.rs:101-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/action.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9606e55d3c718acffbcb0ba57eacb0e0fe5c802bef9618a8a4428e18b2df69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/extraction.rs:175-183 | crates/xberg-pdfium-render/src/pdf/document/page/extraction.rs:372-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":"crates/xberg-pdfium-render/src/pdf/document/page/extraction.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4190373f9a224a3625c4b0939f611c9e6087f067a64c2a9046beb25d67137adb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/object.rs:144-152 | crates/xberg-pdfium-render/src/pdf/document/page/object.rs:156-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4295890279d9e9d937e57877af83cb5b65b169ded58704f6bb73a1da352f2ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-tesseract/build_support/source_cache.rs:380-388 | crates/xberg-tesseract/build_support/source_cache.rs:393-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/build_support/source_cache.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da90d4929e9fb950644fbbb1b0bd22c29dce93f0a1951c00cb758daf19e9ad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-tesseract/src/api.rs:336-344 | crates/xberg-tesseract/src/api.rs:781-789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-tesseract/src/api.rs:336\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"548da23ec088b7f379c13bd68e6d6cc866d3c9d7955eda9d3cc1bc9339d2a8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/embeddings/engine.rs:68-76 | crates/xberg/src/reranking/engine.rs:139-147 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/embeddings/engine.rs:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/engine.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"de40a2a53711dba34a4fb48cc449f7bb23e6dffb5d259254304fb636ef4ac284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/xberg/src/embeddings/engine.rs:126-134 | crates/xberg/src/late_interaction/engine.rs:207-214 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/embeddings/engine.rs:126\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/engine.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad036baf7eb085577c20789c97667ea79cdee57e6d0d4e4650f5a181eb612418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/engine/extract_impl.rs:1021-1029 | crates/xberg/src/engine/extract_impl.rs:1046-1054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/engine/extract_impl.rs:1021\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11059683acff292ca68524d2cdc4f333306438db6b0b142f022e038544c449e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/archive/sevenz.rs:144-152 | crates/xberg/src/extraction/archive/sevenz.rs:219-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/archive/sevenz.rs:144\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, \u0060crates/xberg/src/extraction/archive/sevenz.rs:142\u0060 calls \u0060decode_archive_text\u0060 and \u0060crates/xberg/src/extraction/archive/sevenz.rs:217\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/sevenz.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"479ffc69a1ce38e5f21ca95a2242a155bec0aad83cb7d7edf1e9618201259cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/docx/drawing.rs:519-527 | crates/xberg/src/extraction/docx/drawing.rs:574-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/drawing.rs:519\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f4a20c2a356e8c656715cee6c3c30bcb513f401bcc55a6b05ed76090131b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/docx/math/collect.rs:10-18 | crates/xberg/src/extraction/docx/math/elements.rs:849-857 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/docx/math/collect.rs\u0060 and \u0060crates/xberg/src/extraction/docx/math/elements.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/collect.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/collect.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"631b5c2859a3bb18ed9208f5212099cf8d3e175f216b095a92ad4ae154a2c850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/docx/math/render.rs:280-288 | crates/xberg/src/extraction/mathml/render.rs:262-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/render.rs:280\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rows\u0060 to \u0060\u0026[Vec\u003CVec\u003CMathNode\u003E\u003E]\u0060 in one and \u0060\u0026[Vec\u003CMmlNode\u003E]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/render.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d6dff27c4645cc2d4bdb7415f8377238aa89783fa403b37dda7f96f42cbc87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:1123-1131 | crates/xberg/src/extraction/docx/parser.rs:1220-1228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:1123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"008dd7377972bf998c313b875c27ccd1478bf2f0f5d67a40cb92082b3476100a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:3782-3790 | crates/xberg/src/extraction/docx/parser.rs:3800-3808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:3782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"2510efa696be991159ab623f87deb3c7f54a3bbe17258b8780cd3138517fcebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/pst/mod.rs:410-418 | crates/xberg/src/extraction/pst/mod.rs:458-466 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pst/mod.rs:410\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pst/mod.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1f51ca803446f5a6d3a475d743945eed8fe3518d1bcbde53070a8ab6fed2cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/pst/mod.rs:572-580 | crates/xberg/src/extraction/pst/mod.rs:652-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pst/mod.rs:572\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pst/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7830da41b0af4d030c5f5436b03570d57c24a0cdabd5c0aef8d1ae287f49b8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/annotation_utils.rs:20-28 | crates/xberg/src/pdf/structure/assembly.rs:1835-1843 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/annotation_utils.rs:20\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/annotation_utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed84e0f45bf50ac80b75d35c36c3557e1aa7dad05f76f016f3a575401baf366c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/djot_format/extractor.rs:660-668 | crates/xberg/src/extractors/markdown.rs:799-808 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/djot_format/extractor.rs\u0060 and \u0060crates/xberg/src/extractors/markdown.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/djot_format/extractor.rs:660\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7d9c66ad6a42115c2a86d3ddb996c0772d8e8cc94635be64e32eb79357a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:278-286 | crates/xberg/src/extractors/jats/mod.rs:247-255 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:278\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e96cc0d7874952b35361fc26fd2afd351631bb6de56159df822991d4c4a123a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:1046-1054 | crates/xberg/src/extractors/fictionbook.rs:53-61 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1046\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d2e69eedb9cd84bcb0040d9eeb21d19223969001d839385f29d674b05a7d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/docx.rs:1454-1462 | crates/xberg/src/extractors/rtf/mod.rs:388-396 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docx.rs:1454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af0360f50716679bb2417620859c199c47a5cf43ee2964fb01c214fcbc2979b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/xberg/src/extractors/image.rs:551-558 | crates/xberg/src/ocr/layout_assembly.rs:499-507 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/image.rs:551\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5875ae551e90db9749a2dd173046d217c2d5ce8648892576d1af4da361e400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/image.rs:2126-2134 | crates/xberg/src/extractors/image.rs:2489-2497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/image.rs:2126\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fda936c6e62c0016c99313429fbde9d6c65471d237a17b971b33d2ba01c7c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/iwork/numbers.rs:711-719 | crates/xberg/src/extractors/iwork/numbers.rs:738-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/iwork/numbers.rs:711\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/numbers.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebcc8667e38cfbb8de70aa20174e97efb8d40e993a24a97fa0e4c803b27cfcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/jats/parser.rs:214-222 | crates/xberg/src/extractors/jats/parser.rs:402-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/jats/parser.rs:214\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/parser.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b08106db8fea2d39e0799c6d03de351eb40b28be4c7014c9a778a3c27d9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/xberg/src/extractors/markdown.rs:755-762 | crates/xberg/src/extractors/markdown.rs:777-785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/markdown.rs:755\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f69bc618f0bbd8325b61c019b21879d395432106fb6601f43654587ea7a860b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/markdown.rs:997-1005 | crates/xberg/src/extractors/mdx.rs:245-253 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/mdx.rs:255\u0060 calls \u0060Some\u0060, \u0060strip_mdx_syntax_collecting\u0060, \u0060as_mut\u0060 and \u0060crates/xberg/src/extractors/markdown.rs:1007\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f8d81057f7a793958735c94650dce0c100b410aeb808ce6dc3bd41d10617d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/myst.rs:793-801 | crates/xberg/src/extractors/myst.rs:818-826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/myst.rs:793\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, \u0060crates/xberg/src/extractors/myst.rs:792\u0060 calls \u0060Some\u0060, \u0060cell_from_marker\u0060 and \u0060crates/xberg/src/extractors/myst.rs:817\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/myst.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"041b413614fc3a6936c8c2c7c25a47c9e7af7b242c39bccd912976b275d5a6fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2034-2042 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2721-2729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2034\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2730\u0060 calls \u0060drain\u0060, \u0060collect\u0060 and \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2043\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":2034}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd69853d0317ca1aaadce506d442c4a2ad19a96b53b4024a0942e75e5c56a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2438-2452 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2456-2470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2438\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb4e9abcc25be19c043e4c95524e7768f6a796b5d17286222678edb5e2fc9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:8642-8653 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:8706-8716 \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":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":8642}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f6bcc7e9766df38db5ae65df1dd791c95043467890a36a1429c315debe6217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/pdf/reading_order.rs:203-212 | crates/xberg/src/extractors/pdf/reading_order.rs:214-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/reading_order.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1127b9faaa5f8273536e5fc9a48cedba0656a146597c62729c1337d6096e7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/layout/models/pp_doclayout_v3.rs:266-274 | crates/xberg/src/layout/models/rtdetr.rs:121-129 \u2014 before extracting anything, compare \u0060crates/xberg/src/layout/models/pp_doclayout_v3.rs\u0060 and \u0060crates/xberg/src/layout/models/rtdetr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/pp_doclayout_v3.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d342ea6865318e2a3520e99bb270ad4c42ec87de858a776910c85c73428d9124"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/ocr/processor/model_context.rs:204-212 | crates/xberg/src/ocr/processor/model_context.rs:226-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/processor/model_context.rs:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/model_context.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da45e6d800dd635dba7f51f1e6af33b09abc09867a0cc589ca024805ed493b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20139 lines \u00D7 3): crates/xberg/src/pdf/structure/adapters.rs:478-478 | crates/xberg/src/pdf/structure/adapters.rs:1596-1604 | crates/xberg/src/pdf/structure/pipeline.rs:1346-1354 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/adapters.rs\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 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. 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, \u0060crates/xberg/src/pdf/structure/adapters.rs:1594\u0060 calls \u0060Some\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs:1344\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f86bdf554a970b3b93ef1313dec2f9b9e9b6bc34d4231463d1d67a357a04bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/pdf/structure/classify.rs:497-505 | crates/xberg/src/pdf/structure/classify.rs:512-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/classify.rs:497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b051c7c5c0e407fd44f5b57024c0f784edd65301fd7b2e9183a7598143997d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:1751-1767 | crates/xberg/src/pdf/structure/pipeline.rs:1778-1793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/pipeline.rs:1751\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5245e351006000947af1d5d98ec1c4a297e8ae38db1d1a3535cf0ef67d5083f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:4053-4061 | crates/xberg/src/pdf/structure/pipeline.rs:4102-4110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/pipeline.rs:4053\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":4053}}}],"partialFingerprints":{"codehealthFindingId/v1":"75991f10f2ff58eb0253450ae461e65fa324eb6aa67d76a7d49a1d612a67c06c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/pdf/structure/regions/table_recognition.rs:650-658 | crates/xberg/src/pdf/structure/regions/table_recognition.rs:1478-1486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/regions/table_recognition.rs:650\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1dc01ec698589ee4822b1aa0e56b75d8b385e50a042e0df554970554c20287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/plugins/extractor/instrumented.rs:79-87 | crates/xberg/src/plugins/extractor/instrumented.rs:103-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/plugins/extractor/instrumented.rs:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/extractor/instrumented.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a45f10d405e72c26f7b41fe31d77e7f4258d4796dd532f7712c2e437299814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/text/classification/chunk_classifier.rs:66-74 | crates/xberg/src/text/classification/page_classifier.rs:36-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/classification/chunk_classifier.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"86adbf7fd4660a09900004809838578aa558eec4b34b5dbae3b0928acad5ea72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 17): crates/xberg/src/extraction/docx/math/collect.rs:138-145 | crates/xberg/src/extraction/docx/math/collect.rs:175-182 | crates/xberg/src/extraction/docx/math/collect.rs:213-220 | crates/xberg/src/extraction/docx/math/elements.rs:8-15 | crates/xberg/src/extraction/docx/math/elements.rs:80-87 | crates/xberg/src/extraction/docx/math/elements.rs:146-153 | crates/xberg/src/extraction/docx/math/elements.rs:241-248 | crates/xberg/src/extraction/docx/math/elements.rs:328-335 | crates/xberg/src/extraction/docx/math/elements.rs:365-372 | crates/xberg/src/extraction/docx/math/elements.rs:434-441 | crates/xberg/src/extraction/docx/math/elements.rs:473-480 | crates/xberg/src/extraction/docx/math/elements.rs:513-520 | crates/xberg/src/extraction/docx/math/elements.rs:550-557 | crates/xberg/src/extraction/docx/math/elements.rs:618-625 | crates/xberg/src/extraction/docx/math/elements.rs:702-709 | crates/xberg/src/extraction/docx/math/elements.rs:740-747 | crates/xberg/src/extraction/docx/math/elements.rs:809-816 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/docx/math/collect.rs\u0060 and \u0060crates/xberg/src/extraction/docx/math/elements.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/collect.rs:138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/docx/math/collect.rs:223\u0060 calls \u0060collect_children\u0060 and \u0060crates/xberg/src/extraction/docx/math/collect.rs:148\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/collect.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1591dc02e45facc602527fba55b70d44e4b346d1b3bd11efbad5674da9dd59c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/xberg-tesseract/src/api.rs:561-568 | crates/xberg-tesseract/src/api.rs:582-589 | crates/xberg-tesseract/src/api.rs:603-610 | crates/xberg-tesseract/src/api.rs:702-709 | crates/xberg-tesseract/src/api.rs:723-730 | crates/xberg-tesseract/src/api.rs:744-751 | crates/xberg-tesseract/src/api.rs:761-768 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-tesseract/src/api.rs:561\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b06e0e7a5a416f90374f103506b7658c38345baa0e55c0430e610bc67357501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/xberg/src/extractors/markdown.rs:309-316 | crates/xberg/src/extractors/markdown.rs:339-346 | crates/xberg/src/extractors/markdown.rs:369-376 | crates/xberg/src/extractors/markdown.rs:399-406 | crates/xberg/src/extractors/markdown.rs:429-436 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f5a24d15cf14e98d050ecf0a72759b8bf3ac5165e83e653f4145f22358a67d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/xberg-native-pdf/src/optional_content.rs:162-168 | crates/xberg-native-pdf/src/structure/parser.rs:103-110 | crates/xberg/src/pdf/native/metadata.rs:324-330 | crates/xberg/src/pdf/xref_revisions.rs:209-215 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/optional_content.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":"crates/xberg-native-pdf/src/optional_content.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"018bc090993a330b345cabcafcf14e49d38064f965747a909f4cd4c0e2b87724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/xberg/src/embeddings/engine.rs:129-136 | crates/xberg/src/late_interaction/engine.rs:209-216 | crates/xberg/src/reranking/engine.rs:275-282 | crates/xberg/src/sparse_embeddings/engine.rs:127-134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/embeddings/engine.rs:129\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, \u0060crates/xberg/src/reranking/engine.rs:273\u0060 calls \u0060from_shape_vec\u0060, \u0060map_err\u0060, \u0060Shape\u0060 and \u0060crates/xberg/src/embeddings/engine.rs:128\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/engine.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f29d55ac9d768ea2eb81da572ff041b13dc4a5708f6edf73de4dfd7de4d5f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/xberg/src/extraction/transform/content.rs:98-105 | crates/xberg/src/extraction/transform/content.rs:125-132 | crates/xberg/src/extraction/transform/content.rs:151-158 | crates/xberg/src/extraction/transform/content.rs:247-254 \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 \u0060crates/xberg/src/extraction/transform/content.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/content.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"714dbc9b3774b4c24bacf82df55d4fea417ef1bab87022124058fcce06d45c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/xberg/src/extractors/docbook.rs:279-286 | crates/xberg/src/extractors/docbook.rs:560-567 | crates/xberg/src/extractors/fictionbook.rs:577-584 | crates/xberg/src/extractors/jats/mod.rs:248-255 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee78f939c0c84915b6c90bc8692a20e4c7760d2b20ee4a1f337511f952c2c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/xberg/src/extractors/docbook.rs:1047-1054 | crates/xberg/src/extractors/fictionbook.rs:54-61 | crates/xberg/src/extractors/fictionbook.rs:395-402 | crates/xberg/src/extractors/fictionbook.rs:462-469 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed82216ba9132438dbb20b1ff6327d9923607c538a0dcc952050908a78c0f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/xberg/src/pdf/structure/classify.rs:384-390 | crates/xberg/src/pdf/structure/classify.rs:401-408 | crates/xberg/src/pdf/structure/classify.rs:419-426 | crates/xberg/src/pdf/structure/layout_classify.rs:413-419 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/classify.rs\u0060 and \u0060crates/xberg/src/pdf/structure/layout_classify.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/classify.rs:384\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2ed54e963736a3cd30209d4c29379e5edca339f6c7cac048f72ab013d78acc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/xberg/src/text/redaction/patterns/email.rs:22-29 | crates/xberg/src/text/redaction/patterns/ip_address.rs:44-51 | crates/xberg/src/text/redaction/patterns/postal_code.rs:51-58 | crates/xberg/src/text/redaction/patterns/swift_bic.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 all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/text/redaction/patterns/email.rs:22\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/patterns/email.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9543bc637de5c6687a18fb2715e082c97cb975296c381904bac731f54e9df32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg-native-pdf/src/content/parser.rs:3788-3795 | crates/xberg-native-pdf/src/content/parser.rs:3799-3806 | crates/xberg-native-pdf/src/content/parser.rs:3857-3864 \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":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3788}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c976771bcaf85f2d9583e6c0e29b4ab6b2dca59c0b6d17d29fc336936686a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg-native-pdf/src/document/mod.rs:1241-1248 | crates/xberg-native-pdf/src/rendering/sidecar.rs:936-943 | crates/xberg-native-pdf/src/rendering/sidecar.rs:1526-1533 \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 \u0060crates/xberg-native-pdf/src/document/mod.rs:1241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9bbf25c90128c7bc6b547dec8bea0d0291b257b9be2225594368c42d5fc8f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg-pdfium-render/src/pdf/document/fonts.rs:357-364 | crates/xberg-pdfium-render/src/pdf/document/fonts.rs:492-499 | crates/xberg-pdfium-render/src/pdfium.rs:428-435 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/fonts.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dad8f451a7571195ca5d3c6a894c53c74662ac60bf7ff17cf875a1fea4f689c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extraction/docx/parser.rs:1832-1839 | crates/xberg/src/extractors/csv.rs:539-546 | crates/xberg/src/pdf/structure/regions/table_recognition.rs:1254-1261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1832}}}],"partialFingerprints":{"codehealthFindingId/v1":"9686edaff840a44e5da2fa707047d25ab1a40e88e9aa9bef2c1184e2b4842618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extraction/docx/table/mod.rs:584-591 | crates/xberg/src/extraction/docx/table/mod.rs:657-664 | crates/xberg/src/extraction/docx/table/mod.rs:718-725 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/table/mod.rs:584\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"f340a1c7e4fce3c1c37ef4be69b466e0272aa1514f06b70c5c3ebf362d5b1e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extractors/djot_format/extractor.rs:174-181 | crates/xberg/src/extractors/djot_format/extractor.rs:204-211 | crates/xberg/src/extractors/djot_format/extractor.rs:234-241 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"05393be8d39f817b698067a425e12ea8dd7a75fd87acc88fe915ae25d9a08cd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extractors/latex/mod.rs:1202-1209 | crates/xberg/src/extractors/orgmode.rs:636-643 | crates/xberg/src/extractors/rst.rs:1646-1653 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/extractors/latex/mod.rs:1201\u0060 calls \u0060replace\u0060 and \u0060crates/xberg/src/extractors/orgmode.rs:635\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb8d06cc36d86bb1930e8b9f368c0607d43587d7b6d5315a22bc4d275a8db80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extractors/rst.rs:564-571 | crates/xberg/src/extractors/rst.rs:583-590 | crates/xberg/src/extractors/rst.rs:602-609 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rst.rs:564\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbfcf4fa3ba960b37aa15ce89c235e24e78b464361a35eea58e6b3ce5520b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/text/redaction/patterns/ip_address.rs:44-51 | crates/xberg/src/text/redaction/patterns/postal_code.rs:33-40 | crates/xberg/src/text/redaction/patterns/postal_code.rs:42-49 \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 \u0060crates/xberg/src/text/redaction/patterns/ip_address.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/patterns/ip_address.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc140c4b2743b58210cb6ac1ac313d2bf76791ef5dbd9a04f477c7caccbb3bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-candle-ocr/src/download_guard.rs:59-66 | crates/xberg/src/model_download.rs:1421-1428 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/download_guard.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"62747ca69cb295736ae5463857f69fe743159682fb43ec86bb52e46a5898a1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:165-174 | crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:187-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:197\u0060 calls \u0060cat\u0060 and \u0060crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs:176\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/decoder.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a508772cab083e1b7f56d6975d2ebfc4412f4a68662f1ce187d51ee047d867bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-libheif/src/image.rs:149-157 | crates/xberg-libheif/src/image.rs:189-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/image.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"706a8c11a0ff26e5959bc26895b0ae70f33cac04aed041ce2cbc7d0803265d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/annotations.rs:545-552 | crates/xberg-native-pdf/src/annotations.rs:565-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/annotations.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bfe11f6fe2bb3b4c25f62bc4c510acb9386d64e43f69e58f3562ba5b82dec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:2565-2572 | crates/xberg-native-pdf/src/content/parser.rs:2576-2583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f89e11b09147ecd16c5934024592a961abbcb2cce1d90612afac569fbfde3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/document/extract_api.rs:756-768 | crates/xberg-native-pdf/src/document/extract_api.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:756\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"336ff0c4e044431a0a980f2c6deb10c265c460c799b4eadab8950d197fad7b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/xberg-native-pdf/src/document/extract_api.rs:1378-1383 | crates/xberg-native-pdf/src/pipeline/reading_order/simple.rs:22-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:1378\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"43848d94a5099b906a14fd7412b4e56408d42e2446842bbdc223a8add122ae8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/document/objects.rs:417-424 | crates/xberg-native-pdf/src/document/objects.rs:432-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b385af1c238069378baf0b4d2d55afb74c3cacf59f335e4cbad0f45f198b239a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/algorithms.rs:523-530 | crates/xberg-native-pdf/src/encryption/algorithms.rs:536-543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/algorithms.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e6dc06fb12077646c4488b322156f72618f5cf75df534ce61fea4cbed9d69a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/write_handler.rs:200-207 | crates/xberg-native-pdf/src/encryption/write_handler.rs:214-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/encryption/write_handler.rs:200\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/write_handler.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"699910602bb3f0bcb954032b21d57a129f3cbff0f6e22da9e32e688e874c28c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:4548-4555 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:3769-3779 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/images.rs:4548\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":4548}}}],"partialFingerprints":{"codehealthFindingId/v1":"6708c0571779a9395d6c220e6e9f0c4231819c0004cf1a491df976745bb34564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/span_ordering.rs:227-235 | crates/xberg-native-pdf/src/extractors/text/span_ordering.rs:330-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/span_ordering.rs:227\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_ordering.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"771d6f1048f5f4d6bf7342e4e8700510fe4f3dadb778c05079b8a50d4b7d2c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:2607-2614 | crates/xberg-native-pdf/src/fonts/font_dict.rs:2713-2720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:2607\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef786c1c8efc2e86a27b8b3b979e74939f9c5c28246b5b34e22dac8c47efa0fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1344-1355 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1450-1461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"060b89445b737d08304476b61ca83e0c7893348782f7371c7f529932d6fc98f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:9146-9153 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:9201-9208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:9146\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":9146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99360a31ea0b83cdf262f644939f2ff354291625f69a4793e89f2f3fea4cd9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1453-1460 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1493-1500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:1453\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"785328f4d912d9610d08a876c747163c0679836cc2a9cf222903c995dd5663e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/structure/types.rs:359-366 | crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:117-125 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/structure/types.rs:359\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 before the matched lines, \u0060crates/xberg-native-pdf/src/structure/types.rs:358\u0060 calls \u0060Some\u0060 and \u0060crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:116\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/types.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"361630b2525536fa5e40271b220bf3220fb4ce3f85d5fb0022526624d6c688ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-paddle-ocr/src/ocr_utils.rs:155-162 | crates/xberg/src/paddle_ocr/backend.rs:1239-1246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-paddle-ocr/src/ocr_utils.rs:155\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/ocr_utils.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e549a76d9e52e6cccde947a3b50b397626e516ae2f4769ded8dde637b85791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/api/handlers.rs:307-314 | crates/xberg/src/api/openweb.rs:206-213 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/api/handlers.rs:307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc37d8211b19e4a66525f2b897c0b3a1baa0c99a18075f22c52ca9af17e7e3b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/core/image_encode.rs:287-294 | crates/xberg/src/extraction/diagram/svg/mod.rs:52-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/image_encode.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"29057d1bec0f1991db12cce356047fcc8e6afc68edf95d9ee2850013c97495b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/xberg/src/engine/mod.rs:106-111 | crates/xberg/src/engine/mod.rs:183-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/engine/mod.rs:106\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fafc60835661fa4272cab811fcf9c039da45cc9a4b35a6970107ae564ec52cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extraction/docx/drawing.rs:350-357 | crates/xberg/src/extraction/docx/table/mod.rs:779-786 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedab8d33fc506e74d96ec4401fb58c8ca18dee413151e65cf47155ce6b54908"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extraction/docx/table/mod.rs:230-237 | crates/xberg/src/extraction/docx/table/mod.rs:404-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/table/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"572ce010d3bdcb9bb3a269fdeb562cab5bb275c4bbccbaf9fa22083eb3fc271e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/email/mod.rs:305-314 | crates/xberg/src/extraction/email/msg.rs:279-288 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/email/mod.rs:305\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/mod.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c969d55eaaca0695da9eb2023e042e2c2ffec8d671a25942880241cb545b8cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/xberg/src/extraction/html/structure.rs:390-396 | crates/xberg/src/extraction/html/structure.rs:431-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/html/structure.rs:390\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"1117cd18dbf17c340e797aef0dcdacfabba31d4f930a2c4f68eaa0166c74e697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extraction/pptx/mod.rs:612-619 | crates/xberg/src/extractors/docx.rs:684-691 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pptx/mod.rs:612\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b0fce99e97adb7fb3deab1b654266b5c0397d11589adc08519215694221f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extraction/transform/content.rs:324-331 | crates/xberg/src/extraction/transform/content.rs:345-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/transform/content.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/content.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9b1bd731973d902d3eadeabe5d92e1f656f0d8065e21b11f19529d5809b58e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/xberg/src/extractors/docx.rs:771-778 | crates/xberg/src/extractors/wordperfect.rs:636-642 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/wordperfect.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 \u0060crates/xberg/src/extractors/docx.rs:771\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a434a795b109195c55f7193102205a15509b27f116bc8538ce6666a3c41f40f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/docx.rs:1491-1498 | crates/xberg/src/extractors/rtf/mod.rs:415-422 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/mod.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"66979f0ca135ce27cfc5cefc5d4d3004801166f0340f1b8cc8b03f1eef721866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/email.rs:309-316 | crates/xberg/src/extractors/html.rs:140-147 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/html.rs:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6b3f6359ae171c61999e565a70b95c5d9ec1c79b5360d5e3d2390f7c2adcd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/excel.rs:427-434 | crates/xberg/src/extractors/excel.rs:464-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/excel.rs:427\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"5462291f85f8b9e4d87b7026767077db4e189a8d87c645523a777f0208ed88a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:461-468 | crates/xberg/src/extractors/jats/elements.rs:48-55 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/elements.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:461\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de3c47208030c643bf5fa08092bc26944d3889af28d4fee49ce8d2c66e96fb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/pptx.rs:515-522 | crates/xberg/src/extractors/pptx.rs:639-646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pptx.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"65032bb1250451ccff5b20ad38a535b21cd4d57d4b61a68e2f2e5ac385e19b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:368-375 | crates/xberg/src/extractors/rtf/parser/text_extract.rs:728-735 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/parser/text_extract.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rtf/parser/formatting_extract.rs:368\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7617346afba8cb343fccd491389aab71f88f25be3d6256407415315e0c60cca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/xberg/src/extractors/xml.rs:81-88 | crates/xberg/src/extractors/xml.rs:128-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/xml.rs:90\u0060 calls \u0060push\u0060, \u0060saturating_add\u0060 and \u0060crates/xberg/src/extractors/xml.rs:135\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/xml.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"641df64aa701cd94e7ac18412393b8db61fa2cb267e5fe279bc8039f65e910b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/late_interaction/mod.rs:456-463 | crates/xberg/src/sparse_embeddings/mod.rs:316-323 \u2014 \u0060crates/xberg/src/late_interaction/mod.rs\u0060 and \u0060crates/xberg/src/sparse_embeddings/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 38 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/late_interaction/mod.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/mod.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb5acdd8d2c7d10a62eb3947624abac9eaac67d11e281fe8240154b4ff69388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/layout/models/table_classifier.rs:81-88 | crates/xberg/src/layout/models/table_classifier.rs:101-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/layout/models/table_classifier.rs:81\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/table_classifier.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca8e33bb0ddaae590a5162afa899867b42ab0317b7711377431e59fd9dac857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/lib.rs:510-517 | crates/xberg/src/lib.rs:525-532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/lib.rs:510\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/lib.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d32df652fea51a5aa3769b656017fffbca907f7a1aef7f462f79aef7a68c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/ocr/tesseract_backend.rs:607-614 | crates/xberg/src/ocr/tesseract_backend.rs:746-753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"26501e20f0325549be549fba498f5c0adbe1e560e7b3a406449f01ecd544e5c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:7062-7069 | crates/xberg/src/pdf/structure/pipeline.rs:7141-7148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7062}}}],"partialFingerprints":{"codehealthFindingId/v1":"455aa1cc7d00194549bd8cd3037fc93cf401868e21b5e473e6bb242e044b6835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:7902-7910 | crates/xberg/src/pdf/structure/pipeline.rs:7972-7980 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/pipeline.rs:7902\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38200ac3a1f0bd8df174590067f808d6744fe9e9274aff1c24956450b63e66c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/pdf/table_reconstruct.rs:2320-2327 | crates/xberg/src/pdf/table_reconstruct.rs:2451-2458 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/table_reconstruct.rs:2320\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/pdf/table_reconstruct.rs:2449\u0060 calls \u0060saturating_mul\u0060 and \u0060crates/xberg/src/pdf/table_reconstruct.rs:2318\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":2320}}}],"partialFingerprints":{"codehealthFindingId/v1":"27df68b51a4b376c463b469b315f5e5d2d3eb0b3d084b1c6345283b1b82650e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/text/ner/candle.rs:51-58 | crates/xberg/src/text/ner/gline.rs:371-378 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/text/ner/candle.rs:51\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/ner/candle.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3867dc9b51d078ef199b3508d6759ec9c5e673f0f599ab767ae22815a379f22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 13): crates/xberg/src/extractors/docbook.rs:170-176 | crates/xberg/src/extractors/docbook.rs:281-287 | crates/xberg/src/extractors/docbook.rs:562-568 | crates/xberg/src/extractors/docbook.rs:875-881 | crates/xberg/src/extractors/docbook.rs:1049-1055 | crates/xberg/src/extractors/fictionbook.rs:56-62 | crates/xberg/src/extractors/fictionbook.rs:397-403 | crates/xberg/src/extractors/fictionbook.rs:464-470 | crates/xberg/src/extractors/fictionbook.rs:579-585 | crates/xberg/src/extractors/fictionbook.rs:685-691 | crates/xberg/src/extractors/fictionbook.rs:875-881 | crates/xberg/src/extractors/fictionbook.rs:1040-1046 | crates/xberg/src/extractors/jats/mod.rs:250-256 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a961c1584a2b02769b9afeb3227ccc96df9cf5d86aaef12607ae566bae9c2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/xberg-native-pdf/src/layout/region_classifier.rs:96-102 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1163-1169 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1458-1464 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1639-1645 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1893-1899 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/layout/region_classifier.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"da83c79af189bad5fa1e216d0b8e74f7a6ce98d578a6cf6c73d9baefdaedb085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/xberg-tesseract/src/api.rs:1576-1585 | crates/xberg-tesseract/src/api.rs:1630-1639 | crates/xberg-tesseract/src/api.rs:1703-1712 | crates/xberg-tesseract/src/api.rs:1789-1798 \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 \u0060crates/xberg-tesseract/src/api.rs:1576\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-tesseract/src/api.rs:1799\u0060 calls \u0060Some\u0060, \u0060push\u0060, \u0060offset\u0060 and \u0060crates/xberg-tesseract/src/api.rs:1586\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"52263f39e650779761fc214a9b594a2eda4cac3f41505d708d8729209334ccfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 4): crates/xberg/src/extractors/latex/mod.rs:498-502 | crates/xberg/src/extractors/latex/mod.rs:524-530 | crates/xberg/src/extractors/latex/mod.rs:548-554 | crates/xberg/src/extractors/latex/mod.rs:679-683 \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 \u0060crates/xberg/src/extractors/latex/mod.rs:498\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 before the matched lines, \u0060crates/xberg/src/extractors/latex/mod.rs:495\u0060 calls \u0060extract_caption\u0060, \u0060extract_label\u0060 and \u0060crates/xberg/src/extractors/latex/mod.rs:522\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d401dadd872e5a2e50436ec9b5a1a022984dc5d55656ed8c857ba21372847a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/extraction/doc/metadata.rs:136-142 | crates/xberg/src/extraction/exif.rs:191-197 | crates/xberg/src/extraction/ppt/mod.rs:1533-1539 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/doc/metadata.rs\u0060 and \u0060crates/xberg/src/extraction/ppt/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/exif.rs:199\u0060 calls \u0060is_empty\u0060 and \u0060crates/xberg/src/extraction/doc/metadata.rs:143\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/metadata.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa27c9ba5f4a951294670d29774349931f376419fab71400caa22874788ebdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/extractors/djot_format/extractor.rs:308-314 | crates/xberg/src/extractors/djot_format/extractor.rs:316-322 | crates/xberg/src/extractors/djot_format/extractor.rs:324-330 \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":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1fe8a8a0471920fadbf37e4275a755847c3f75b97cabee3be11a14fcc17c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:1139-1146 | crates/xberg/src/extractors/jats/mod.rs:72-79 | crates/xberg/src/extractors/jats/parser.rs:348-354 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0601d14501ac6307214945725161719039d8f658d3ab210bfc881e83def127f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/xberg/src/extractors/iwork/keynote.rs:200-210 | crates/xberg/src/extractors/iwork/numbers.rs:1331-1341 | crates/xberg/src/extractors/iwork/pages.rs:163-173 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/iwork/keynote.rs\u0060 and \u0060crates/xberg/src/extractors/iwork/pages.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/iwork/keynote.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c304115bfc248d034f4ff65650fe19c94dc2e33c95c8e37f50739591b6f865c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/extractors/jats/elements.rs:383-389 | crates/xberg/src/extractors/jats/parser.rs:217-223 | crates/xberg/src/extractors/jats/parser.rs:405-411 \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 \u0060crates/xberg/src/extractors/jats/elements.rs:383\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/extractors/jats/parser.rs:214\u0060 calls \u0060clear\u0060 and \u0060crates/xberg/src/extractors/jats/elements.rs:381\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7e710bab744b1bf84f94107a718d5f4c3bb5e6d791e54d5caad5422bbd1538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/extractors/markdown.rs:478-484 | crates/xberg/src/extractors/markdown.rs:486-492 | crates/xberg/src/extractors/markdown.rs:494-500 \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":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad7eae1dd568cc54ee302827efb3f8e4756b2225e5a6874bca2dd06261a66b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/pdf/native/hierarchy.rs:196-202 | crates/xberg/src/pdf/native/text.rs:1415-1421 | crates/xberg/src/pdf/native/text.rs:2488-2494 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3be27313b320ff292e833579579cdbf6decde5fb9012376ce758d4b0112cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/plugins/registry/embedding.rs:55-61 | crates/xberg/src/plugins/registry/reranker.rs:45-51 | crates/xberg/src/plugins/registry/tokenizer.rs:52-58 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/plugins/registry/embedding.rs:55\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060backend\u0060 to \u0060Arc\u003Cdyn EmbeddingBackend\u003E\u0060 in one and \u0060Arc\u003Cdyn RerankerBackend\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/embedding.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1732ba9b077e3ea6ed5d117a1946b2d44f64a7bc33a70359f33424ee5330f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs:180-186 | crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs:264-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/mtp.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b053196b64c15bc0deec81c88e581b0505550917a2409d0ac0dcbdda4dd5f35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:791-800 | crates/xberg-native-pdf/src/content/parser.rs:1027-1036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:791\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa32473ac793e5f459eaca5765aef1339d50ec9b12a0863b1264045235a6394"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:1524-1530 | crates/xberg-native-pdf/src/content/parser.rs:1543-1548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:1524\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1c0521900e4522205e604769e626f33312f6c8ec2b9c67c3b40901f6d479a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs:117-125 | crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs:348-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cmap/line_parsers.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff8dd934e4ee08342808f892970a5d68ed5d38e0256b6fbad8bc3e9e90fdc7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/layout/clustering.rs:96-102 | crates/xberg-native-pdf/src/pipeline/reading_order/article_thread.rs:53-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/layout/clustering.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6288858769391550fcd8128478e71cdf59a18d10c1c4c9fd685f4e4732188e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/lexer.rs:171-177 | crates/xberg-native-pdf/src/lexer.rs:180-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/lexer.rs:171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/lexer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"984f222e64ca5ed4607d9299e70af4eec639134e14706270d9c7e60f26a9bf07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/parser.rs:314-323 | crates/xberg-native-pdf/src/parser.rs:328-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abe612331624c7b700143f1cac524b10388cca7a0fcd1e558fd229ee2e124ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2591-2597 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2060-2066 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2591\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2591}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9a7a05b6c1ffb401874f8f9efbdd35ff7acea7c017dfd0d95ac40d9e2520a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2625-2631 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2083-2089 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2625\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2625}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a192d926e0c25605eaac83d7397e6c77fb6e33b5125e6b159aad14ab1a0ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:3280-3293 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:3398-3404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:3280\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3280}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53c131bcfb9c5ee0b7b3cb944451748cc544a0311833f019c50310c0e065c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 6): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5810-5816 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5873-5874 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5971-5976 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6136-6137 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6802-6803 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6879-6880 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5810}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ee822319e0fc6810f6f0244abc4d1a50d3a0ad48c16188b069329b245b7020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:6455-6461 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6520-6526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:6455\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6455}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a15811f15439c1a4dc968c4932324047b4e09ba3457c3328980f6af23a7ebe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:7832-7838 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:7842-7848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:7832\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:7840\u0060 calls \u0060and_then\u0060, \u0060as_array\u0060, \u0060first\u0060 and \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:7850\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":7832}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ce10d610e0201dae5765e5c8b701f7b20458cc33bd6e5d05c9bead791c81a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2718-2724 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:3251-3257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2718\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":2718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4265eaa4d92cb5de1bc923d2a0d13c04351e841e25275607398fd5becb84af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:528-534 | crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:568-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:528\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"060ad330005c738053605dae736185b8b9df65ec7efd15f8aab5d6812cc61230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/text/word_boundary.rs:163-169 | crates/xberg-native-pdf/src/text/word_boundary.rs:182-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/word_boundary.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"108d6bdb9c58e5f118cb8869a295492732d8bfd353d4635fb46ff40b74c2a6e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:360-366 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:422-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs:360\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/private.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"552d12a4d4259998b0153b44b749c79d1deed1d5112e593533417fff83afbe04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-tesseract/src/page_iterator.rs:231-237 | crates/xberg-tesseract/src/page_iterator.rs:280-286 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/page_iterator.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6257055cc8856860b6c9f2e2efb2ced5626a412e39613957de40d8649f6c76e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/api/handlers.rs:1205-1211 | crates/xberg/src/mcp/server.rs:636-642 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/api/handlers.rs:1205\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb8b02fb2a4b1b5ef1b5736dfe25ea06fdd005c8c9fb3ddc4182453f4a987d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/api/openweb.rs:106-112 | crates/xberg/src/api/openweb.rs:164-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/openweb.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7c083f84e1d6537a9a3636fd90d727ecbf9f7b86122c32f27d75848c2db68c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs:78-84 | crates/xberg/src/candle_ocr/trocr_backend.rs:116-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"117b847e747ee9dde5e1cb7923038956d418a108a3667ce63859335cd753371f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/archive/tar.rs:230-238 | crates/xberg/src/extraction/archive/zip.rs:227-235 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/archive/tar.rs\u0060 and \u0060crates/xberg/src/extraction/archive/zip.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/archive/tar.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":"crates/xberg/src/extraction/archive/tar.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a93d15cf56f3e5ec351b4d9ceff9b26c6cb34c933912cf047e9aa4e671440a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/derive/mod.rs:264-273 | crates/xberg/src/extraction/derive/mod.rs:293-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":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b12212b415f79dcf2d6f5164686ab6c27c2bb4c5f15a77bd6cfd09691c3e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:1760-1766 | crates/xberg/src/extraction/docx/parser.rs:1793-1799 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:1760\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49a4dcfe615ad64ea246860ffdd0c3dae5c3dfc74300e5652ef1d79b9d85afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:3134-3140 | crates/xberg/src/extraction/docx/parser.rs:4162-4168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:3134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e1e514cf88d49f4b0fc396f0bedb63e2bb9343bc55bcbdc62427a0526c5b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:4235-4241 | crates/xberg/src/extraction/docx/parser.rs:4295-4301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:4235\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":4235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32a3bd742a5e260bc8b99c86e3f7c2347f838223d4a8d7ef010105ecc4e9083"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/email/msg_props.rs:47-56 | crates/xberg/src/extraction/email/msg_props.rs:78-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/email/msg_props.rs:47\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/msg_props.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a44f1dad83e8af7e2dca6d68d2f249dab85ea31f96c34749937292102f46db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extraction/excel.rs:126-133 | crates/xberg/src/extraction/excel.rs:534-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel.rs:126\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"983daaeec15da984f6b8cdd46b241b7220bf923c5856b91752793c9923690ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/hwp/summary.rs:95-101 | crates/xberg/src/extraction/ppt/mod.rs:863-869 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/hwp/summary.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c2c8b54678437fe412f379ab00579a81e113b8c7871e1f2761c9aadefe4941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/image.rs:348-356 | crates/xberg/src/extraction/image.rs:358-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd65b55d9eefd1ddb6c22020b5469d8d45d16777a229324292b5b0018eb8578"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/ppt/mod.rs:500-506 | crates/xberg/src/extraction/ppt/mod.rs:517-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e86221b6145b37f5ac38221e4deb6f442694ddac7257b8ccb5dfb0a90beda8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/pptx/elements.rs:362-368 | crates/xberg/src/extraction/pptx/elements.rs:422-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/pptx/elements.rs:429\u0060 calls \u0060with_capacity\u0060 and \u0060crates/xberg/src/extraction/pptx/elements.rs:370\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/elements.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc319521e20b012434e6714b692e4b4ac996e66d3898e00fb4cc9e26cde938c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/structured.rs:494-500 | crates/xberg/src/extraction/structured.rs:606-612 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/structured.rs:494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/structured.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ad74403504a59dd34809aee182cf5699f9fd143269f161ec0832b3bf43986b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:921-926 | crates/xberg/src/extractors/docbook.rs:1225-1231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:921\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfb2bc199c573b6da2fdee9df5a70d0983ab5ef77be30a08794fe12f5ce1f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:1001-1007 | crates/xberg/src/extractors/docbook.rs:1309-1315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1001\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"df480358051ad2a4cfc876075049ec256489a5011b0421c5e3c8275f0df859e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:201-204 | crates/xberg/src/extractors/docbook.rs:1352-1358 | crates/xberg/src/extractors/fictionbook.rs:151-157 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/docbook.rs:1359\u0060 calls \u0060Borrowed\u0060, \u0060as_ref\u0060 and \u0060crates/xberg/src/extractors/docbook.rs:205\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2eb145edee360c0d9c85afa1f0abb583f60183c393c7e802bfea23483c7fd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/excel.rs:398-404 | crates/xberg/src/extractors/pptx.rs:528-534 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/excel.rs:398\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a9c38222c4c3d42ca44611e9f7ffe30fc8514d72a535402fc9c3ee1bd9b277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:298-303 | crates/xberg/src/extractors/fictionbook.rs:308-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a781730199b2ed3d028434b3fe132b67f19324f8663c745a2c672e467aaa41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/image.rs:4191-4197 | crates/xberg/src/extractors/image.rs:4260-4266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":4191}}}],"partialFingerprints":{"codehealthFindingId/v1":"272e90304efa6bbe6f1fae3644b43265c2bbf159ced0dd2db506c21b2b21a259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/latex/mod.rs:1281-1287 | crates/xberg/src/extractors/rst.rs:1799-1805 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7af542c8d6f12aa2e338b7e1c8bbfc3e897c4f8f1a165501f622ce25618855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/odp.rs:315-321 | crates/xberg/src/extractors/odp.rs:359-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/odp.rs:315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/odp.rs:366\u0060 calls \u0060is_empty\u0060, \u0060push_raw_block\u0060, \u0060join\u0060 and \u0060crates/xberg/src/extractors/odp.rs:322\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"336cd4c01e9f924cb930a2b7dc2ab8c344de78005596e1db8a4587452c7c0dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/document.rs:964-970 | crates/xberg/src/extractors/pdf/ocr/document.rs:1028-1034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/document.rs:964\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d1ca49d656a0a5738ae6b41e664c254c340adcb588816c212c33c4085a66b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1946-1953 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2202-2209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1946\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f32313ecef112a0625c6a953ccfa66767628b4d020d1f12a8d1b69180e5a26c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6314-6320 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6331-6337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":6314}}}],"partialFingerprints":{"codehealthFindingId/v1":"63478428ed6a129f0a806b92557d170934d68e442f0bec29ba540d5cbc9208db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/tall_source.rs:248-254 | crates/xberg/src/extractors/pdf/ocr/tall_source/augmentation.rs:479-485 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0246803866546d4cba3e03b090d75aba889418a50a50ea0bb2b323932816e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/rst.rs:895-901 | crates/xberg/src/extractors/rst.rs:910-916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/rst.rs:895\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d55701a132c7c258847029df50a2e51d0968c11ea68b50e3db1eca233378a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/late_interaction/engine.rs:112-118 | crates/xberg/src/sparse_embeddings/engine.rs:74-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/late_interaction/engine.rs:112\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/late_interaction/engine.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"972398ab395e98e28d41f9e4b3fc0294753a7a1eebb1756685ac24b26d9ebac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/layout/models/yolo.rs:109-122 | crates/xberg/src/layout/models/yolo.rs:171-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/yolo.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec8b5b568c8f2cffed422dbd31f03aa869f86fa7aca94a70c9a9ee97ae315ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/llm/structured.rs:50-56 | crates/xberg/src/llm/text_completion.rs:32-38 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/llm/structured.rs:48\u0060 calls \u0060sanitize_schema_for_provider\u0060 and \u0060crates/xberg/src/llm/text_completion.rs:30\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/llm/structured.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0ae6f5c7d4eed56bf9d68d2afc790dfb1ef15778bde78e822248e01a559299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/llm/structured.rs:73-79 | crates/xberg/src/llm/structured.rs:212-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/llm/structured.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/llm/structured.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ba2d7f2abfe8597bd3db47dfaa87741c9eeb732dcc4af6ff780c27c3d23507"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/ocr/hocr_parser.rs:339-345 | crates/xberg/src/ocr/hocr_parser.rs:850-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/hocr_parser.rs:339\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9d8d9a18ea42c8afbceec056c300b98d3e8d965a1aa8483af25e0826558e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/ocr/processor/execution.rs:89-95 | crates/xberg/src/ocr/processor/execution.rs:117-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/processor/execution.rs:89\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d47b21c4abce9c271ba2c947125c7e4266e54c9cafe9616ca601dc501edbb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/xberg/src/ocr/processor/execution.rs:2428-2434 | crates/xberg/src/sceptre_ocr/mod.rs:678-683 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/processor/execution.rs:2428\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3967283b186d8a63aeae87be3552f4650ed86b4f5554d69ff985517b9a165515"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/ocr/tesseract_backend.rs:620-626 | crates/xberg/src/ocr/tesseract_backend.rs:755-761 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/tesseract_backend.rs:620\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/ocr/tesseract_backend.rs:617\u0060 calls \u0060requested\u0060, \u0060mixed_pdf_khmer_retry_requested\u0060 and \u0060crates/xberg/src/ocr/tesseract_backend.rs:753\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff7cb77ee8ad2e3bf05c751226629a4f22f20d721bf61f8e64359887a868fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/onnx/mod.rs:618-624 | crates/xberg/src/transcription/engine.rs:307-313 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/onnx/mod.rs:618\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/onnx/mod.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b1e52369b361d914581a631a22c731bb34696f435ef818dc6cd0b74742008e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/pdf/native/table.rs:2573-2579 | crates/xberg/src/pdf/table_reconstruct.rs:2474-2480 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":2573}}}],"partialFingerprints":{"codehealthFindingId/v1":"e626cbdd7c143bd48c7d14e44a48f0ae9468210232a744279715981bcb8f85b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/pdf/native/text.rs:1537-1547 | crates/xberg/src/pdf/native/text.rs:1641-1651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72c4ee37de340288efc1ae3deaf4d914f28af1b5796dbe52d035eff6e7e248e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/pdf/structure/adapters.rs:1472-1478 | crates/xberg/src/pdf/structure/pipeline.rs:1304-1310 \u2014 before extracting anything, compare \u0060crates/xberg/src/pdf/structure/adapters.rs\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/adapters.rs:1472\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg/src/pdf/structure/adapters.rs:1471\u0060 calls \u0060OcrOnPage\u0060 and \u0060crates/xberg/src/pdf/structure/pipeline.rs:1302\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8e3a4cd1974105ae5fe12028f6f654fdfbfc1d3e9b160fd75d93ca8a35c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/rendering/comrak_bridge.rs:1311-1317 | crates/xberg/src/rendering/comrak_bridge.rs:1731-1737 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/rendering/comrak_bridge.rs:1311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbd020a38d91f13fbea369c2abd57ee3c7b461522e91183732136e1ab670a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/rendering/table_math.rs:66-72 | crates/xberg/src/rendering/table_scripts.rs:26-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/rendering/table_math.rs:66\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":"crates/xberg/src/rendering/table_math.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fd1f48593552a87f410e0d2f5b551879cd1c9cc57f76677dab70387025401d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/text/classification/chunk_classifier.rs:112-121 | crates/xberg/src/text/classification/page_classifier.rs:96-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/classification/chunk_classifier.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"830a71e2662cc9a6ecce2a99859be19a05d9959d3d89621155deaebfae2281c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/text/redaction/patterns/ip_address.rs:53-59 | crates/xberg/src/text/redaction/patterns/phone.rs:37-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/patterns/ip_address.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b664bd9f79a8575da99a77fa2eaa3d06b70bfc12098920e02a0ebcd504d00b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/transcription/engine.rs:609-615 | crates/xberg/src/transcription/engine.rs:617-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/transcription/engine.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a028a53c87e4787535460df6e3b89269adab2a23e783205b67649bc47ee9391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/xberg/src/extractors/docbook.rs:340-345 | crates/xberg/src/extractors/jats/mod.rs:316-321 | crates/xberg/src/extractors/latex/mod.rs:973-980 | crates/xberg/src/extractors/latex/mod.rs:1056-1061 | crates/xberg/src/extractors/orgmode.rs:769-774 | crates/xberg/src/extractors/typst.rs:477-482 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:340\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e9cf282f880928788a4608d4e8e38262c02b83a558e5403538b44937349bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg-native-pdf/src/fonts/font_dict.rs:825-830 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:7830-7835 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:7840-7845 \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 \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:825\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"42023fa1da48be9a4d1f58b3d7678dc012684ef27b890642835dfd8cd202ed0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/core/image_encode.rs:289-294 | crates/xberg/src/core/image_encode.rs:329-334 | crates/xberg/src/extraction/diagram/svg/mod.rs:54-59 \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 \u0060crates/xberg/src/core/image_encode.rs:289\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/image_encode.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c1e59e54975ec3e0cb5087ad094fbe4e81b500d5b778abb0ef749181d9869b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/extraction/docx/math/elements.rs:45-50 | crates/xberg/src/extraction/docx/math/elements.rs:404-409 | crates/xberg/src/extraction/docx/math/elements.rs:586-591 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/elements.rs:45\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfddf8b51cbf730d10db1871b9d7459ca33a901d3213553c42a2cc38b76cc752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:1003-1008 | crates/xberg/src/extractors/docbook.rs:1311-1316 | crates/xberg/src/extractors/docbook.rs:1371-1376 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1003\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"81aebb49a612ac699b3d1bcb937faa9c14096f2934d83ba747e750812fcbf40a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/extractors/fictionbook.rs:619-624 | crates/xberg/src/extractors/fictionbook.rs:1007-1012 | crates/xberg/src/extractors/fictionbook.rs:1068-1073 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc446ae8c91b5a4841a7a397e9195bc03077ccc641e45127387abff510cd21fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/extractors/jats/mod.rs:115-121 | crates/xberg/src/extractors/jats/parser.rs:362-368 | crates/xberg/src/extractors/jats/parser.rs:383-389 \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 \u0060crates/xberg/src/extractors/jats/mod.rs:115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/jats/mod.rs:122\u0060 calls \u0060push\u0060 and \u0060crates/xberg/src/extractors/jats/parser.rs:369\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"08254703ca1ae11faef1744a63736f35ae3b30536554a35eec147cb554fd2c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/ocr/hocr_parser.rs:338-344 | crates/xberg/src/ocr/hocr_parser.rs:849-855 | crates/xberg/src/ocr/hocr_parser.rs:1312-1318 \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":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d66e7c3a409b7f37a27df72e68bfd12338e538c8701d8e3f6802ccd39631b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1365-1367 | crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1378-1383 | crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1415-1420 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1378\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, \u0060crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1377\u0060 calls \u0060flatten\u0060, \u0060permute\u0060, \u0060i\u0060 and \u0060crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1365\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddc622c0a7425f8f542e4703f35aad6772c7ed0fd6cc1d50e8f4c45c8b8b3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/document/extract_api.rs:998-1004 | crates/xberg-native-pdf/src/document/extract_api.rs:1099-1104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:998\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"655ae1241dcfd3d24bab9b381d6d8b15354574c2495285475bebba1dd8043d71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/text/marked_content.rs:510-515 | crates/xberg-native-pdf/src/extractors/text/marked_content.rs:517-522 | crates/xberg-native-pdf/src/extractors/text/marked_content.rs:523-528 \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":"crates/xberg-native-pdf/src/extractors/text/marked_content.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f532de73ce18162755f015c8eda25750f46b837949bd673029d4f7af6190bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/mod.rs:1093-1099 | crates/xberg-native-pdf/src/extractors/text/mod.rs:1133-1139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/mod.rs:1093\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"f580fafed7a839c70af0c13fe6c1d87473d94672dd76db700a7ae5010b2c9eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/redaction/serialize.rs:250-255 | crates/xberg-native-pdf/src/redaction/serialize.rs:259-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/serialize.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"789ded48500d233529c894a9e8ddadc27867ba4e3df61e126d5003adfe0b44b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1329-1342 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1435-1440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8684e984fa8c23ee1a87e517c3f34fa4634e37be37373b9a7da52c692b4e4989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:4786-4793 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:4912-4919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:4786\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd047c682cdf2e2392ebff08fb21191b07991dda109ff2c34e5ef7226d031b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:6087-6092 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6756-6761 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6087}}}],"partialFingerprints":{"codehealthFindingId/v1":"113d0e4a1f2c687878b73624c8209e9b17c56162a37a83570bcfc6c277524b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/resolution/color.rs:216-221 | crates/xberg-native-pdf/src/rendering/resolution/color.rs:278-283 | crates/xberg-native-pdf/src/rendering/resolution/color.rs:331-334 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/resolution/color.rs:216\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg-native-pdf/src/rendering/resolution/color.rs:330\u0060 calls \u0060is_empty\u0060, \u0060Ok\u0060, \u0060decode_stream_data\u0060 and \u0060crates/xberg-native-pdf/src/rendering/resolution/color.rs:278\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/resolution/color.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f69cb6d59109b4919c007f2fc805f63e86b00f081f9e1198497ea767c49867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:384-389 | crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:402-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/text_rasterizer.rs:384\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c469e2d7ad6f578341899fde051295839d03788ecad9184f4b43ab44601cbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/structure/traversal.rs:290-295 | crates/xberg-native-pdf/src/structure/traversal.rs:405-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/traversal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6812f7e86bfb9f2e9e0b0164f9cd6af381b9b4492cef66e05e00cd9f0b673e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/font.rs:543-548 | crates/xberg-pdfium-render/src/pdf/font.rs:566-571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/font.rs:543\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/font.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"82de221dfdf946f9d260447fb5a4683aee2e498fbbcbd335881069519e2c9167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/api/handlers.rs:316-321 | crates/xberg/src/api/openweb.rs:215-220 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b49b6a4d91cb8717ad376378dd3b669f4f4466385f8aad96f4381a3e8a0a29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/engine/extract_impl.rs:131-138 | crates/xberg/src/engine/extract_impl.rs:381-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/engine/extract_impl.rs:131\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"18704b60121a8a0bf7db965957c9c71ae94f83fd9b86c6e7635ae18c930161bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/doc/list_numbers.rs:694-700 | crates/xberg/src/extraction/docx/parser.rs:608-614 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060u32\u0060 in one and \u0060i64\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e95ab099b6dafb463f9a4ffa7ed9477758ff8eff51da75d909ae64a8976dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extraction/docx/math/elements.rs:198-203 | crates/xberg/src/extraction/docx/math/elements.rs:289-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/elements.rs:198\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"028c0b711c8f0bb6dc7b33ae54896378a86c2625ad788a9eccc782f85e36974c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/excel/open.rs:816-824 | crates/xberg/src/extraction/excel/open.rs:845-853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/open.rs:816\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b8ece0a6fb68804d13201b2602fe93b169eca22f7d35dcf96f93ca73b2f5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extraction/ooxml_embedded/mod.rs:318-323 | crates/xberg/src/pdf/embedded_files.rs:183-188 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/ooxml_embedded/mod.rs:318\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ooxml_embedded/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"7175747a5293d06a0a6ff0aabc7b80546f2b4d8af3d2147e7f074fc304d61cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extraction/pptx/mod.rs:166-171 | crates/xberg/src/extraction/pptx/mod.rs:588-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pptx/mod.rs:166\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f5f3a1b335bf47a0520891c7c9696346e5497234559c40353a1b6c25874e0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extraction/pst/mod.rs:610-620 | crates/xberg/src/extraction/pst/mod.rs:682-692 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pst/mod.rs:610\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pst/mod.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f72b717606a75b6554fd1cf03b0cade3c70cb1499f3dc42688eaee8b3f5f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extraction/transform/elements.rs:148-153 | crates/xberg/src/types/document_structure.rs:57-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/transform/elements.rs:148\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/elements.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"060a51b0de7e1d9d3bdd71efdb30c1ad5c8f7652457d669f0045d86a074c9958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/doc.rs:84-90 | crates/xberg/src/extractors/ppt.rs:80-86 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/doc.rs:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/doc.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb54bddb61d5edd74fbce5dedf843d1bd5421197d9cd9aa1463d45b227d21c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:905-910 | crates/xberg/src/extractors/docbook.rs:913-918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:905\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"256ebceed2ff827bb90da78ed7b17a63cffb0be7f30146794d61ce8bd003fdb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/excel.rs:324-329 | crates/xberg/src/extractors/pptx.rs:416-421 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/excel.rs:330\u0060 calls \u0060get\u0060, \u0060cloned\u0060 and \u0060crates/xberg/src/extractors/pptx.rs:423\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1714cd7791895ee44a9e936379d29260e08b49bb764c36077efe0211388465ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:591-597 | crates/xberg/src/extractors/fictionbook.rs:886-892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:591\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e925ac90626fd702317dde6c6d8ebde777b5743a0882a7f475643bcaa27c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/image_photo_title.rs:644-649 | crates/xberg/src/extractors/image_photo_title.rs:692-697 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image_photo_title.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b50a7ca9e509b44f69b3740fc3f2419801354000042d39c7557bf2c0f1e529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/jats/elements.rs:101-107 | crates/xberg/src/extractors/jats/parser.rs:164-170 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/jats/elements.rs:101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6339b45294fefe225327181ff69821a031a42f8c74d4d34c8c436ba3c575b88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/document.rs:936-940 | crates/xberg/src/extractors/pdf/ocr/document.rs:1014-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/document.rs:936\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabf09aa0324454fcaca248a6a71c5edf634b13bcee8ed62844b1da69db018eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline/stored_scan_paint.rs:31-36 | crates/xberg/src/extractors/pdf/ocr/tall_source.rs:448-453 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/stored_scan_paint.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb9b78ffbbdcce060b40e246539028bd0aaff1273437c47c234882ceb44951e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/layout/models/rtdetr.rs:119-124 | crates/xberg/src/layout/models/rtdetr.rs:389-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/rtdetr.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8a19643bbac8b67b6c2453ecfae8d1bb81146f06fd994e17aaacbb86f83fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:7912-7917 | crates/xberg/src/pdf/structure/pipeline.rs:7982-7987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/pipeline.rs:7912\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":7912}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2efba83ee7f1d249cf381bb405d5ab722a4cb6280625c1dac71da599533b5c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/pdf/structure/regions/table_recognition.rs:1044-1050 | crates/xberg/src/pdf/structure/regions/table_recognition.rs:1609-1615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a947ed10443be8978e97f9a8946f5ad6c5d6db5091f4366339136eb8670d463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/rendering/docx.rs:51-56 | crates/xberg/src/rendering/pdf/blocks.rs:103-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/docx.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db126e504b2e7fd6158fc60a2a7efc9e110c52c41e36fe574fc6d833f836cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): crates/xberg/src/text/token_reduction/simd_text.rs:79-84 | crates/xberg/src/utils/quality/mod.rs:209-214 | tools/benchmark-harness/src/adapters/subprocess/support.rs:35-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/text/token_reduction/simd_text.rs:79\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/token_reduction/simd_text.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7823fd680728862552eb77f2deb853797fd1e2cbc5a25ab3a5ae4e3a6cb95f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/xberg/src/extractors/excel.rs:400-404 | crates/xberg/src/extractors/iwork/keynote.rs:202-206 | crates/xberg/src/extractors/iwork/numbers.rs:1333-1337 | crates/xberg/src/extractors/iwork/pages.rs:165-169 | crates/xberg/src/extractors/ppt.rs:79-83 | crates/xberg/src/extractors/pptx.rs:530-534 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/iwork/keynote.rs\u0060 and \u0060crates/xberg/src/extractors/iwork/pages.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/excel.rs:400\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc0cb90ad84f14b1e9eff0d780b5cdb2305b8de3212ae93e31dc436d23d2cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/xberg/src/extractors/docx.rs:1040-1044 | crates/xberg/src/extractors/iwork/keynote.rs:201-205 | crates/xberg/src/extractors/iwork/numbers.rs:1332-1336 | crates/xberg/src/extractors/iwork/pages.rs:164-168 | crates/xberg/src/extractors/ppt.rs:78-82 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/iwork/keynote.rs\u0060 and \u0060crates/xberg/src/extractors/iwork/pages.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docx.rs:1040\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0026ddc043c572f4a3f13b01b523eafc44e1629e6c2bfcb9a8a90c6c90f64752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs:39-43 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs:52-56 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_japan1.rs:35-39 | crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_korea1.rs:37-41 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs\u0060 and \u0060crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_gb1.rs\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cid_mappings/adobe_cns1.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ebaeaa8084c6b18102505b9f1daaa6158d98a3899f8549e33fd7e990879270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/xberg/src/extractors/docx.rs:1452-1458 | crates/xberg/src/extractors/odp.rs:552-558 | crates/xberg/src/extractors/odt.rs:1959-1965 | crates/xberg/src/extractors/rtf/mod.rs:386-392 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/odp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docx.rs:1452\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23e74f69bcc120e822970cc89edb8d360be4850471242da9cc3842870e448b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/xberg/src/extractors/docx.rs:1460-1466 | crates/xberg/src/extractors/odp.rs:557-563 | crates/xberg/src/extractors/odt.rs:1964-1970 | crates/xberg/src/extractors/rtf/mod.rs:394-400 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/odp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docx.rs:1460\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01fc1d7e1c0f7223691e633fa2876b77eebd626372a69cdfdc1cc4f1726537d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/xberg/src/rendering/djot.rs:357-361 | crates/xberg/src/rendering/html.rs:171-175 | crates/xberg/src/rendering/markdown.rs:300-304 | crates/xberg/src/rendering/plain.rs:392-396 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/rendering/djot.rs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b02edafd7c95d064355f3d57049cd15ffd8399c424dd4933b621255be15d88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/hierarchical.rs:110-115 | crates/xberg-native-pdf/src/extractors/synthetic_structure.rs:209-214 | crates/xberg-native-pdf/src/structure/converter.rs:106-111 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/extractors/synthetic_structure.rs\u0060 and \u0060crates/xberg-native-pdf/src/structure/converter.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/hierarchical.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/hierarchical.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b2384f1e543eb9af0400675019bd03a92cc1c10c2656a3ad92353ec676cc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/images.rs:4548-4553 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:3769-3777 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:4305-4309 \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 \u0060crates/xberg-native-pdf/src/extractors/images.rs:4548\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060doc\u0060 to \u0060Option\u003C\u0026crate::document::PdfDocument\u003E\u0060 in one and \u0060\u0026PdfDocument\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":4548}}}],"partialFingerprints":{"codehealthFindingId/v1":"807454fe2abd727fc0f665b7a731355c1107deb303401c3d97f307dd4c5e40a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/paths.rs:665-670 | crates/xberg-native-pdf/src/extractors/paths.rs:678-683 | crates/xberg-native-pdf/src/extractors/paths.rs:690-695 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/paths.rs:665\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/paths.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c3dee35d8e49ab05dc998eb139239f9adbbc7a68dc61147309fe966347ff64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/knockout.rs:255-259 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1585-1589 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:1736-1740 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/knockout.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"585dac8547b15ca1b1b0e13463e34feb6b943a5e05d622c56ddca018665b063f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/extraction/ooxml_embedded/mod.rs:318-322 | crates/xberg/src/extractors/email.rs:533-537 | crates/xberg/src/pdf/embedded_files.rs:183-187 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ooxml_embedded/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3365f55b7e727b2c427d7f2a3988b47576b412833da0d63a22b8221a0cb397f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:921-925 | crates/xberg/src/extractors/docbook.rs:929-933 | crates/xberg/src/extractors/docbook.rs:1225-1229 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:921\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ad8a76782bb5ed9f8153252b11b9ea2cc66a4683e1052d16d95ec00c93a395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/extractors/iwork/keynote.rs:220-224 | crates/xberg/src/extractors/iwork/numbers.rs:1351-1355 | crates/xberg/src/extractors/iwork/pages.rs:183-187 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/iwork/keynote.rs\u0060 and \u0060crates/xberg/src/extractors/iwork/pages.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/iwork/keynote.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb44a9fec30fe0ef456b11fb14789f395dac3cb9b2ed354b9ebfc8f469725d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extractors/odp.rs:545-552 | crates/xberg/src/extractors/odt.rs:1952-1959 | crates/xberg/src/extractors/rtf/mod.rs:379-386 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/odp.rs\u0060 and \u0060crates/xberg/src/extractors/odt.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/odp.rs:545\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec66c9946d4fd43a404bd66fbaab923f63cf45daea0c8b8b4138586a293cb85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/extractors/pdf/ocr/document.rs:934-939 | crates/xberg/src/extractors/pdf/ocr/document.rs:1012-1017 | crates/xberg/src/pdf/structure/classify.rs:1815-1820 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3376c2463d118eea5b2b9514953b91d27b2110226ac1c2a294146e134689c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/extractors/typst.rs:815-820 | crates/xberg/src/extractors/typst.rs:829-834 | crates/xberg/src/extractors/typst.rs:843-848 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/typst.rs:815\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56c81240d7096e5c0db2ff66811a86d12c0d4a37732e33861852014ddd6ec4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/text/classification/chunk_classifier.rs:115-119 | crates/xberg/src/text/classification/page_classifier.rs:99-103 | crates/xberg/src/text/classification/page_classifier.rs:107-111 \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 \u0060crates/xberg/src/text/classification/chunk_classifier.rs:115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/classification/chunk_classifier.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb50a2231bf6dd8450bdd9adb7ddddb4e79d4bdb35f90f1300d9adc5c9d4f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:732-739 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:798-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe09ee5ef7409bf43834c35a6571959c4df7e7eb1ac3b56cca6764db30442ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): crates/xberg-native-pdf/src/document/extract_api.rs:590-591 | crates/xberg-native-pdf/src/document/extract_api.rs:1461-1465 | crates/xberg-native-pdf/src/document/extract_api.rs:1836-1840 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/extract_api.rs:590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"2761fd815343136d60b51ffa3a118118a2ff739afa9ed25ee01868d1a2d70d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/document/extract_api.rs:1506-1512 | crates/xberg-native-pdf/src/document/extract_api.rs:1868-1874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/document/extract_api.rs:1513\u0060 calls \u0060is_empty\u0060, \u0060Ok\u0060 and \u0060crates/xberg-native-pdf/src/document/extract_api.rs:1875\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7145d51ce1116570031ffcaf56d6fe9517aed5eab367d290097b31aba55f4a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/document/tables.rs:615-620 | crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:5126-5131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/document/tables.rs:615\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f51586fccef87c8bba09fbc26b78624617c848d7e9ba71276e9f27c3b5f962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:392-396 | crates/xberg-native-pdf/src/extractors/images.rs:420-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/images.rs:392\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c47937743bfa8c394a83222f6cbbe7a8fad523e5450b7a7b3d138ef3d0d396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:2686-2691 | crates/xberg-native-pdf/src/extractors/images.rs:2806-2811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4be7a892d1abd5bed2a1e79ca906c336ed7b52c72cc5465e13e691e75ac6ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/text/advance.rs:163-168 | crates/xberg-native-pdf/src/extractors/text/mod.rs:2248-2253 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/text/advance.rs:163\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2150f15940d86c26cc3144c33425238c125d91af03f4aeb1453bab11d62da65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/redaction/serialize.rs:313-318 | crates/xberg-native-pdf/src/redaction/serialize.rs:399-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/redaction/serialize.rs:313\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/redaction/serialize.rs:319\u0060 calls \u0060push\u0060 and \u0060crates/xberg-native-pdf/src/redaction/serialize.rs:405\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/serialize.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1371bddbd1d0a67ca75f2b6e224b780af71b2d664af57aa8c1aac6a9dbf36d93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2641-2645 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:2046-2050 \u2014 before extracting anything, compare \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060 and \u0060crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 178 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2641\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2641}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1b98fdd3f7d1212923b38963cdd245a4670c7718d2296d66ce87a2d57b51c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 5): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5318-5319 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6156-6160 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6331-6332 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6396-6400 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6903-6904 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:6156\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:6395\u0060 calls \u0060clamp\u0060, \u0060round\u0060 and \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:5317\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5318}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dd6c891e5c171d53d1223128f4cc7ddfc4bd54baef0fe51aa9d92f9d5d78bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/sidecar.rs:1105-1112 | crates/xberg-native-pdf/src/rendering/sidecar.rs:1200-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4124730322909fc24d5447275dc279e4152b33a2cfde3b5b9ea98116093054a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-paddle-ocr/src/ocr_lite.rs:47-51 | crates/xberg-paddle-ocr/src/ocr_utils.rs:93-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/ocr_lite.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"881fe26e561029d2ac8e612b0f55271bac922b9058039fe3438e6dee7abaaca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-tesseract/src/result_iterator.rs:296-301 | crates/xberg-tesseract/src/result_iterator.rs:318-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/result_iterator.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"146afeaec6adc1ff7ab130e2b1010095d749cbc67c4fd581961e6cb0aa3e7a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): crates/xberg/src/extraction/excel/open.rs:532-536 | crates/xberg/src/extraction/excel/open.rs:543-547 | crates/xberg/src/extraction/excel/open.rs:688-689 \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":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ae847ec5b4ccfdd00b5fe1fe75148991ea603f5bfae1bde2f247b5ab2ef554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extraction/pptx/parser.rs:231-235 | crates/xberg/src/extraction/pptx/parser.rs:461-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/pptx/parser.rs:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef3ab4b0eb285a80486075911b5d9446d139e24819da2024a3431d9ce27407b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extractors/docx.rs:820-830 | crates/xberg/src/extractors/wordperfect.rs:657-667 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docx.rs\u0060 and \u0060crates/xberg/src/extractors/wordperfect.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 \u0060crates/xberg/src/extractors/docx.rs:820\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extractors/docx.rs:831\u0060 calls \u0060is_mergeable\u0060 and \u0060crates/xberg/src/extractors/wordperfect.rs:668\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f8558f7660d801c1049092d23d28bfa14a54b401fbf571923de84008326d7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/epub/content.rs:610-614 | crates/xberg/src/extractors/vtt.rs:347-351 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/epub/content.rs:610\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfcdd3cc8fd3377d69128c2be301890014b994e48375032894db0c316588b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:143-148 | crates/xberg/src/extractors/jats/parser.rs:115-119 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/parser.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"018c83f32146833c1b2596b4be26ce888b5fc8da0bf60984f0439a06b3ca4cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/iwork/keynote.rs:130-134 | crates/xberg/src/extractors/iwork/pages.rs:85-89 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/iwork/keynote.rs\u0060 and \u0060crates/xberg/src/extractors/iwork/pages.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd03d2e143c39123cf747bddde5703f086818b760d7d77323ff4baceafa2ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/iwork/numbers.rs:302-306 | crates/xberg/src/extractors/iwork/numbers.rs:362-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/iwork/numbers.rs:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/numbers.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ff7c1bf5506d6668e199d22e124f3c514d7c75151ee104ff3290d67e483230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/odp.rs:433-441 | crates/xberg/src/extractors/odt.rs:1840-1848 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/odp.rs\u0060 and \u0060crates/xberg/src/extractors/odt.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 237 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2077328bf3c4aa68c70c7828099d0ab2ec7e807a8ff97bbfecb871e4d51ed2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1814-1819 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:3302-3307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1814\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b447c8bcf848323ca7dcbbffaf7644a187535f56152206042e567d8a32b1873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1996-2000 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2229-2233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:1996\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"405e289b59e428f5abae203cb70d4af715bc8da8c478455d17cf56b9bfb76c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/layout/models/slanet.rs:218-224 | crates/xberg/src/layout/models/tatr.rs:219-225 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbafcb5627ad7c6c1af7c1802aade382eec41f68c267a38c4feb47ab3fe7660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/mcp/server.rs:194-198 | crates/xberg/src/mcp/server.rs:228-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/mcp/server.rs:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"275d966b2e64e10bbb07840c4cce22e788c9de9937488307004402ea7f577829"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/mcp/server.rs:718-722 | crates/xberg/src/mcp/server.rs:731-735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/mcp/server.rs:718\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"657ae64cdc7eeca4eb740605098f4e9848dff09ce3ec92ebf68c04b4f047224b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/ocr/hocr_parser.rs:1224-1228 | crates/xberg/src/ocr/hocr_parser.rs:1256-1260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/hocr_parser.rs:1224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f4327b0f73f7b16550f6aa32e86244f6a7cd78d804aa34046e6c5021f0e3a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/table_core.rs:1597-1602 | crates/xberg/src/table_core.rs:1603-1608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/table_core.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e08dbf3df307632c8afdd4c54904281787934ff67d7f491f0620bb23ac1f8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-gliner/src/tokenizer.rs:14-18 | crates/xberg-gliner/src/v2/tokenizer.rs:33-37 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/tokenizer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"437b4d1856bca3c222d81bb8aa5f3eae71617f414366a501d277bdd20db40113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg-native-pdf/src/content/parser.rs:3716-3723 | crates/xberg-native-pdf/src/decoders/ascii_hex.rs:46-53 | crates/xberg/src/extractors/rtf/encoding.rs:11-18 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3716}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe0220af6a868d39eda1936389f2a43e6a000eda55dba2f38e9dfb16af84443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/xberg-native-pdf/src/extractors/forms.rs:220-226 | crates/xberg-native-pdf/src/extractors/page_labels.rs:148-154 | crates/xberg-native-pdf/src/extractors/xmp.rs:203-209 | crates/xberg-native-pdf/src/xfa/extractor.rs:135-141 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060doc\u0060 to \u0060\u0026PdfDocument\u0060 in one and \u0060\u0026mut PdfDocument\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/forms.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd229c66df556addfead526b12a6dc3109aaff38952916d459aaa184b0c9196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg-native-pdf/src/fdf/fdf_writer.rs:159-169 | crates/xberg-native-pdf/src/fdf/xfdf_writer.rs:41-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fdf/fdf_writer.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee60795a1de401fc009411e5a657f4d152a19600514ca048b8ee04a773bed984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:5739-5750 | crates/xberg-native-pdf/src/text/ligature_processor.rs:120-131 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":5739}}}],"partialFingerprints":{"codehealthFindingId/v1":"768189569e00c2321d51cbd345500893c1316fb975be49c66de1f5475c0037d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/xberg-native-pdf/src/lib.rs:225-234 | crates/xberg/src/engine/structured/prompts.rs:33-42 | crates/xberg/src/text/summarization/llm.rs:47-56 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/lib.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"264754055c6493934b92e0be5b0f5950546c041ac57152d75caddbb47205e149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/structure/types.rs:325-330 | crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:106-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/types.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"685833958ed7d526706d32f57324121f2660249de906645a4c20f7b793c94dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/text/word_boundary.rs:694-707 | crates/xberg/src/rendering/pdf/layout.rs:814-825 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/text/word_boundary.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc6097f7960db28de86bda3b57328f1d611a99041d340b35438aadf3996e8c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/object.rs:988-992 | crates/xberg-pdfium-render/src/pdf/document/page/object/private.rs:291-295 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2f2e3c17c19b39bcd7754a8fdd81dc4c2e564ec4955da5a0b829988699f617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/candle_ocr/ocr_result.rs:195-199 | crates/xberg/src/llm/vlm_ocr.rs:310-314 \u2014 before extracting anything, compare \u0060crates/xberg/src/candle_ocr/ocr_result.rs\u0060 and \u0060crates/xberg/src/llm/vlm_ocr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/ocr_result.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"671adcc192e42bcc635a142849eab27a6a801ff66303ea01c7627b5d05a81b34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/embeddings/mod.rs:174-185 | crates/xberg/src/reranking/mod.rs:122-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/embeddings/mod.rs:174\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f4ebf43bfdfbfab6a21dbd1d7f37ba1e233181e4742ac3ed29932ce77b7cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extraction/doc/images.rs:190-194 | crates/xberg/src/extraction/office_art.rs:98-102 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/images.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a4e98986819d726aea92dd2620d758043c560a7b28d0287e48a5a9aa37298e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/excel/table_budget.rs:255-261 | crates/xberg/src/extraction/excel/table_budget/legacy.rs:261-267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5992b1705a406e72fc4da8a49ad17780eb98dff91ae22608508180fff002f26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/image.rs:1334-1340 | crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs:34-41 \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 \u0060config\u0060 to \u0060\u0026crate::core::config::OcrConfig\u0060 in one and \u0060\u0026OcrConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c4c5c243dc000869e779ad7ac3296561f1996108c1f80d69b0984ea79afa84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/pdf/ink_probe.rs:228-233 | crates/xberg/src/extractors/pdf/unreadable_script.rs:612-617 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ink_probe.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11bd4c4b9aef1886b07ae91f317ae29c8047c1310edc38c98d1b6c6c848cc6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extractors/pdf/ocr/document.rs:2534-2541 | crates/xberg/src/extractors/pdf/ocr/document.rs:3800-3807 | crates/xberg/src/paddle_ocr/backend.rs:1177-1184 \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 \u0060crates/xberg/src/extractors/pdf/ocr/document.rs:2534\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b19ebd5b20a17ec41fd6dac5113c0698d9dd340b04c055a63de3c3f5378dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs:835-842 | crates/xberg/src/ocr/caption_grid_proof.rs:71-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060other\u0060 to \u0060\u0026Self\u0060 in one and \u0060Self\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"448ce68d16cef30cf12e96a9f5a28670901ee6d6f9cc218a9edf431d2eddf111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs:351-356 | crates/xberg/src/pdf/structure/pipeline.rs:5778-5783 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c975a4b889ba71d076991c3274db42400fbcfe0497fba6e5cd759492b97a67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/rendering.rs:76-80 | crates/xberg/src/pdf/render.rs:635-639 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2a260f8c89058ac4193d25b9f4171b37206e62591baf371b87824f708803ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/ocr/conversion.rs:325-335 | crates/xberg/src/sceptre_ocr/blocks.rs:176-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/conversion.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"303e683eb35da35ad2e901dad3ef4703aab80a025b393f5d1ff0532b12d39364"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/pdf/native/table.rs:2353-2360 | crates/xberg/src/pdf/structure/paragraphs.rs:433-440 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"e012e1fe32930cfcb1053fc74ce9669c1d6bfe65543630091b1c99758bcaf075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/xberg/src/plugins/registry/embedding.rs:135-141 | crates/xberg/src/plugins/registry/ocr.rs:426-432 | crates/xberg/src/plugins/registry/tokenizer.rs:139-145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/embedding.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a0ee182d3cb22b7b94745bde7a3e8efdffd44298f96af2fab0e6e27ccc199c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/plugins/registry/ocr.rs:418-423 | crates/xberg/src/plugins/registry/reranker.rs:95-100 | crates/xberg/src/plugins/registry/tokenizer.rs:131-136 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/ocr.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"128e3b871d9f845ea0462c977e0f72661621fe48e6be5412689a13ad258b2e52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/utils/quality/mod.rs:346-353 | crates/xberg/src/utils/string_utils.rs:133-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/utils/quality/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6e8faf6dbf2ee5632ff82421ba885f4c181c47be4606fbc68b6e329d8aab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-libheif/src/context.rs:183-192 | crates/xberg-libheif/src/image_handle.rs:137-146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/context.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"49804ba77a42d7e5b0f513b904165dd29f9e55ff467a6604e7de66358407a4f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-libheif/src/decoder.rs:292-296 | crates/xberg-libheif/src/encoder.rs:357-361 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/decoder.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee5793dc8345759b0bd2e9fd66f6a166f9d2fc8dc30bc5566fb132e1caf4ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page.rs:378-385 | crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:296-303 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8d3e4df7554de5a5911e0515f098e99cce002a2ef60734aa95e54ccabae215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 11): crates/xberg-pdfium-render/src/pdf/document/page/annotation/circle.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/free_text.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/highlight.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/ink.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/link.rs:31-38 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/square.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/squiggly.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/stamp.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/strikeout.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/text.rs:29-36 | crates/xberg-pdfium-render/src/pdf/document/page/annotation/underline.rs:29-36 \u2014 before extracting anything, compare \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/circle.rs\u0060 and \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/free_text.rs\u0060 as WHOLE FILES: 84% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/circle.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/highlight.rs:40\u0060 calls \u0060attachment_points_mut\u0060 and \u0060crates/xberg-pdfium-render/src/pdf/document/page/annotation/circle.rs:37\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/annotation/circle.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54a62a3b5db2264bc7ed5286ba28eedd054c7b33b7357b2a2ccd124c24d0b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs:314-323 | crates/xberg-pdfium-render/src/pdf/document/page/struct_tree.rs:35-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/struct_element.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1f1bcfd8d884eca25b9542e6ee967cfbdc22f5a84f1e5a9d78610f954d0d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/quad_points.rs:97-103 | crates/xberg-pdfium-render/src/pdf/rect.rs:64-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-pdfium-render/src/pdf/quad_points.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/quad_points.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9237a2262d7f456aff8d34b0aff7a7665f4a115e7d3ed7cadb76f306a34fbcaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/xberg-tesseract/src/api.rs:862-866 | crates/xberg-tesseract/src/api.rs:891-895 | crates/xberg-tesseract/src/api.rs:1398-1402 | crates/xberg-tesseract/src/api.rs:1413-1417 | crates/xberg-tesseract/src/monitor.rs:34-38 \u2014 there are 5 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 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f9dfd87efc901355eaa94b5c616bbc78a6f7d4afa21e8c7d5bad2bf8877d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/xberg-tesseract/src/api.rs:975-979 | crates/xberg-tesseract/src/api.rs:1138-1142 | crates/xberg-tesseract/src/api.rs:1170-1174 | crates/xberg-tesseract/src/page_iterator.rs:76-80 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"05840fde64e9daea50daff6b7dd75bf519a6328cdbbc934204e97d67022058a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/myst.rs:593-598 | crates/xberg/src/extractors/pdf/ocr/symbol_noise_lines.rs:103-108 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/myst.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae63aaae49cebf689507b4ddfe7458d9d149f0f5d7bcd619f65c59152ba9c2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/pdf/structure/lines.rs:55-64 | crates/xberg/src/pdf/structure/pipeline.rs:7863-7873 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/lines.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f4a5d67f561959599feed0d46a50b87ebba76e7d9a13cd5b0668c9206fc604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 14): crates/xberg/src/plugins/embedding.rs:118-124 | crates/xberg/src/plugins/embedding.rs:134-140 | crates/xberg/src/plugins/extractor/mod.rs:26-32 | crates/xberg/src/plugins/extractor/mod.rs:42-48 | crates/xberg/src/plugins/ocr.rs:578-585 | crates/xberg/src/plugins/ocr.rs:611-618 | crates/xberg/src/plugins/renderer.rs:99-105 | crates/xberg/src/plugins/renderer.rs:112-118 | crates/xberg/src/plugins/reranker.rs:117-123 | crates/xberg/src/plugins/reranker.rs:134-140 | crates/xberg/src/plugins/tokenizer.rs:111-117 | crates/xberg/src/plugins/tokenizer.rs:127-133 | crates/xberg/src/plugins/validator/mod.rs:14-21 | crates/xberg/src/plugins/validator/mod.rs:25-32 \u2014 before extracting anything, compare \u0060crates/xberg/src/plugins/ocr.rs\u0060 and \u0060crates/xberg/src/plugins/renderer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060backend\u0060 to \u0060Arc\u003Cdyn EmbeddingBackend\u003E\u0060 in one and \u0060Arc\u003Cdyn OcrBackend\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/embedding.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"657b16961bcd012b634fe90d7ec95e8c682b052b7b05e2c9416118946f5993df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): crates/xberg/src/plugins/embedding.rs:150-156 | crates/xberg/src/plugins/extractor/mod.rs:68-74 | crates/xberg/src/plugins/ocr.rs:839-846 | crates/xberg/src/plugins/renderer.rs:142-148 | crates/xberg/src/plugins/reranker.rs:151-157 | crates/xberg/src/plugins/tokenizer.rs:143-149 | crates/xberg/src/plugins/validator/mod.rs:45-52 \u2014 before extracting anything, compare \u0060crates/xberg/src/plugins/ocr.rs\u0060 and \u0060crates/xberg/src/plugins/renderer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/embedding.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"948897b6dafec41b573359ea1190ed66717af89b37b69b8e050f501e21f98f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 8): crates/xberg/src/plugins/embedding.rs:162-168 | crates/xberg/src/plugins/extractor/mod.rs:51-58 | crates/xberg/src/plugins/ocr.rs:641-648 | crates/xberg/src/plugins/processor/registry.rs:28-35 | crates/xberg/src/plugins/renderer.rs:125-131 | crates/xberg/src/plugins/reranker.rs:164-170 | crates/xberg/src/plugins/tokenizer.rs:155-161 | crates/xberg/src/plugins/validator/mod.rs:35-42 \u2014 before extracting anything, compare \u0060crates/xberg/src/plugins/ocr.rs\u0060 and \u0060crates/xberg/src/plugins/renderer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/embedding.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bae4160e4f1fd9c28fcbb152454643021b606370d102dfde0666b078c3a520"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/plugins/ocr.rs:865-878 | crates/xberg/src/plugins/renderer.rs:166-179 \u2014 before extracting anything, compare \u0060crates/xberg/src/plugins/ocr.rs\u0060 and \u0060crates/xberg/src/plugins/renderer.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/ocr.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c1e03b3eed2321d99f79a782f2ea419e148e7a9eb5f8f517ec1e8330e837ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 10): crates/xberg/src/types/djot.rs:35-40 | crates/xberg/src/types/formats.rs:169-174 | crates/xberg/src/types/formats.rs:670-675 | crates/xberg/src/types/formats.rs:727-732 | crates/xberg/src/types/metadata.rs:716-721 | crates/xberg/src/types/metadata.rs:756-761 | crates/xberg/src/types/metadata.rs:796-801 | crates/xberg/src/types/metadata.rs:836-841 | crates/xberg/src/types/ocr_elements.rs:52-57 | crates/xberg/src/types/page.rs:93-98 \u2014 there are 10 copies across 5 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 10 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/djot.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"76207ad51b0cdfa90c27f81e16347e3211d8e7593fde46b4ee45043eeb216a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/separation_renderer.rs:895-917 | crates/xberg-native-pdf/src/rendering/separation_renderer.rs:938-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadfac3ca35ca4da586a54483fb4b7510dc3b3c33cb8aad3fa3d733628a69c99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:4619-4630 | crates/xberg-native-pdf/src/fonts/font_dict.rs:5028-5044 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:4619\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":4619}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d689a49472c8c6ee471729d3f25d71ba7371d3e3665091405b528c801aea707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/xberg/src/extraction/docx/table/mod.rs:263-277 | crates/xberg/src/extraction/docx/table/mod.rs:437-451 | crates/xberg/src/extraction/docx/table/mod.rs:487-501 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/table/mod.rs:263\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74055710f0deaebbaa2357eeaf16a1c2c27f9fa09909b288fc6c1362948b7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/xberg/src/extraction/docx/table/mod.rs:638-652 | crates/xberg/src/extraction/docx/table/mod.rs:699-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/table/mod.rs:638\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3020df6c022c544dee48303e9c35e1293579c430a1acbe66f91470bca856f003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:493-506 | crates/xberg/src/extractors/jats/mod.rs:507-520 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 111 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:493\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fbba74d3899271aad243b694b97be079fe92e59e7c12791e0cdc57a47cb2b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/xberg/src/plugins/registry/embedding.rs:106-119 | crates/xberg/src/plugins/registry/reranker.rs:74-87 | crates/xberg/src/plugins/registry/tokenizer.rs:110-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/plugins/registry/embedding.rs:106\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/embedding.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e959b8ae2473d7673dfa2807a001489cf0d20ad70f7d0b2fc4af4722a060084a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/xberg/src/pdf/structure/classify.rs:1897-1910 | crates/xberg/src/pdf/structure/classify.rs:2250-2263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/structure/classify.rs:1897\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c39d9ef74a5e5d98020cd44dc5bef820929bab84a659d55ae380ba6538071b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/api/handlers.rs:1026-1038 | crates/xberg/src/api/handlers.rs:1040-1051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/api/handlers.rs:1026\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/handlers.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a51609ecbc3912069024fc7bed6b535710052993bedb11da7d013f4f9e1c783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs:354-366 | crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs:312-324 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs:354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b9363b21e79f0a22fd0f0fd6452fc64016044e9884d0a2c4baf920d22ac13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extraction/docx/math/elements.rs:218-230 | crates/xberg/src/extraction/docx/math/elements.rs:310-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/elements.rs:218\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67bbd61389ae127bb7dd7bf8c7fd11a3ecdcb511ccf9eb57796c243291e02fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/chunking/vectors.rs:44-55 | crates/xberg/src/chunking/vectors.rs:104-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/chunking/vectors.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060vectors\u0060 to \u0060Vec\u003Ccrate::SparseEmbedding\u003E\u0060 in one and \u0060Vec\u003Ccrate::MultiVectorEmbedding\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/vectors.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4f96347fa6a43eb2c34b32adbb2dbec5d90fc09078dd59c0e52b55dccfca0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/xberg/src/extraction/archive/tar.rs:152-177 | crates/xberg/src/extraction/archive/zip.rs:147-172 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/archive/tar.rs\u0060 and \u0060crates/xberg/src/extraction/archive/zip.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/archive/tar.rs:152\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/tar.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"390df33d2df8bc1f1f7886e815f0942b85e25560f81a2c535699176dc4d4ca6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/ort_discovery.rs:498-507 | crates/xberg/src/ort_discovery.rs:517-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ort_discovery.rs:498\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ort_discovery.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c76dc69c9be81683d770bc84350b8b72d077a3cacb1e59361ff257ad33347a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/xberg/src/extraction/archive/tar.rs:243-255 | crates/xberg/src/extraction/archive/zip.rs:240-252 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/archive/tar.rs\u0060 and \u0060crates/xberg/src/extraction/archive/zip.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/archive/tar.rs:243\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/tar.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4f04213c0317a281dc4b98c21c229bfb8f0789a066acd042a2bd1d817a1df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/plugins/registry/extractor.rs:458-469 | crates/xberg/src/plugins/registry/validator.rs:139-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/plugins/registry/extractor.rs:458\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/extractor.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dad041be5a30fe196a9c54fd893c3505b219f194e143036fde0311611892207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extraction/excel.rs:812-823 | crates/xberg/src/rendering/common.rs:616-627 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel.rs:812\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 before the matched lines, \u0060crates/xberg/src/extraction/excel.rs:810\u0060 calls \u0060push_str\u0060 and \u0060crates/xberg/src/rendering/common.rs:614\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"8786a2f17761d33422ddf0b9b1a78eb0b97f2c722c08f8478908d272ad724640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/api/startup.rs:37-48 | crates/xberg/src/mcp/server.rs:1146-1157 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/api/startup.rs:37\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/startup.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e068a5b507bb44401700e6474fdecff1716b4fd31b3eae5f5739514720e611a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 10): crates/xberg/src/extraction/docx/math/collect.rs:151-162 | crates/xberg/src/extraction/docx/math/collect.rs:188-199 | crates/xberg/src/extraction/docx/math/collect.rs:227-238 | crates/xberg/src/extraction/docx/math/elements.rs:341-352 | crates/xberg/src/extraction/docx/math/elements.rs:446-457 | crates/xberg/src/extraction/docx/math/elements.rs:486-497 | crates/xberg/src/extraction/docx/math/elements.rs:526-537 | crates/xberg/src/extraction/docx/math/elements.rs:714-725 | crates/xberg/src/extraction/docx/math/elements.rs:754-765 | crates/xberg/src/extraction/docx/math/elements.rs:823-834 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/docx/math/collect.rs\u0060 and \u0060crates/xberg/src/extraction/docx/math/elements.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/collect.rs:151\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/collect.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4b4735cde59cee924e39cc330125c7c87c2f04b014af84fc9527a870331c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 11): crates/xberg/src/extraction/docx/math/collect.rs:153-164 | crates/xberg/src/extraction/docx/math/collect.rs:190-201 | crates/xberg/src/extraction/docx/math/collect.rs:229-240 | crates/xberg/src/extraction/docx/math/elements.rs:258-269 | crates/xberg/src/extraction/docx/math/elements.rs:343-354 | crates/xberg/src/extraction/docx/math/elements.rs:448-459 | crates/xberg/src/extraction/docx/math/elements.rs:488-499 | crates/xberg/src/extraction/docx/math/elements.rs:528-539 | crates/xberg/src/extraction/docx/math/elements.rs:716-727 | crates/xberg/src/extraction/docx/math/elements.rs:756-767 | crates/xberg/src/extraction/docx/math/elements.rs:825-836 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/docx/math/collect.rs\u0060 and \u0060crates/xberg/src/extraction/docx/math/elements.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/collect.rs:153\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/collect.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f9e61612aa290b7fa6c006c5bf2a16450bfc8e6ce60885297ba3d94627d7ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/xberg/src/extraction/docx/table/mod.rs:263-274 | crates/xberg/src/extraction/docx/table/mod.rs:336-347 | crates/xberg/src/extraction/docx/table/mod.rs:437-448 | crates/xberg/src/extraction/docx/table/mod.rs:487-498 \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 \u0060crates/xberg/src/extraction/docx/table/mod.rs:263\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2706b6bab8483cc6715923293d6214493cf0ccb91bc2fbd99f1cca98b02dbf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): crates/xberg/src/extraction/docx/math/elements.rs:24-35 | crates/xberg/src/extraction/docx/math/elements.rs:96-107 | crates/xberg/src/extraction/docx/math/elements.rs:163-174 | crates/xberg/src/extraction/docx/math/elements.rs:380-391 | crates/xberg/src/extraction/docx/math/elements.rs:565-576 | crates/xberg/src/extraction/docx/math/elements.rs:630-641 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/elements.rs:24\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 before the matched lines, \u0060crates/xberg/src/extraction/docx/math/elements.rs:160\u0060 calls \u0060collect_children\u0060 and \u0060crates/xberg/src/extraction/docx/math/elements.rs:21\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8b80ea3a007b59f7710e5b6c1d888795e8e65161e233b4073ff444ad209a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): crates/xberg-native-pdf/src/fonts/font_dict.rs:1395-1411 | crates/xberg-native-pdf/src/fonts/font_dict.rs:1424-1442 | crates/xberg-native-pdf/src/fonts/font_dict.rs:1464-1480 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:1424\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:1444\u0060 calls \u0060is_empty\u0060 and \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:1413\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"923613448063361b8d2d7eabc02a5912f959615c4d6a842a6adbf5406a5c80d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:3972-3982 | crates/xberg/src/extraction/docx/parser.rs:4004-4014 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:3972\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3972}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce90b58e0c1bc4227fd7fd48f0f5cd2bbdd02c02ce262bfe744a2fb75849f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/xberg/src/layout/models/slanet.rs:152-167 | crates/xberg/src/layout/models/tatr.rs:172-188 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/layout/models/slanet.rs:152\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a31b2679abdb836a1c052e78f39df76a7e98c258c0800e0a4c850ba1bb89889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/xberg/src/layout/models/pp_doclayout_v3.rs:315-325 | crates/xberg/src/layout/models/rtdetr.rs:176-186 \u2014 before extracting anything, compare \u0060crates/xberg/src/layout/models/pp_doclayout_v3.rs\u0060 and \u0060crates/xberg/src/layout/models/rtdetr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/layout/models/pp_doclayout_v3.rs:315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/pp_doclayout_v3.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b99fd5b953f722cc23bc62f0c85696e25ab811767822a7c6fabceb3d253fc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/layout/models/pp_doclayout_v3.rs:287-297 | crates/xberg/src/layout/models/rtdetr.rs:146-155 \u2014 before extracting anything, compare \u0060crates/xberg/src/layout/models/pp_doclayout_v3.rs\u0060 and \u0060crates/xberg/src/layout/models/rtdetr.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/pp_doclayout_v3.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"06744c2b14d9ec763246bd6266d1f4f3f6dc128f18b91639348b282d3740e61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/ort_discovery.rs:417-423 | crates/xberg/src/ort_discovery.rs:454-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ort_discovery.rs:417\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ort_discovery.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80a697fa37f9e4b4e77aa43362f3b83cfaacf2558052562ffc2313579890c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:415-423 | crates/xberg/src/extractors/jats/mod.rs:464-473 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:415\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f057c04c6720d473ff0ec0603093f5c4573344d4adee5af562afc9e2a1157a3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/page_renderer.rs:2194-2203 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2264-2273 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:2351-2360 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:2194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"519db94ffcdfcf1a8df6079c0c33004f5dc8dcadbfc9b3e4acf7605bd3d699d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/pdf/embedded_files.rs:55-64 | crates/xberg/src/pdf/embedded_files.rs:65-74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/embedded_files.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/embedded_files.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b62f7071a9b222bf3c367547e709cd9cf8018055a215c789f5b3d1387ce2ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/llm/structured.rs:66-75 | crates/xberg/src/llm/text_completion.rs:40-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/llm/structured.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba04a356ac14db90687b04d3ef48fdb288345548c05539ec49f650252096742a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/ooxml_embedded/mod.rs:282-291 | crates/xberg/src/extraction/ooxml_embedded/mod.rs:340-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 \u0060crates/xberg/src/extraction/ooxml_embedded/mod.rs:282\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ooxml_embedded/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8547e8e7016d1f931c6a889657bd6d8d04fa58e3f5b2927b7ad2f348b7944368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:255-263 | crates/xberg/src/extractors/jats/mod.rs:464-473 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:255\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"870ff9c2093a51197315194f6e86d68de48095ebb31fc71f544e256a5197fa49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/odt.rs:442-451 | crates/xberg/src/extractors/odt.rs:453-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/odt.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":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"703e06e060e4ddcc8e584b8237f356db448e38e89e1baa452f29cd12e2d837ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extractors/docbook.rs:608-617 | crates/xberg/src/extractors/docbook.rs:620-629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9afebd23765e2855ecc98ec12db26123be6ee69382610bf5587055a57b408bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:1404-1413 | crates/xberg-native-pdf/src/fonts/font_dict.rs:1473-1482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:1404\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b615bdbe7a259729e6e47138a3b5f32a0e33f75987f243d0fa25e8b62e99a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/docx/parser.rs:3020-3028 | crates/xberg/src/extraction/docx/parser.rs:3035-3043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/parser.rs:3020\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"62161feeb2637cea15e6cb7845299e50ebe196ba828000326602567079a727a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/xberg-native-pdf/src/document/extract_api.rs:926-934 | crates/xberg-native-pdf/src/document/extract_api.rs:942-950 | crates/xberg-native-pdf/src/document/extract_api.rs:1004-1012 | crates/xberg-native-pdf/src/document/extract_api.rs:1020-1028 \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 \u0060crates/xberg-native-pdf/src/document/extract_api.rs:926\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"b714d916256dfcee2c4c1d6b0936fd7fd6be28cca087e2bf40dd928736a88c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/paddle_ocr/model_manager.rs:952-960 | crates/xberg/src/paddle_ocr/model_manager.rs:989-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/paddle_ocr/model_manager.rs:952\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/model_manager.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2b0d8fc7d314dfa4c4e53f93e0aeb82f2bba197a26ffac4bd8dfe7746ac943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/handler.rs:208-216 | crates/xberg-native-pdf/src/encryption/handler.rs:231-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/handler.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50a8b7671170d674a9eaa8c99b0f5ef1720f786f7c3f290c8c66a276f240f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extractors/email.rs:629-637 | crates/xberg/src/extractors/email.rs:704-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/email.rs:629\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/email.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"a583eb9790422a9b3a4caa5a450fef1ab7a74475e79f75567f162cc04b05bc74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/pst/mod.rs:178-186 | crates/xberg/src/extraction/pst/mod.rs:189-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pst/mod.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51c86cbc6abb22134e7f364e971dfc53444adb5b04807b2ae494d4c845b0cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/forms.rs:302-310 | crates/xberg-native-pdf/src/extractors/forms.rs:314-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/forms.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"8494a288d0f7741b5ae1c9dfc11bf6540ef0700764760d05a8bcb5d0220ea30f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/text/token_reduction/filters/markdown.rs:38-44 | crates/xberg/src/text/token_reduction/filters/markdown.rs:48-56 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/text/token_reduction/filters/markdown.rs:38\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/token_reduction/filters/markdown.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a6cc4bab8b2624340617534ba8020397169fb9cceb39826b28245d59e20a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/extraction/pptx/container.rs:53-61 | crates/xberg/src/extraction/pptx/container.rs:81-89 | crates/xberg/src/extraction/pptx/container.rs:181-186 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/container.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6361640dcbc1078fe261c97b7ed43c40a2e6a5ee9a47ef324dd14c5272c02eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/xberg/src/extraction/docx/math/render.rs:215-223 | crates/xberg/src/extraction/docx/math/render.rs:230-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/docx/math/render.rs:215\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/render.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed38f19ad488e1b683b76ec058a5af7436c85300f442ff7d298953ac41e8a451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/content/parser.rs:4047-4054 | crates/xberg-native-pdf/src/content/parser.rs:4057-4064 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/content/parser.rs:4047\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":4047}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ac58288363f172fe7463a7a9a416872e896cea29286a5e9a68b8e625428fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/optional_content.rs:53-60 | crates/xberg-native-pdf/src/optional_content.rs:61-68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/optional_content.rs:53\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/optional_content.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0457fb8a1506c9af1b747aacd950f4416325c219567946383de39e7138794ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extraction/office_metadata/app_properties.rs:198-205 | crates/xberg/src/extraction/office_metadata/app_properties.rs:228-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/office_metadata/app_properties.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/office_metadata/app_properties.rs:237\u0060 calls \u0060parse_xml_text\u0060 and \u0060crates/xberg/src/extraction/office_metadata/app_properties.rs:207\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/office_metadata/app_properties.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0361118cbc16a9f207e5397a849f8b4e46a3c4865ae32efecf2452acfe97babe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extraction/office_metadata/core_properties.rs:88-95 | crates/xberg/src/extraction/office_metadata/odt_properties.rs:95-102 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/office_metadata/core_properties.rs:88\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/office_metadata/core_properties.rs:99\u0060 calls \u0060parse_xml_text_joined\u0060 and \u0060crates/xberg/src/extraction/office_metadata/odt_properties.rs:104\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/office_metadata/core_properties.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"492eb9220005237df9afd7306e82bed0ae983559b417d74a0898dba13d77cd38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/fictionbook.rs:180-187 | crates/xberg/src/extractors/fictionbook.rs:190-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/fictionbook.rs:180\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d39449fd4fcaf6c8a2fe8255acfd682c2e82b7d1f36da6fa70e0b5cc1b55e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/archive.rs:180-186 | crates/xberg/src/extractors/archive.rs:263-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/archive.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce69737f61f573e7fae507757c9eabb7b3259f939009b1a0f72f2335969f3fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1060-1067 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1088-1095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1060\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa67b963554d2841e191a53a6c05ddfe7b5e4d1a2d82ad1b45bc3506678b91b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1041-1048 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1059-1066 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1087-1094 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1041\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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1079\u0060 calls \u0060Some\u0060, \u0060detect_narrow_gutter_prose\u0060 and \u0060crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1049\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bdeb97ed78fa7aca64ff43e800212ef4897d5aa93769d03368412e20bcf5a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/pdf/bookmarks.rs:317-324 | crates/xberg/src/pdf/bookmarks.rs:339-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/bookmarks.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dc3ad2b5fbbee67f860324396edfcea64b6eed7021bf7cb82aad82544ca6c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/rendering.rs:57-64 | crates/xberg/src/extractors/pdf/ocr/rendering.rs:160-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/rendering.rs:57\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9f5feddea152015e658cd79791dcfc1b5cc622d3e947c6b9d8664c75c02728"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/xberg/src/extractors/iwork/numbers.rs:616-623 | crates/xberg/src/extractors/iwork/numbers.rs:663-670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/iwork/numbers.rs:616\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/numbers.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3cf85364836c78762d0bf5f078b4f589d22446c89638fa7dbc3eddf9514f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/excel/package_metadata.rs:290-296 | crates/xberg/src/extraction/excel/package_metadata.rs:400-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/package_metadata.rs:290\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"13503128cf7e394e8b56a000cc61106f77e28be3db238092cad4980aaae54be6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/page_labels.rs:291-297 | crates/xberg-native-pdf/src/extractors/xmp.rs:239-245 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/page_labels.rs:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/page_labels.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b7b6c04c6efc6c0bd3d6a41de0c0261d48c8e4f68a94ca65d38017f90d27c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/reranking/mod.rs:756-762 | crates/xberg/src/reranking/mod.rs:800-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/reranking/mod.rs:756\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/reranking/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"66588afcfd5d2c33b153f10bd0b41c4b0f1fe3adaf888e22bee33c2067b1c345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:1363-1369 | crates/xberg-native-pdf/src/fonts/font_dict.rs:1370-1375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/fonts/font_dict.rs:1363\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4634f0d000b344c6108b91c41086bda882a28b85b9ca118d114c4b1023c4b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:2908-2914 | crates/xberg-native-pdf/src/extractors/images.rs:2955-2959 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/images.rs:2908\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c5946d27532207787ae02843abc3b88cee852832a8c4ca28c99932c416c66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201313 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:2166-2172 | crates/xberg-native-pdf/src/optional_content.rs:223-235 \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 \u0060doc\u0060 to \u0060\u0026PdfDocument\u0060 in one and \u0060Option\u003C\u0026PdfDocument\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b2dc3fd2cdd16b5e7eb0fa4518b65ac628235bf12181c2b5ca8c7de0857142"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/excel/table_budget/ods.rs:149-155 | crates/xberg/src/extraction/excel/table_budget/zip_metadata.rs:41-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/table_budget/ods.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget/ods.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"01edbf7116089f04c80f86d16e75dbfb19d03c6a7dbca7e1c708f3c20d8a7f0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/xberg/src/extraction/transform/content.rs:99-105 | crates/xberg/src/extraction/transform/content.rs:126-132 | crates/xberg/src/extraction/transform/content.rs:248-254 | crates/xberg/src/extraction/transform/content.rs:418-424 \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 \u0060crates/xberg/src/extraction/transform/content.rs:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/transform/content.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fe576cc38e6b0a4c7ccfc5f1b30f04d9ec295772a9872111a4143f542ce791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:4102-4106 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:4117-4123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:4102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":4102}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c0ebc70afa12e43e88b53d1f3061ea558df293405705c20fb864649c59cd42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:396-402 | crates/xberg-candle-ocr/src/models/paddleocr_vl/processor.rs:121-127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:396\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d097d2a04538b9b46be2393f4d0221a2c5c0625c847a8b431e229914badc56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/jats/elements.rs:103-109 | crates/xberg/src/extractors/jats/elements.rs:174-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/jats/elements.rs:103\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b49507652e07e0f61b733f27fce43d2d034db6cfec2494224eb3734b3d405e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/outline.rs:62-68 | crates/xberg-native-pdf/src/outline.rs:72-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/outline.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1df0414f78baad63f64a5b39c1228fb376e483c188796e0808fcb503e6a4152"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extraction/typst_math.rs:426-432 | crates/xberg/src/extraction/typst_math.rs:447-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/typst_math.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/typst_math.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"97309355288d19f812fe673a5e63f07b7faa330d7441a7aeaf78f1d968e8821a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:1174-1179 | crates/xberg/src/extractors/jats/elements.rs:102-107 | crates/xberg/src/extractors/jats/elements.rs:173-178 \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 \u0060crates/xberg/src/extractors/docbook.rs:1174\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"022a6c3d4cd0270a4484ac912e574760817a7162dbaa6168dca48d11d40bc806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/plugins/registry/embedding.rs:100-105 | crates/xberg/src/plugins/registry/reranker.rs:68-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/embedding.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea086ba362a9ed20199b47e7ef9b8a3013950e320bb2082a1ebec4e3b4b15455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/llm/structured.rs:210-215 | crates/xberg/src/llm/vlm_ocr.rs:223-228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/llm/structured.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b020874aad480c947877d811589fece923d06b3024b6564bad65822c1946ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/xberg/src/extractors/docbook.rs:1174-1179 | crates/xberg/src/extractors/fictionbook.rs:770-775 | crates/xberg/src/extractors/jats/elements.rs:84-89 | crates/xberg/src/extractors/jats/elements.rs:102-107 | crates/xberg/src/extractors/jats/elements.rs:173-178 | crates/xberg/src/extractors/jats/parser.rs:165-170 \u2014 before extracting anything, compare \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/fictionbook.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1174\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47e052e34c83e8381a1798965f7049f9668626cecb6874376addabbded3044e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extraction/excel/open.rs:184-189 | crates/xberg/src/extraction/excel/open.rs:286-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/open.rs:184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60bbd4a2b3f3fc4a9335348c16842b1dbf103ce7b7817aa2278fa2009a3ffdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/myst.rs:786-791 | crates/xberg/src/extractors/myst.rs:807-812 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/myst.rs:786\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/myst.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b87314ea883b1d1c70511aaccd47d1b86fbc416f5cce701f4513ddb3bbab00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extraction/excel/package_metadata.rs:112-117 | crates/xberg/src/extraction/pptx/metadata.rs:42-47 \u2014 before extracting anything, compare \u0060crates/xberg/src/extraction/excel/package_metadata.rs\u0060 and \u0060crates/xberg/src/extraction/pptx/metadata.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extraction/excel/package_metadata.rs:112\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg/src/extraction/pptx/metadata.rs:49\u0060 calls \u0060insert\u0060, \u0060to_string\u0060, \u0060clone\u0060 and \u0060crates/xberg/src/extraction/excel/package_metadata.rs:119\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/package_metadata.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6857bead7cbb5e2a9d2321de95b1ebc466a5f66726e9c351576574c4443148c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/forms.rs:685-690 | crates/xberg-native-pdf/src/extractors/forms.rs:691-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/forms.rs:685\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/forms.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"790e3172b5fa57b0dd12e0145ac74af472240d90cb57721f5a549aadba2809b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/extractors/odt.rs:132-137 | crates/xberg/src/extractors/odt.rs:218-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/odt.rs:132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bbfd6b6ecb4c684ea81e0ed3b1c6b0ee5af6ed2079ba889dd4e845ef0085ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/xref_reconstruction.rs:115-120 | crates/xberg-native-pdf/src/xref_reconstruction.rs:123-128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref_reconstruction.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36f398b433588ad93b053d8f49868fdc4fcc3bef010c5dc1fc32e690c20b1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/fonts/font_dict.rs:2364-2369 | crates/xberg-native-pdf/src/fonts/font_dict.rs:2374-2379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69a149ba68605f0a8172f759b76b898f27162cf6fe6e15131981561e432408a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/forms.rs:700-704 | crates/xberg-native-pdf/src/extractors/forms.rs:706-710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/forms.rs:700\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/forms.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc93453439e23fe4f5bf86d6dc2a6a662447ffb0d237e3bc58472e5ff87dd2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg-native-pdf/src/extractors/forms.rs:500-504 | crates/xberg-native-pdf/src/extractors/forms.rs:699-703 | crates/xberg-native-pdf/src/extractors/forms.rs:705-709 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/forms.rs:500\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/forms.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0564256c43e104205184653811dbbf10f41467d67b0f5728d30fe44557f49461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2373-2380 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2441-2448 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2459-2466 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:2373\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"754224b910fe75b85336d394520d10e1e1740f088157ba810012a4363547797e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/xref_reconstruction.rs:758-762 | crates/xberg-native-pdf/src/xref_reconstruction.rs:763-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/xref_reconstruction.rs:758\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref_reconstruction.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"677c3fdd91c22585dcc1ceb1d8869ef839b27d3235a6e099d75860bc2a17a129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:101-105 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:263-267 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:380-384 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:706-710 | crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:887-891 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs:101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/paddleocr_vl/model.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbac8f2c21161768258efc7f266fa2c84b2906b87454f0e24dd56bffcdea0a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/extractors/docbook.rs:1190-1194 | crates/xberg/src/extractors/docbook.rs:1210-1214 | crates/xberg/src/extractors/docbook.rs:1218-1222 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/docbook.rs:1190\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e36c4f351fa039737d6d7a47f5b139d748827f57c95cdfcd02975146fdd3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-candle-ocr/src/models/deepseek_ocr/engine.rs:347-351 | crates/xberg-candle-ocr/src/models/paddleocr_vl/engine.rs:369-373 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-candle-ocr/src/models/deepseek_ocr/engine.rs:347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/engine.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ae1a66dbdb4d329ff1c65b8f607a69a6a609a23357e2160473a801a43dcb1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/extractors/images.rs:2923-2927 | crates/xberg-native-pdf/src/extractors/images.rs:2968-2972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/extractors/images.rs:2923\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":2923}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8b7e3d6832f556d47c30f5a4bc8d0f2e82a21e9c1e3ec3062b88315e8c22af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/odt.rs:1778-1782 | crates/xberg/src/extractors/odt.rs:1784-1788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/odt.rs:1778\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c5840c751391f2eaeb71b6bd28d8f3c5d381d2c78f7f936581e053ad4cdfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-candle-ocr/src/models/glm_ocr/mod.rs:531-535 | crates/xberg-candle-ocr/src/models/paddleocr_vl/engine.rs:169-173 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/mod.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d681a15f6ef30d8c2457c5210254fc2408f9279263afed3c8f09a61f381f95f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/image_budget.rs:167-171 | crates/xberg-native-pdf/src/rendering/image_budget.rs:311-315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/image_budget.rs:167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/image_budget.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e3019e2778f7fcfdc9260c1430084b0f130e014907192d3de54e37850480f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:3505-3509 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:5665-5669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":3505}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc97a75c49996fcc2781d8106e7784ca3e10dd98b58aae2ee4de6772ce57bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/xberg/src/extraction/pptx/parser.rs:231-235 | crates/xberg/src/extraction/pptx/parser.rs:375-379 | crates/xberg/src/extraction/pptx/parser.rs:388-392 | crates/xberg/src/extraction/pptx/parser.rs:461-465 \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 \u0060crates/xberg/src/extraction/pptx/parser.rs:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/parser.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fa5ea111ba2e9d6490bd9de341d800e219383c2b4f662f40a2b265a50252a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1389-1393 | crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs:1423-1427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/deepseek_ocr/model.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d76d757c696c34abb43ece6073d3a7e24e314bdad948fedea181a572d0ef53d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-gliner/src/candle/lora.rs:133-138 | crates/xberg-gliner/src/candle/lora.rs:267-272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/candle/lora.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d40aa6163b6021ac2ba5a035bf04aaa5d29460971db96c0d6227c74c1b990b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/certificate.rs:228-233 | crates/xberg-native-pdf/src/encryption/permissions.rs:58-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/certificate.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a71475b944b7600734847a7f18d23ef94bab4fcb717d3ecf6cb940df7425922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/encryption/mod.rs:387-393 | crates/xberg-native-pdf/src/encryption/mod.rs:400-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/encryption/mod.rs:387\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/encryption/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"da37a376b34a94d36c6a2e4eb9429fb212d7c1b9e9310f590986ae057eebde8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/pipeline/reading_order/geometric.rs:54-58 | crates/xberg-native-pdf/src/pipeline/reading_order/geometric.rs:85-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/pipeline/reading_order/geometric.rs:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/geometric.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"63949a1c6e0271882190839d34974a87476fc45428380141890ff600d29af7f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1133-1137 | crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs:1139-1143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1163c58be56248d44ec77fe1fe1355705aec6662b40a78228978275fef2bac4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/mod.rs:158-162 | crates/xberg/src/extractors/structured.rs:99-103 | crates/xberg/src/extractors/structured.rs:305-309 \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 \u0060crates/xberg-native-pdf/src/rendering/mod.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c03df85c5c22177b1336a968ae5f4343e8bc36643272b58f668d17166e4f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:1670-1674 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:1896-1900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1670\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1680\u0060 calls \u0060pipeline_resolve_paint_gs\u0060, \u0060as_ref\u0060, \u0060unwrap_or\u0060 and \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:1901\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edc4940832c6f93e4e73ff40cc0d239a3914adff49e16a99e779d5542caa0fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:5796-5800 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6121-6125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":5796}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af81fe2f83d2dbca1a19aa244bb2991016c37530978cf17ce081ceda68b3513"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:6373-6377 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:6447-6451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg-native-pdf/src/rendering/page_renderer.rs:6373\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":6373}}}],"partialFingerprints":{"codehealthFindingId/v1":"abac4b58ceb4ee0ed4c68ae37b42b8e604ab2831d59ef05d7f0502415c9be06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/xberg-native-pdf/src/rendering/page_renderer.rs:8164-8169 | crates/xberg-native-pdf/src/rendering/resolution/color.rs:726-731 | crates/xberg-native-pdf/src/rendering/resolution/pipeline.rs:256-261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a63c741bdc64f49ba613b27dce947d0fb8043df9dfaed175b2421755d8861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/page_renderer.rs:8427-8431 | crates/xberg-native-pdf/src/rendering/page_renderer.rs:8443-8447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":8427}}}],"partialFingerprints":{"codehealthFindingId/v1":"a452389a9da7e402ac11875e6b70f7cc51bdaee893912cd125f7ec7d7f3f28f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:2538-2542 | crates/xberg-native-pdf/src/structure/spatial_table_detector.rs:2560-2564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e2333374863be1598f7f2f84ef9619252e350e4ca6c93cb4789cb2d63566fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg-paddle-ocr/src/db_net.rs:398-403 | crates/xberg-paddle-ocr/src/db_net.rs:502-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/db_net.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caa8d9809ceca41f5da9ccfc05de41787a5cc23a6b9e562bb492bba0f80e4f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs:887-891 | crates/xberg-pdfium-render/src/pdf/document/page/object/text.rs:416-420 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/pdf/document/page/object/path.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8765e76eab6b80461fbf77137217d22bb0032afa13779682fc53f171ac6edf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg-tesseract/src/api.rs:1222-1226 | crates/xberg-tesseract/src/api.rs:1283-1287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc42dcbc9b1c3658426042450779267c2a8bada49b0db00bc9124e0284c66746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/core/extract/mod.rs:57-61 | crates/xberg/src/engine/mod.rs:249-253 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extract/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2e0d979bf13016277e974df379139a938df8cfd99690b28a63fd375e3bb316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/core/pipeline/mod.rs:745-749 | crates/xberg/src/core/pipeline/mod.rs:1051-1055 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/core/pipeline/mod.rs:745\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5645ba43a24261f6ac7858a673c0bfea3231392dec1ea1a39f38ac350011c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/engine/extract_impl.rs:1205-1209 | crates/xberg/src/engine/extract_impl.rs:1891-1895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee41a65dd33c0a855daced4a025a5242bbc83587074d72b512a437fd30f703e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/xberg/src/extraction/image.rs:368-377 | crates/xberg/src/pdf/native/images.rs:115-124 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef85e81e81e4ee6d17e82cea542f4832f89f7c674e6d0b7b60262d78559e7401"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/extractors/djot_format/extractor.rs:183-187 | crates/xberg/src/extractors/djot_format/extractor.rs:213-217 | crates/xberg/src/extractors/djot_format/extractor.rs:243-247 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/djot_format/extractor.rs:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9327343573dbce289df8360549079040a7760cba7690f8e43a2fc3de14cd56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/iwork/mod.rs:403-407 | crates/xberg/src/extractors/iwork/mod.rs:413-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/iwork/mod.rs:403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9948f4c85e875f8d9b20a7a9a76fcf80c82c2a2fd2d68bb13fd9a1aba74192f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/latex/mod.rs:620-624 | crates/xberg/src/extractors/latex/mod.rs:719-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/latex/mod.rs:620\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0f98c755f1e1d95d8934e281c56f0f8c5bf88c4c8022084331fa4deeb319aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/xberg/src/extractors/markdown.rs:318-322 | crates/xberg/src/extractors/markdown.rs:348-352 | crates/xberg/src/extractors/markdown.rs:378-382 | crates/xberg/src/extractors/markdown.rs:408-412 | crates/xberg/src/extractors/markdown.rs:438-442 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/markdown.rs:318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbb792fa42bf53397e72028072f2f4113741fe6e68c39f31c70c3c3f500e9b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/opml/parser.rs:36-40 | crates/xberg/src/extractors/opml/parser.rs:257-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/opml/parser.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a9af52fecc3c28acc21563f03f707fdca49b47c0cc2124e8025425eaab8b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6605-6609 | crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6633-6637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/pipeline.rs:6605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":6605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a36c25ab0c2b5d333841075e940b14a8f65bc98698d3e108c49dc417fa6ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/xml.rs:111-115 | crates/xberg/src/extractors/xml.rs:139-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/xml.rs:111\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060e\u0060 to \u0060\u0026quick_xml::events::BytesText\u003C\u0027_\u003E\u0060 in one and \u0060\u0026quick_xml::events::BytesCData\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/xml.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"560a3da8a8c5efb8ab574d1609232931e49b90f094de9c355b2cc2c1a4517910"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/layout/models/slanet.rs:176-180 | crates/xberg/src/layout/models/tatr.rs:197-201 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/layout/models/slanet.rs:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/slanet.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff184d0d28f6d9196fa6c8c30d6afd6b46e62326f1fd0e44136248561371183a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/xberg/src/layout/models/tatr.rs:614-619 | crates/xberg/src/layout/models/tatr.rs:620-625 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/tatr.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec3fd54991eaf93a6d29a1b6a09803c9a43f6edb6917feaff7c840a7a0ed5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/ocr/processor/execution/native_image_budget.rs:75-79 | crates/xberg/src/ocr/processor/execution/native_image_budget.rs:98-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/native_image_budget.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"598841f8d376c2e890ce352b8646642c1d513dc90b063b0ece10375edfde860f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/pdf/native/hierarchy.rs:122-126 | crates/xberg/src/pdf/native/text.rs:1200-1204 | crates/xberg/src/pdf/native/text.rs:2771-2775 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060spans\u0060 to \u0060\u0026[\u0026xberg_native_pdf::layout::TextSpan]\u0060 in one and \u0060\u0026[xberg_native_pdf::layout::TextSpan]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60bf302c305d8515e4e25f59a151c03614de79912e7cefd1172833883c07a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/pdf/native/images.rs:848-852 | crates/xberg/src/pdf/native/images.rs:875-879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/native/images.rs:848\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/images.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"77afaf42848e3f5ed23a3021885dfb2758c06636aaf188dae80175d3d629e6d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/pdf/structure/pipeline.rs:786-792 | crates/xberg/src/pdf/structure/pipeline.rs:871-877 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df95de68e042331f673860eb8a12cc5c41fea7bdde3523c524af885cee574d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/pdf/table_reconstruct.rs:1835-1839 | crates/xberg/src/pdf/table_reconstruct.rs:1938-1942 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/pdf/table_reconstruct.rs:1835\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4c9919c5c641ac72fc642dfaef17ff3ac39988546d9d722ba0323065988740"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/types/builder.rs:109-113 | crates/xberg/src/types/builder.rs:411-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/builder.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"310c744eb502673fd440a9e111f4c2cab6f683e9de3e6141552ce2f5c5a76150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py:220-229 | tools/benchmark-harness/caption_export/src/caption_export/subblock_run.py:240-249 \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":"tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1cdd586232673eaf2f57d7873a9e1ec3226107f32aad365549e33f7f2a2dea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py:186-191 | tools/benchmark-harness/caption_export/src/caption_export/subblock_run.py:166-171 \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":"tools/benchmark-harness/caption_export/src/caption_export/first_divergence_run.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea042cdb164a8213823678037ef5c1614e9e50f455822c628aef5553fe3bfac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/benchmark-harness/scripts/docling_extract.py:207-223 | tools/benchmark-harness/scripts/markitdown_extract.py:40-56 | tools/benchmark-harness/scripts/mineru_extract.py:166-182 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:48-64 | tools/benchmark-harness/scripts/unstructured_extract.py:57-73 \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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9c65ad8f63132542f4b6ce9ad9d1cb08d64a3ae32391adf2b47e80beabb8bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/benchmark-harness/scripts/docling_extract.py:227-261 | tools/benchmark-harness/scripts/markitdown_extract.py:60-94 | tools/benchmark-harness/scripts/mineru_extract.py:186-220 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:68-102 | tools/benchmark-harness/scripts/unstructured_extract.py:77-111 \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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0f82a246f674f3810052cd2856d7b36d617fb28e1f4dab8dc7011fe3f9dd35"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): tools/benchmark-harness/scripts/docling_extract.py:293-368 | tools/benchmark-harness/scripts/markitdown_extract.py:126-169 | tools/benchmark-harness/scripts/mineru_extract.py:308-376 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:134-177 | tools/benchmark-harness/scripts/unstructured_extract.py:143-194 \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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1473e63488b3e180ff272728241d8452c53827aa9be7ed69a9dc504e50db3c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tools/generate_test_fixtures/src/generate_test_fixtures/odt_revisions.py:109-121 | tools/generate_test_fixtures/src/generate_test_fixtures/pptx_comments.py:106-123 | tools/generate_test_fixtures/src/generate_test_fixtures/security_fixtures.py:44-61 | tools/generate_test_fixtures/src/generate_test_fixtures/xlsx_revisions.py:92-109 \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":"tools/generate_test_fixtures/src/generate_test_fixtures/odt_revisions.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"534454354f4e364378e3b64e8d6ce9379a2ab7e485ff90c07f2e96c4a82a91c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): tools/benchmark-harness/src/runner/execution.rs:275-345 | tools/benchmark-harness/src/runner/execution.rs:457-522 \u2014 These two members are one piece of code written twice and then edited apart: 66 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/runner/execution.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"164c2ba2c19834b216dbda1898a60c9f541169019c473107593ac88c78c7b898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): tools/benchmark-harness/src/json_quality.rs:134-187 | tools/benchmark-harness/src/json_quality.rs:344-397 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/json_quality.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"537f80bb41a3c8c8867d37e05dadc91065d8f5cfb983d665fda42f418d9cd4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): tools/benchmark-harness/src/structural_sidecar/scoring.rs:461-484 | tools/benchmark-harness/src/structural_sidecar/scoring.rs:500-522 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/structural_sidecar/scoring.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de497227ebb2ab7adc9eb8f5b009e034dd25b9cc9501dfac1f97d326806b7b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): tools/benchmark-harness/src/aggregate/ranking.rs:223-247 | tools/benchmark-harness/src/aggregate/ranking.rs:566-594 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/aggregate/ranking.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"6332bab1c3866bc2287c6bdea3c5f8ced0665fa2fc649bcbc45ca0fdd92504f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tools/benchmark-harness/src/structural_sidecar/scoring.rs:356-376 | tools/benchmark-harness/src/structural_sidecar/scoring.rs:404-424 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/structural_sidecar/scoring.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a93ce89596decb65f3b4fda4481159a3456018285cbebd980f87297f977f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): tools/benchmark-harness/src/sizes.rs:146-194 | tools/benchmark-harness/src/sizes.rs:200-250 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/sizes.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9f37e43c9c16717e900b295a0f64f5d387b36a1994ea34b57e6786f6bc3575"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): tools/benchmark-harness/src/comparison/execution.rs:194-237 | tools/benchmark-harness/src/pipeline_benchmark/mod.rs:156-201 \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":"tools/benchmark-harness/src/comparison/execution.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d817ab5d2440d9e9a936e820a35c56d15913a86815bca79bca11c67a87294cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large.rs:18-42 | crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/encoded_pipeline.rs:11-41 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb1189d0d57208bf8942ee472f65e82ab0736203650dbd69f7c4b56fd7393ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): tools/benchmark-harness/src/adapters/external.rs:120-151 | tools/benchmark-harness/src/adapters/external.rs:578-604 \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":"tools/benchmark-harness/src/adapters/external.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fed2705c4c37d431d547fcd6ed89663601c8e4fc995440d83802dcc7e4740f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): tools/benchmark-harness/src/adapters/native.rs:92-126 | tools/benchmark-harness/src/adapters/native.rs:133-172 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/adapters/native.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"309b56ad14e9f7cb9b8d0236268c8a9f04a8ab9d4fbce5564d385aaa543cffe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): tools/benchmark-harness/scripts/build_language_sidecar.py:58-97 | tools/benchmark-harness/scripts/plausibility_calibrate.py:83-110 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/scripts/build_language_sidecar.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe11d55c2a58a6ffa03861d41988a167beede176551086b712a5fd013f71b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large.rs:195-217 | crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/encoded_pipeline.rs:122-145 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e24b575ddcae2dad6acd52454b47c4743be14541ad8c715a4a27a24ae8b8949"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): tools/benchmark-harness/src/runner/run.rs:227-254 | tools/benchmark-harness/src/runner/run.rs:357-385 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/runner/run.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9261776a1a181a6cc6d64fc1acbdb08d27fd70b4f1bc05be5b73c10cd7efd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tools/benchmark-harness/src/aggregate/percentiles.rs:459-485 | tools/benchmark-harness/src/aggregate/percentiles.rs:490-510 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/aggregate/percentiles.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"befc9d53b76aefe408dc1be760d5d7015e7c60e8654c6333c1d4451f6c5f95a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tools/benchmark-harness/src/adapter.rs:107-128 | tools/benchmark-harness/src/runner/helpers.rs:340-355 \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":"tools/benchmark-harness/src/adapter.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"907d2f16b7b545d5f7583e8e093e4037fb4264db16ed63fa74c91c334d485da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): tools/benchmark-harness/src/json_quality.rs:75-101 | tools/benchmark-harness/src/json_quality.rs:103-121 \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":"tools/benchmark-harness/src/json_quality.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7685f639358aee009b1cd04379bffd58268988d144b204100f02141f6942e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tools/benchmark-harness/olmocr_bench/contracts.py:100-110 | tools/benchmark-harness/parsebench_html/safeguards.py:16-26 \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":"tools/benchmark-harness/olmocr_bench/contracts.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9bec51471523cd3731a05d192a8fed4876280bd22f30ca048d6171cd929dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): tools/benchmark-harness/src/adapters/subprocess/batch_exec.rs:429-451 | tools/benchmark-harness/src/runner/execution.rs:352-374 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/adapters/subprocess/batch_exec.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b20ba8c7a7b3ae1de502f0b360fc4601450311d8b2f4d04c16366b26bd0143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): tools/benchmark-harness/src/adapters/external.rs:156-175 | tools/benchmark-harness/src/adapters/external.rs:178-192 | tools/benchmark-harness/src/adapters/external.rs:559-573 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/adapters/external.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ba687f378f6d0e7e375129433ab836df13a3ba55c7df5399d0114658af2bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): tools/benchmark-harness/src/monitoring/mod.rs:531-546 | tools/benchmark-harness/src/monitoring/mod.rs:666-680 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/monitoring/mod.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea80f6346baadc8d1218e045e22b593e211f1ab889dc5d16600b775492836fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): tools/benchmark-harness/src/adapters/subprocess.rs:83-106 | tools/benchmark-harness/src/adapters/subprocess.rs:125-148 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/adapters/subprocess.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61e23e53c3f0392aa602e214fd3222818315b29db03daf2c225867685adf140"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py:124-159 | tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py:163-195 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2406fcc26f7fa7ea408925054a761267a16892d467e5a715b98d6b7286f96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tools/benchmark-harness/src/validate_artifacts.rs:381-392 | tools/benchmark-harness/src/validate_gt.rs:266-280 \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":"tools/benchmark-harness/src/validate_artifacts.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107089f2d97b9600b0e7746f6d57896b26debbc7c99426d6fed267781e415b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): tools/benchmark-harness/scripts/docling_extract.py:276-289 | tools/benchmark-harness/scripts/markitdown_extract.py:109-122 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:117-130 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"08be4f8e12992332a3a82a8f7d7312ce126e1b4691945befb0162b45aed4650f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tools/benchmark-harness/src/output.rs:88-103 | tools/benchmark-harness/src/output.rs:450-463 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/output.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c608e82c30f362c08e0137806d5d44c901c5fc917566fab00e03638aec7dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tools/benchmark-harness/src/sizes/package_measurements.rs:54-64 | tools/benchmark-harness/src/sizes/package_measurements.rs:176-187 \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":"tools/benchmark-harness/src/sizes/package_measurements.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"deced8e53d5d030e351dd2258d021af112c70c3b53c46c42690e8ce317b719be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tools/benchmark-harness/src/monitoring/mod.rs:275-285 | tools/benchmark-harness/src/monitoring/mod.rs:292-301 \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":"tools/benchmark-harness/src/monitoring/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"762ec969d94d37ce28c2fc1ed7699df00ca9bcbc0f42d8c9c37daddb85c894f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tools/benchmark-harness/src/model_benchmark.rs:157-169 | tools/benchmark-harness/src/provenance.rs:383-395 \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":"tools/benchmark-harness/src/model_benchmark.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"571c800243901374d6f95a9abce00943446b9e54651f383d2a0ce0debe371583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tools/benchmark-harness/src/comparison/extraction_config.rs:188-203 | tools/benchmark-harness/src/comparison/extraction_config.rs:205-221 \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":"tools/benchmark-harness/src/comparison/extraction_config.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"82902d92cad821cb685aad4b837a7668123289b4f2b539814d424e1fcb3951e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/benchmark-harness/src/quality/mod.rs:502-509 | tools/benchmark-harness/src/quality/mod.rs:515-523 \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":"tools/benchmark-harness/src/quality/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"805e34bbee1d332784c48e9d692df69cc098647a3235d578f2e6e1a3f4c9ec18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): tools/benchmark-harness/src/markdown_quality.rs:445-464 | tools/benchmark-harness/src/quality/mod.rs:269-279 \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":"tools/benchmark-harness/src/markdown_quality.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4e31e4a820ab98039527e015cc88bbf5f006f870f18298bfaeb9d66cb9c21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): tools/benchmark-harness/src/bench_matrix.rs:508-524 | tools/benchmark-harness/src/bench_matrix.rs:527-543 \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":"tools/benchmark-harness/src/bench_matrix.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a884ecf4b63bdd76ba530cdb5777960e18e166e17ed626a54437ad4d6abeba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/adaptive.rs:8-23 | crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/contrast.rs:18-33 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/adaptive.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04e03d675fb587bfa35683af9ed37100f347c72b3d04914d2b034a1e4867b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs:3-10 | crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs:12-19 | crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs:150-157 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1868524b263c9c078237102009cc7f009e8227784a8d6505a3ed6612be563cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs:60-77 | crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs:81-95 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"560e760b152b3a80228eb23a6a9ace230b1027f994dbc2abe15cd5fb3ad2a614"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tools/benchmark-harness/src/comparison/report.rs:55-67 | tools/benchmark-harness/src/pipeline_benchmark/mod.rs:412-419 \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":"tools/benchmark-harness/src/comparison/report.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"feccfa40f36f05e75e68bbb2fd9c38637c887bd664b22434f328559d416ba424"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/xberg/src/extractors/pdf/ocr/xobject_budget_parity_tests/preferred_stage.rs:74-83 | crates/xberg/src/extractors/pdf/ocr/xobject_budget_parity_tests/support.rs:122-130 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/xobject_budget_parity_tests/preferred_stage.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e3e3961e401adb779041459995701a4defe03b7c441d9aa7818f6b19e1e7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/ci/check-feature-parity.py:202-206 | scripts/ci/check-ffi-format-features.py:189-193 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/check-feature-parity.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0284c95734dcd18d45778f45b6c86f9fceae2a52dc81a2a799c89e3b7f5ba311"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): tools/benchmark-harness/src/config.rs:307-314 | tools/benchmark-harness/src/sizes.rs:507-510 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/config.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c51df83599b7e3d4832243ad197f00921f54413ed726275f8ad0eb250da7b5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tools/benchmark-harness/src/cohort.rs:31-36 | tools/benchmark-harness/src/fixture/mod.rs:105-111 \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":"tools/benchmark-harness/src/cohort.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4550076cc2936df83735950804d5b098d99ae5eb4731f82081554eefcda04386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tools/benchmark-harness/src/adapters/native.rs:25-38 | tools/benchmark-harness/src/adapters/subprocess.rs:223-235 \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":"tools/benchmark-harness/src/adapters/native.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5bbf2f5e654be48569125261b6384f879d92817744a9209b5f56f8072ef63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): tools/benchmark-harness/src/json_quality.rs:145-187 | tools/benchmark-harness/src/json_quality.rs:355-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/benchmark-harness/src/json_quality.rs:145\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":"tools/benchmark-harness/src/json_quality.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec651d67756ee039df788d73c3992dda6a94fbdb381277f70260e614f4a91316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): tools/benchmark-harness/src/sizes.rs:165-183 | tools/benchmark-harness/src/sizes.rs:217-235 \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 \u0060tools/benchmark-harness/src/sizes.rs:165\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":"tools/benchmark-harness/src/sizes.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b077d1709b6acc02f82e8c91b6c866a601dee9eb521df688585c4702f9b1ee7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201318 lines \u00D7 2): tools/benchmark-harness/src/batch_diagnostic.rs:222-233 | tools/benchmark-harness/src/comparison/extraction_config.rs:278-295 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/benchmark-harness/src/batch_diagnostic.rs:234\u0060 calls \u0060Ok\u0060 and \u0060tools/benchmark-harness/src/comparison/extraction_config.rs:296\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/batch_diagnostic.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62258db70fd223b97fdd0c7758ed2d76868c2c2fb621d38b001d7f81e3f8846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): tools/benchmark-harness/src/comparison/execution.rs:220-237 | tools/benchmark-harness/src/pipeline_benchmark/mod.rs:184-201 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/benchmark-harness/src/comparison/execution.rs:220\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":"tools/benchmark-harness/src/comparison/execution.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b689db73ee325bd76b8f0f1716b8cedd0164ecec48732317ac3769fb6975912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tools/benchmark-harness/src/adapters/subprocess.rs:90-106 | tools/benchmark-harness/src/adapters/subprocess.rs:132-148 \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 \u0060tools/benchmark-harness/src/adapters/subprocess.rs:90\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":"tools/benchmark-harness/src/adapters/subprocess.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06858243750fc97f9c4dc8068ab44fad3b146d1b3cc600c6c944b8c56785e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tools/benchmark-harness/src/adapters/subprocess/batch_exec.rs:435-451 | tools/benchmark-harness/src/runner/execution.rs:358-374 \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 \u0060tools/benchmark-harness/src/adapters/subprocess/batch_exec.rs:435\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":"tools/benchmark-harness/src/adapters/subprocess/batch_exec.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cebb25b991e48f5be86a7718f9f7206e822d4f64e26dff88bed3603445d33c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): tools/benchmark-harness/src/sizes.rs:149-162 | tools/benchmark-harness/src/sizes.rs:204-214 \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 \u0060tools/benchmark-harness/src/sizes.rs:149\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":"tools/benchmark-harness/src/sizes.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"704e469d11616d130e56955691db06184b9c4237a117e46fc1e199153c82d8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): tools/benchmark-harness/src/runner/execution.rs:280-300 | tools/benchmark-harness/src/runner/execution.rs:463-485 \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":"tools/benchmark-harness/src/runner/execution.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"7224bcbea48d75215582d92917d48a567348e51adb0a1adf54235324b3a02862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): tools/benchmark-harness/src/runner/execution.rs:306-318 | tools/benchmark-harness/src/runner/execution.rs:525-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/runner/execution.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80a0dc3145477841ba552f7c2c181f3b91168144705ea7b2cb1d3e987df59e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/xberg/src/extraction/doc/test_complex_prm_scripts.rs:17-28 | crates/xberg/src/extraction/doc/test_style_scripts.rs:144-155 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/test_complex_prm_scripts.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"447e22eb642244aa4f8657216776bcf36b1f7f0a12ac608cd3777656ae179e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/benchmark-harness/src/adapters/native.rs:110-121 | tools/benchmark-harness/src/adapters/native.rs:156-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/adapters/native.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be2a4d144a041d32c35c7862748629f7c718f1f60b0503a988fb53722c8e2c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/benchmark-harness/src/adapters/native.rs:135-146 | tools/benchmark-harness/src/adapters/native.rs:404-415 \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 \u0060tools/benchmark-harness/src/adapters/native.rs:135\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":"tools/benchmark-harness/src/adapters/native.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"270419e22fe4d8b9b863c479d7ccf2dc4114b0fe02671e9384120b000fb17e19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/benchmark-harness/src/batch_diagnostic.rs:241-252 | tools/benchmark-harness/src/comparison/extraction_config.rs:302-313 \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":"tools/benchmark-harness/src/batch_diagnostic.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8215dd343bc61b2568539cebdaa76905c22294da9e4755505f4c1cf1273a2597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/benchmark-harness/src/quality/mod.rs:547-558 | tools/benchmark-harness/src/quality/mod.rs:560-571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/quality/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7fdc04de75a98b10b63b4b48c681100a0e706d591a6cb4db936a588f9acca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tools/benchmark-harness/src/runner/run.rs:231-242 | tools/benchmark-harness/src/runner/run.rs:361-372 \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 \u0060tools/benchmark-harness/src/runner/run.rs:231\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":"tools/benchmark-harness/src/runner/run.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de57671e5795e2593ccf111620f5fe4e67de8b0da92724aecf465f0b0ca795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): tools/benchmark-harness/src/comparison/extraction_config.rs:451-459 | tools/benchmark-harness/src/comparison/extraction_config.rs:463-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/benchmark-harness/src/comparison/extraction_config.rs:451\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":"tools/benchmark-harness/src/comparison/extraction_config.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda1cfe3d75ad87429d140d29db0ed583f00c0b7412474addf36beac6489c735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): tools/benchmark-harness/src/sizes/package_measurements.rs:338-347 | tools/benchmark-harness/src/sizes/package_measurements.rs:355-365 \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 \u0060tools/benchmark-harness/src/sizes/package_measurements.rs:355\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":"tools/benchmark-harness/src/sizes/package_measurements.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a2b0edbc2627a811355525293fd992255a4e7a5717995df646adda614da7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201311 lines \u00D7 4): tools/benchmark-harness/src/structural_sidecar/scoring.rs:462-472 | tools/benchmark-harness/src/structural_sidecar/scoring.rs:475-477 | tools/benchmark-harness/src/structural_sidecar/scoring.rs:501-510 | tools/benchmark-harness/src/structural_sidecar/scoring.rs:513-515 \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. 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, \u0060tools/benchmark-harness/src/structural_sidecar/scoring.rs:472\u0060 calls \u0060iter\u0060 and \u0060tools/benchmark-harness/src/structural_sidecar/scoring.rs:477\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":"tools/benchmark-harness/src/structural_sidecar/scoring.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c77371f8875a67440ff80013bdf59a9c3c78ff6b9bcbd7232e2d8ab687ff58d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/benchmark-harness/src/adapters/external.rs:438-448 | tools/benchmark-harness/src/adapters/external.rs:452-462 \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":"tools/benchmark-harness/src/adapters/external.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"519fb1447e583443e8493a350b09b7e71b3d4f2b371f1666702a6659cabaf825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/benchmark-harness/src/aggregate/mod.rs:317-326 | tools/benchmark-harness/src/validate_artifacts/aggregate_contract.rs:76-85 \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 \u0060tools/benchmark-harness/src/aggregate/mod.rs:317\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/aggregate/mod.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3bc603ad3fa2eb93b1292c754821b96ab737ad3ea31523d38f4353a812545c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/benchmark-harness/src/comparison/execution.rs:260-269 | tools/benchmark-harness/src/comparison/report.rs:291-300 \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":"tools/benchmark-harness/src/comparison/execution.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af60bbf8810c3fb229598210f1f754488dd9c60ad18a878ee66b310daea1760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tools/benchmark-harness/src/json_quality.rs:478-487 | tools/benchmark-harness/src/quality/mod.rs:456-465 \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":"tools/benchmark-harness/src/json_quality.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c30a52800068a74ced0c7fbdfe40748f679d1e63a4690c4aa1b56ed162d53c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/fixture.rs:43-50 | crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large/source.rs:39-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/fixture.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/fixture.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fdc605e909c2531cf0605a2e090624bcda81b940ab607013a3bfe4407c6167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 3): tools/benchmark-harness/src/json_quality.rs:136-143 | tools/benchmark-harness/src/json_quality.rs:200-201 | tools/benchmark-harness/src/json_quality.rs:346-353 \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 \u0060tools/benchmark-harness/src/json_quality.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"tools/benchmark-harness/src/json_quality.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc51a725cd2a9ec212fe6c0dff0106eee4d3d0a528e2d45392f04bcf3062a621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): tools/benchmark-harness/src/aggregate/ranking.rs:154-159 | tools/benchmark-harness/src/aggregate/ranking.rs:495-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/benchmark-harness/src/aggregate/ranking.rs:154\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":"tools/benchmark-harness/src/aggregate/ranking.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af0ed34fe348c7d70049715f855a4c7e0bc689904e69292cfbd709153157fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs:4-10 | crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs:13-19 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/image_budget_tests/source.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9369fd9c2b2c26908e24063c84566cb8cc926faa6daedae9aa13b2157fc16c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/adaptive.rs:26-32 | crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/otsu.rs:10-16 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/adaptive.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/reduced_jpeg_memory_tests/adaptive.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b0d08bf6200668db028fe3e74a00339588ac5fec73aa7797edaa7b4bcddb11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/fixture.rs:43-48 | crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large/purity.rs:21-25 | crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large/source.rs:39-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/fixture.rs:43\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/fixture.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e991138b24a3f955eaa9fb6e3b494865bf1055cb452e8bf960311ae91d0af3a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/xobject_budget_parity_tests/preferred_stage.rs:101-107 | crates/xberg/src/extractors/pdf/ocr/xobject_budget_parity_tests/support.rs:275-281 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/xobject_budget_parity_tests/preferred_stage.rs:101\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/xobject_budget_parity_tests/preferred_stage.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44dc48b66062e7f6f27607ec96c29317737da0821fcb3cfaccfc8456621a592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/benchmark-harness/src/aggregate/percentiles.rs:219-224 | tools/benchmark-harness/src/output.rs:407-412 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060tools/benchmark-harness/src/output.rs:414\u0060 calls \u0060iter\u0060, \u0060copied\u0060, \u0060filter\u0060 and \u0060tools/benchmark-harness/src/aggregate/percentiles.rs:226\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":"tools/benchmark-harness/src/aggregate/percentiles.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"995b44d3beabc66f40324c6c9c8770d9d35637af0be02b2706d566999178180f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/benchmark-harness/src/monitoring/mod.rs:534-539 | tools/benchmark-harness/src/monitoring/mod.rs:667-671 \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":"tools/benchmark-harness/src/monitoring/mod.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbcf63d1950af26a07928cfefb6fd49bb51f8ef50bba287d0a05ed7f1a6ff35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/benchmark-harness/src/structural_sidecar/scoring.rs:360-365 | tools/benchmark-harness/src/structural_sidecar/scoring.rs:408-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/benchmark-harness/src/structural_sidecar/scoring.rs:360\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":"tools/benchmark-harness/src/structural_sidecar/scoring.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"537429aee8b0f49d9afa2fee3fa7c3c40bc155f0e950f853b090970c375b13fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/benchmark-harness/src/validate_artifacts/aggregate_contract.rs:567-571 | tools/benchmark-harness/src/validate_artifacts/raw_artifacts.rs:352-356 \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 \u0060tools/benchmark-harness/src/validate_artifacts/aggregate_contract.rs:567\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":"tools/benchmark-harness/src/validate_artifacts/aggregate_contract.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48d1bb63b027638ed17d712158a4077cd83024f8bab9bef3c8f6fd7915283cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/benchmark-harness/src/ocr_preflight.rs:225-231 | tools/benchmark-harness/src/runner/helpers.rs:313-319 \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":"tools/benchmark-harness/src/ocr_preflight.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"302acee80dabec9daba97c918f91ab1dbbf4d8133a94886400c87c27be6846f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tools/benchmark-harness/src/validate_artifacts/aggregate_contract.rs:574-584 | tools/benchmark-harness/src/validate_artifacts/raw_artifacts.rs:359-369 \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 \u0060tools/benchmark-harness/src/validate_artifacts/aggregate_contract.rs:574\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":"tools/benchmark-harness/src/validate_artifacts/aggregate_contract.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5a4d193b70a7df47987ad9343642f5cd568f85fb1ab182c8ca3504f2eb88a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/benchmark-harness/src/embed_benchmark.rs:248-255 | tools/benchmark-harness/src/embed_benchmark.rs:265-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tools/benchmark-harness/src/embed_benchmark.rs:265\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":"tools/benchmark-harness/src/embed_benchmark.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccae9c77a7048fd3f7ff12ccd655380e1df723fd5bb0512c20be9c6fe25c89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/benchmark-harness/src/adapters/native.rs:634-638 | tools/benchmark-harness/src/adapters/native.rs:716-723 \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 \u0060tools/benchmark-harness/src/adapters/native.rs:634\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":"tools/benchmark-harness/src/adapters/native.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba260b48016595b7fac6c082f842e90d84b80d2efc56d462b07f9bf9b6b995d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large.rs:84-91 | crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large/purity.rs:110-114 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large.rs:84\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/english_recovery_tests/large.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d7d96e0d35456b4aaa16fd61cd31052bc8c4cce7c1d0a34d09074e80efcf84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): tools/benchmark-harness/src/adapters/external.rs:159-165 | tools/benchmark-harness/src/adapters/external.rs:181-187 | tools/benchmark-harness/src/adapters/external.rs:562-568 \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 \u0060tools/benchmark-harness/src/adapters/external.rs:159\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":"tools/benchmark-harness/src/adapters/external.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd1c4cd1b5321cb3d5940b2c4aa0666d5e7a463cf2b6aef45c39a60bf9dbc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/benchmark-harness/src/batch_diagnostic.rs:370-376 | tools/benchmark-harness/src/batch_diagnostic.rs:389-395 \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 \u0060tools/benchmark-harness/src/batch_diagnostic.rs:370\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":"tools/benchmark-harness/src/batch_diagnostic.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee6f3f827a3b40f067878d36ff5d80e33f396e41651e256d4f95a6b1c8c8541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/benchmark-harness/src/aggregate/mod.rs:91-95 | tools/benchmark-harness/src/aggregate/ranking.rs:604-608 \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":"tools/benchmark-harness/src/aggregate/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f448c676dfec5ae176aa8ed517a69069c21abc1c0497666dc1f8fc62d8d5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 5): tools/benchmark-harness/scripts/docling_extract.py:227-261 | tools/benchmark-harness/scripts/markitdown_extract.py:60-94 | tools/benchmark-harness/scripts/mineru_extract.py:186-220 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:68-102 | tools/benchmark-harness/scripts/unstructured_extract.py:77-111 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/markitdown_extract.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4b1dfd953482e9fffe3d4616a9210caf0af3bfb0e75722b46df217926f4e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): tools/benchmark-harness/scripts/markitdown_extract.py:126-150 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:134-158 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/markitdown_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/pymupdf4llm_extract.py\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 101 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":"tools/benchmark-harness/scripts/markitdown_extract.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68c03496f6dfa755de8fe500d73bcd2f81277eee0faebda8a0f102d8f2f2646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): scripts/ci/ruby/vendor-xberg-core.py:147-170 | scripts/ci/ruby/vendor-xberg-core.py:172-195 \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":"scripts/ci/ruby/vendor-xberg-core.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"363ee2edc4a39abd94d665b0d7905906835b61ccc1e50c6edd68111cb0d64b55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py:138-155 | tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py:172-190 | tools/generate_test_fixtures/src/generate_test_fixtures/odt_revisions.py:133-149 \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 \u0060tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py:138\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":"tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0160d16678accb098166567e3fb684d07cfd3804876049281458a675dfc5334e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py:94-112 | tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py:139-156 \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 \u0060tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py:94\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":"tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1886babab075833632e28130652e70e749828fd24ad622548ee409b72223b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201318 lines \u00D7 4): tools/generate_test_fixtures/src/generate_test_fixtures/odt_revisions.py:111-114 | tools/generate_test_fixtures/src/generate_test_fixtures/pptx_comments.py:106-123 | tools/generate_test_fixtures/src/generate_test_fixtures/security_fixtures.py:44-61 | tools/generate_test_fixtures/src/generate_test_fixtures/xlsx_revisions.py:92-109 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. 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":"tools/generate_test_fixtures/src/generate_test_fixtures/odt_revisions.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8de8b44d3e4a804ffdeab36ee58dbf3d63920dde84cd86472dfe7506d45a38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): tools/benchmark-harness/scripts/build_language_sidecar.py:58-81 | tools/benchmark-harness/scripts/plausibility_calibrate.py:83-100 \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":"tools/benchmark-harness/scripts/build_language_sidecar.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcea358710d69d2d35eefd1a5825f8b12202acb21f71f1e3ffa93ed6855196c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): tools/benchmark-harness/scripts/docling_extract.py:207-223 | tools/benchmark-harness/scripts/markitdown_extract.py:40-56 | tools/benchmark-harness/scripts/mineru_extract.py:166-182 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:48-64 | tools/benchmark-harness/scripts/unstructured_extract.py:57-73 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/markitdown_extract.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e29941484db9421b14e622ada60cf4f06f6f98e443b92b1603a71568b491a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): tools/benchmark-harness/scripts/docling_extract.py:325-341 | tools/benchmark-harness/scripts/mineru_extract.py:327-343 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/mineru_extract.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 130 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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5e7f476908ebe7ffcb6ebbb7e965681907a45eb33e419ff0efa8360b644cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): tools/benchmark-harness/scripts/docling_extract.py:293-308 | tools/benchmark-harness/scripts/mineru_extract.py:308-323 | tools/benchmark-harness/scripts/unstructured_extract.py:143-158 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/mineru_extract.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 130 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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a1b8c285c26d4c6f51c61e23b78a9b687e638be528f2de41784567f11a5f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): tools/benchmark-harness/olmocr_bench/freeze.py:35-49 | tools/benchmark-harness/parsebench_html/runner.py:45-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/olmocr_bench/freeze.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c73cbf9d0eaa93e0a9bf54ebbd1c43df67671e4d0f393b9a17e426faba9c37c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tools/benchmark-harness/scripts/mineru_extract.py:291-304 | tools/benchmark-harness/scripts/unstructured_extract.py:126-139 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/mineru_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/unstructured_extract.py\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/scripts/mineru_extract.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa5d670a7689781d96f84dffac878ef8773e901c5189bf3cbc42309581172eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): tools/benchmark-harness/scripts/docling_extract.py:326-337 | tools/benchmark-harness/scripts/mineru_extract.py:328-339 | tools/benchmark-harness/scripts/unstructured_extract.py:163-174 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/mineru_extract.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 130 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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"33345ffc7a40260ccddbfee921b3bfec1da5f7ad22fd9b5df5756d9c9f7c1642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): tools/benchmark-harness/scripts/docling_extract.py:296-306 | tools/benchmark-harness/scripts/markitdown_extract.py:127-137 | tools/benchmark-harness/scripts/mineru_extract.py:311-321 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:135-145 | tools/benchmark-harness/scripts/unstructured_extract.py:146-156 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/markitdown_extract.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 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":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8bf940e98192029a61db911f84b457e399173ff34bfa2ee5f03593db1df3db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): integrations/python/surrealdb/examples/chunk_explorer.py:116-124 | integrations/python/surrealdb/examples/incremental_ingest.py:68-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/python/surrealdb/examples/chunk_explorer.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae42d55239e40445f37a31c13d89e7c15a8f416c0d0cd250146db3ab572fce43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/ci/check-alef-readme-paths.py:160-168 | scripts/ci/check-alef-readme-paths.py:172-181 \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 \u0060scripts/ci/check-alef-readme-paths.py:160\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":"scripts/ci/check-alef-readme-paths.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadcbe000b2645a47c86423631a7de3add25e524242cdbd9ae60df5549257713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/benchmark-harness/scripts/docling_extract.py:360-368 | tools/benchmark-harness/scripts/mineru_extract.py:368-376 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/mineru_extract.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/benchmark-harness/scripts/mineru_extract.py:367\u0060 calls \u0060_terminate_lingering_group_processes\u0060 and \u0060tools/benchmark-harness/scripts/docling_extract.py:359\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f03766cc157f85cd42a61d9d911b890cb1f0c797a3a65406126cc48657d97f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): integrations/python/surrealdb/examples/chunk_explorer.py:114-121 | integrations/python/surrealdb/examples/search_patterns.py:69-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/python/surrealdb/examples/chunk_explorer.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fb3a7faf5793c1e96d9e1dc0ef8999d90005c7ab693dd8604c37527c1ad069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): integrations/python/surrealdb/examples/search_patterns.py:33-41 | integrations/python/surrealdb/examples/search_patterns.py:45-53 | integrations/python/surrealdb/examples/search_patterns.py:57-65 \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. 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":"integrations/python/surrealdb/examples/search_patterns.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"037a4a3b9b49dc88df8b89b1c520a39cf0e22d2d9d713c9880bd6ba6e48adeb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fixtures/repros/tall-scan-strips/generate-scaled.py:36-45 | fixtures/repros/tall-scan-strips/generate.py:149-158 \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":"fixtures/repros/tall-scan-strips/generate-scaled.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f045ee9d0d34c1ec4b3a04429432c3544c11be0e19144158be6917042832aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/benchmark-harness/scripts/corpus_cache_manifest.py:265-270 | tools/benchmark-harness/scripts/corpus_cache_manifest.py:271-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060tools/benchmark-harness/scripts/corpus_cache_manifest.py:262\u0060 calls \u0060add_argument\u0060, \u0060add_parser\u0060 and \u0060tools/benchmark-harness/scripts/corpus_cache_manifest.py:270\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":"tools/benchmark-harness/scripts/corpus_cache_manifest.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"da49c500f2a0e28ee7091ed26ffb8bf3941c725827dda05724f874d8e69e14dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/benchmark-harness/parsebench_html/contracts.py:16-21 | tools/generate_test_fixtures/src/generate_test_fixtures/gt_schema.py:164-173 \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":"tools/benchmark-harness/parsebench_html/contracts.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b966add70bbdb489cc48d63e4f2716cffb2dac80298d775eee1eacc9bafad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): tools/benchmark-harness/scripts/docling_extract.py:24-28 | tools/benchmark-harness/scripts/markitdown_extract.py:17-21 | tools/benchmark-harness/scripts/mineru_extract.py:53-57 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:21-25 | tools/benchmark-harness/scripts/unstructured_extract.py:18-22 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/markitdown_extract.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e2099caf9a4dc12e01574f778fdb2c7e8057fee7e305f9f28149fc3cbaf247"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): tools/benchmark-harness/scripts/docling_extract.py:265-272 | tools/benchmark-harness/scripts/markitdown_extract.py:98-105 | tools/benchmark-harness/scripts/mineru_extract.py:280-287 | tools/benchmark-harness/scripts/pymupdf4llm_extract.py:106-113 | tools/benchmark-harness/scripts/unstructured_extract.py:115-122 \u2014 before extracting anything, compare \u0060tools/benchmark-harness/scripts/docling_extract.py\u0060 and \u0060tools/benchmark-harness/scripts/markitdown_extract.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/scripts/docling_extract.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ddea4a953ab9fc14c83eeb3929955625b40cb14f26c20d41795b6dbdf77134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py:64-70 | tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py:114-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb19a5c453524f73feb9ad6d8e87be6b06086a6c154de9b50e8851a55ec2e0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tools/benchmark-harness/olmocr_bench/contracts.py:75-80 | tools/benchmark-harness/parsebench_html/safeguards.py:114-119 \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":"tools/benchmark-harness/olmocr_bench/contracts.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d45617e619caa73af7e66ef9663be7fa2920d860304dfad3c1bfe2964d6bfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py:174-180 | tools/generate_test_fixtures/src/generate_test_fixtures/docx_revisions.py:199-205 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/generate_test_fixtures/src/generate_test_fixtures/diff_pairs.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed9e555d06bc34a1a1133adb66b81f07412118e10627f8bca48eff4b0d69bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/benchmark-harness/olmocr_bench/contracts.py:102-106 | tools/benchmark-harness/parsebench_html/safeguards.py:18-22 \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":"tools/benchmark-harness/olmocr_bench/contracts.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34cd7543ca3f0fd964be80fa0ed9993607d03cbad35c928a2541235e9a8a939"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-candle-ocr: xberg-candle-ocr: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cbb439a1e9d7e6e89e728d54080d09209ff1a679b9b229373957702a7ea07765"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-libwpd: xberg-libwpd: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d1ce1b55c35fa64c663e48e42a96ffa1b8c022e34538a9c0b34e15a8d8be9e81"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-tesseract: xberg-tesseract: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0fc406bc44127c0abc1b6e039308a7698a3b7422eced5e5bb9f544b7fe46213e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-native-pdf: xberg-native-pdf: abstractness 0.04, instability 0.00, distance 0.96 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2300afe89b1a0243a2ead9d1743f1b8224bf26323fd3eab184bdd3c45dbb7ded"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-libheif: xberg-libheif: abstractness 0.05, instability 0.00, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6e24ddf948d692f6007c279d7c3387cfe2bc4286e80e041f72f4eb75449d5b6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-gliner: xberg-gliner: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b9b42fcc1e0a4f4b666fc385fd799a5b000c0cf980b15bb37507b8276d150222"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-paddle-ocr: xberg-paddle-ocr: abstractness 0.07, instability 0.00, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"29ae3d48e6cfd94971c9f618e26edfe53246d6a28d12d2373d3547b52b122e81"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: xberg-pdfium-render: xberg-pdfium-render: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ec3a78ed448be62ce59a710bb7fb841267df5609924a94702ea94221c5bd4570"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DynamicPdfiumBindings (LCOM4 446): DynamicPdfiumBindings\u0027s methods fall into 446 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 446 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-pdfium-render/src/bindings/dynamic_bindings.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"653f1f1a3b5e847b5e71eef1b9d8474f2035502d4a24c761ead09a6bd6e1f33c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OcrBackendDartCallbacks (LCOM4 13): OcrBackendDartCallbacks\u0027s methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dart/rust/src/lib.rs"},"region":{"startLine":23872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6dbfb652d12ad88bc2f0b1f7ff0087f4638f6718ced4831c2e027cbf2d5928"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PaddleOcrConfig (LCOM4 12): PaddleOcrConfig\u0027s methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/config.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"757ea3161f2fe2a22195d346525681cd7a7f780d3b3233d7c18f0d6e41fbece6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: XbergMcp (LCOM4 9): XbergMcp\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/mcp/server.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d5bdd2cb90f92b6510626d7be8cebbfe1eaa2a0ed1bec9c07dc43043a9c43e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LibHeif (LCOM4 8): LibHeif\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-libheif/src/heif.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c82ac8be5026f2c9e62019bf8f1408be150e347ff48f547fadee2172f3e46e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PostProcessorDartCallbacks (LCOM4 5): PostProcessorDartCallbacks\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dart/rust/src/lib.rs"},"region":{"startLine":24435}}}],"partialFingerprints":{"codehealthFindingId/v1":"915a320cc5e4667f8768524cd2502829e6ef149478c09f2c9fb7110061803517"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InternalDocument (LCOM4 4): InternalDocument\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/internal.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f54d26a139a3dca87f059962a06ffa260b3e5418a8a4914f74a1570b88aaa1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Parameters (LCOM4 4): Parameters\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/config.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"713b83f03c333d19d4a432085a52408e459d79e9f806d9e8a87b020f7d2caf8e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImageContent (LCOM4 4): ImageContent\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/elements/image.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"937b3b8418ebaba665a7d7c8c45f6c221566b622abfdb3741d47b942fa1cdc25"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PathContent (LCOM4 4): PathContent\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/elements/path.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84a5c43b6ffcb7407da9a00130bbd2fae9a0abc0f9ce6f8fb3ee64bc1e3adf3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DocumentExtractorDartCallbacks (LCOM4 4): DocumentExtractorDartCallbacks\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/dart/rust/src/lib.rs"},"region":{"startLine":24914}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4314f27afe9abc0f716bed260aa4c66c9592ad0f1411b3bb763b420697332ae"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 .NET and JavaScript/TypeScript suite: Coverage NOT MEASURED: the .NET half could not be measured \u2014 the test suite ran but not one test passed \u2014 the coverage report describes the failed run, not the code; the JavaScript/TypeScript half could not be measured \u2014 the dependency install for the repository root failed in the analyzer sandbox (ERR_PNPM_BROKEN_LOCKFILE\u2009 The lockfile at \u0022pnpm-lock.yaml\u0022 is broken: expected a single document in the stream, but found more), so the suite never ran. This repository\u0027s production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test_RegisterEmbeddingBackendTraitBridge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/csharp/tests/PluginApiTests.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9ea4de97c29b7b1697611f99784583bee0a720e31aff119e75e1874a8d787e"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test_RegisterOcrBackendTraitBridge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/csharp/tests/PluginApiTests.cs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c4070e907051c4069811f2ce80cef046cfa1039004afba2e11364032cf54d8"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test_RegisterPostProcessorTraitBridge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/csharp/tests/PluginApiTests.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"546ae82844bac4a24910271374165718a2835eb6f5d3314bd6ab0a341c9e1782"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test_RegisterRerankerBackendTraitBridge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/csharp/tests/PluginApiTests.cs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b7f7c5a5cc8004c912a3ff281b68776b7d887f49f1c2aa73168f9f8db29672"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test_RegisterTokenizerBackendTraitBridge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/csharp/tests/PluginApiTests.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af35b646da0dd7f7c308a102bcee5199dee3e2c28e4d070d958f04c39b5e46d"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: Test_RegisterValidatorTraitBridge: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"e2e/csharp/tests/PluginApiTests.cs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8309b85dc7fb0771606d5645cdcee83cf574125433693353d7be46c00a562ba7"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5baf812915b68975087436c87bd639428312ed85495a0580753904b42254182"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pdf/ocr/pipeline.rs: crates/xberg/src/extractors/pdf/ocr/pipeline.rs changed 250 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 287 in xberg::extractors::pdf::ocr::pipeline::extract_mixed_ocr_native_with_layout_inputs at line 1124. 213 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/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":"crates/xberg/src/extractors/pdf/ocr/pipeline.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d4dc9421af643697ad93eab7ccb5298be02c4be72f80c686f351109a9eeb17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pdf/mod.rs: crates/xberg/src/extractors/pdf/mod.rs changed 148 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 166 in PdfExtractor::extract_core_native_with_layout_pages at line 3030. 112 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/mod.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdb59cbe9a74471b0eb085b729522cfa03c4c3d583b351496838ed3f352b3fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/rendering/page_renderer.rs: crates/xberg-native-pdf/src/rendering/page_renderer.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 183 in PageRenderer::execute_operators_with_backdrop at line 1029. 51 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/page_renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/page_renderer.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5c0ca45a71409397ac8df2d4027caa4ee6a3ce79a3df411c9fb83465beb396"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/ocr/processor/execution.rs: crates/xberg/src/ocr/processor/execution.rs changed 108 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in xberg::ocr::processor::execution::perform_ocr at line 2119. 89 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/execution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85050cefd6e4aae738c5433daa379f52bd7ee8a5f812c4bf8bf043604ee3257"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/structure/pipeline.rs: crates/xberg/src/pdf/structure/pipeline.rs changed 111 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 80 in xberg::pdf::structure::pipeline::build_document_structure_with_native at line 3844. 90 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/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":"crates/xberg/src/pdf/structure/pipeline.rs"},"region":{"startLine":3844}}}],"partialFingerprints":{"codehealthFindingId/v1":"374fdc26e786720007fbb84d1d0d2a7e4819ee15a31ba80d022f4ad573f03355"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/docx/parser.rs: crates/xberg/src/extraction/docx/parser.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 185 in DocxParser::parse_body_elements at line 3238. 30 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/docx/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/parser.rs"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8ee2cf1d65ad7c391cdbe6d0533506367e4fc214013cddbe66735560514c09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/fonts/font_dict.rs: crates/xberg-native-pdf/src/fonts/font_dict.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 221 in xberg_native_pdf::fonts::font_dict::standard_encoding_lookup at line 6186. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/fonts/font_dict.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/font_dict.rs"},"region":{"startLine":6186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ed4736cbf780cf57ff0cdbadf0fa66f1c402f9de4407c5ba130ab59eb57142"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/docx.rs: crates/xberg/src/extractors/docx.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in xberg::extractors::docx::build_internal_document at line 93. 34 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/docx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docx.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"042b9277f404f5bf617eb7d90682e08a4f23913f1e528020b1b8773fd8814cfb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/table_reconstruct.rs: crates/xberg/src/pdf/table_reconstruct.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in xberg::pdf::table_reconstruct::post_process_table_inner at line 524. 30 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/table_reconstruct.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/table_reconstruct.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0326d5d8cf9d9861bc4d6b7974272f312a42600449e033ffe05ebe964fb862"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/rendering/comrak_bridge.rs: crates/xberg/src/rendering/comrak_bridge.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 91 in xberg::rendering::comrak_bridge::build_comrak_ast_with_table_mode at line 1240. 33 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/comrak_bridge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/comrak_bridge.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bf195814a7bc73634bec4e693dc0f4b6745a765e20a0a501f7d6ddf42f7b8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pdf/extraction.rs: crates/xberg/src/extractors/pdf/extraction.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in xberg::extractors::pdf::extraction::extract_all_from_native_document at line 617. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/extraction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/extraction.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da1f1c99f9dc88a4b8c822c1a8eba88ca01d14aa3a926a093225be8b43ddd4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/markdown.rs: crates/xberg/src/extractors/markdown.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 254 in MarkdownExtractor::build_internal_document_with_jsx at line 127. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/markdown.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c935c02c12415a277f66765b34b056349c7ed1b9feaa8e2724303991c08fd5b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/djot_format/extractor.rs: crates/xberg/src/extractors/djot_format/extractor.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 190 in DjotExtractor::build_internal_document at line 37. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/djot_format/extractor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69ff9af75c958644df58c1d25905e58c3cc3ff461ddacf45cfe3e63ef1ec74d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/image.rs: crates/xberg/src/extractors/image.rs changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ImageExtractor::extract_with_ocr_pass at line 3193. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/image.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99ce16dfdaa23bb6765f635de92639d65ce1b171b1d42f29ded009de2836a6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/extractors/text/mod.rs: crates/xberg-native-pdf/src/extractors/text/mod.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in xberg_native_pdf::extractors::text::should_insert_space at line 1203. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ebe5a6065770026feda20f0b3c0626baf2618b18b932c04b2c5b41aec8cb72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/rst.rs: crates/xberg/src/extractors/rst.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 182 in RstExtractor::build_internal_document_within at line 986. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/rst.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef43902befb9c9d9b4f6c2d6dd33984869ba55946bc972571e52a8c4b0cac8cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/rendering/separation_renderer.rs: crates/xberg-native-pdf/src/rendering/separation_renderer.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in xberg_native_pdf::rendering::separation_renderer::execute_separation_operators at line 1489. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/separation_renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/separation_renderer.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eba04e2d3522245065f7c6975e92d1efb9bad9cfa1e0ab18540707fd9aa4515"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/core/pipeline/mod.rs: crates/xberg/src/core/pipeline/mod.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in xberg::core::pipeline::run_pipeline_impl at line 542. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/pipeline/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f6e6ad3d6f0201f10b26cd2256ceb90449abd4b8b573c1232e231c8538a93a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/extractors/images.rs: crates/xberg-native-pdf/src/extractors/images.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in xberg_native_pdf::extractors::images::extract_image_from_xobject at line 1439. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/images.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/images.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0714f971e91d976dcbd1e8bac15f7f2678ada3bc67d941607bacf1ce32551c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/rendering/text_rasterizer.rs: crates/xberg-native-pdf/src/rendering/text_rasterizer.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in TextRasterizer::render_unicode_text at line 1237. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/text_rasterizer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/text_rasterizer.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd3bce2108636989df68c82c8661ad775b692eae8dbc09120737bd1ef743c02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/rendering/djot.rs: crates/xberg/src/rendering/djot.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in xberg::rendering::djot::render_djot at line 18. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/djot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb85e05ee8b66666527a230bf9856786cfdb456454b725c587a6b960fadaa86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/structure/classify.rs: crates/xberg/src/pdf/structure/classify.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in xberg::pdf::structure::classify::classify_paragraphs at line 94. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/classify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c3c02e41a28310ab89cb2bfe4ba8e2d7a87c981eaf1adddeafb439bc64a66e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/extractors/text/operators.rs: crates/xberg-native-pdf/src/extractors/text/operators.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 113 in TextExtractor::execute_operator_with_paint_restarts at line 18. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/operators.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/operators.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a3eb6e225dd6f968be1a1a34afc659da09a1e9d158775e83a9b9344a04b990"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/ocr/hocr_parser.rs: crates/xberg/src/ocr/hocr_parser.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in xberg::ocr::hocr_parser::parse_paragraph at line 830. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/hocr_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/hocr_parser.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"827be1e3f61cfbe4eb25efdf50cca0c47c136f7e1711ae4cbd6c91059f8f73af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/structure/spatial_table_detector.rs: crates/xberg-native-pdf/src/structure/spatial_table_detector.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in xberg_native_pdf::structure::spatial_table_detector::split_table_at_section_dividers at line 3856. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/structure/spatial_table_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":"crates/xberg-native-pdf/src/structure/spatial_table_detector.rs"},"region":{"startLine":3856}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bf8d621b7f28a2934549a81196434dd251c1ae90d06e157c96108b94fabd25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs: crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in XYCutStrategy::short_line_central_corridor_prose at line 1284. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/xycut.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"280c385d7335d8db2c9af53a98d8d5e59eb694f94851312d3c346fe3b3e3da8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/extractors/text/advance.rs: crates/xberg-native-pdf/src/extractors/text/advance.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in TextExtractor::append_advance_buffer at line 320. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/advance.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e063c485119078e592bf540cec75d1782f489d60baaa2cec909ec68bb7a068b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/structure/assembly.rs: crates/xberg/src/pdf/structure/assembly.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in xberg::pdf::structure::assembly::extract_text_with_glyph_offset at line 1464. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/assembly.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85e6131b8d240f70967b113b6d69ea3761865883757fee7b8fa9c774ad471d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/core/config/extraction/core.rs: crates/xberg/src/core/config/extraction/core.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ExtractionConfig::with_file_overrides at line 747. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config/extraction/core.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/core.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a9a32e411c5bf2aa17bc9da8939bc222d2aa4871ef60e607b7649dd390c61c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/typst.rs: crates/xberg/src/extractors/typst.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in TypstExtractor::build_internal_document at line 87. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/typst.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8980db16a909f7adc7ae95587c8c992c950eea20e695809644d4f545a11fa83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/extract_api.rs: crates/xberg-native-pdf/src/document/extract_api.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in PdfDocument::assemble_positioned_words at line 1492. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/extract_api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/extract_api.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe91940c0fea2bea35121f6af95d06b96276f892025ab0c453bd6a0903fe2268"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/orgmode.rs: crates/xberg/src/extractors/orgmode.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in OrgModeExtractor::build_internal_document at line 340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/orgmode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d980820771c3bffb50306710c49558f23de412c0b7bcd65920ac72aa685eb0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/structure/adapters.rs: crates/xberg/src/pdf/structure/adapters.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in xberg::pdf::structure::adapters::reattach_ocr_layout_list_markers at line 1466. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/adapters.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d893362a68f08484413cc4f3cc9a1366eed974dff8bb8056879a18be3c7cb47b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/core/extractor/file.rs: crates/xberg/src/core/extractor/file.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in xberg::core::extractor::file::hash_extraction_config at line 877. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/extractor/file.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/file.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"be25247758d278556aa460116a5c1969bc0856bb3410ce2f1824be0aca9e7dee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/content/parser.rs: crates/xberg-native-pdf/src/content/parser.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in xberg_native_pdf::content::parser::parse_content_stream_paths_only at line 220. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/content/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"529cd1dda0c1f8b07972889d7e5c8d0238153cd3eea5e83bb040164f5e79fba3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/paths.rs: crates/xberg-native-pdf/src/document/paths.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in PdfDocument::process_form_xobject_paths at line 514. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/paths.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/paths.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f944af2a1bd9a84d2bc54f99174b7cf36ce0352fef9c103403a9140ca9dcab7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/extractors/text/xobjects.rs: crates/xberg-native-pdf/src/extractors/text/xobjects.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in TextExtractor::process_xobject at line 141. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/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":"crates/xberg-native-pdf/src/extractors/text/xobjects.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3db3332bc2ff26d4c2e92a0b9c54592586bc5c317b7aad76c07a96926e010b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/odt.rs: crates/xberg/src/extractors/odt.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in xberg::extractors::odt::build_internal_elements at line 864. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/odt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"720971e6c2cf818138569a9dacf5752d8c6fabfd0d6fccf92dc0fab762fa62cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/ppt/mod.rs: crates/xberg/src/extraction/ppt/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in xberg::extraction::ppt::extract_texts_from_records at line 659. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/ppt/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/ppt/mod.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3c6296c2b65b7d18162c933f4405e44f8fc5699379a0a4a445ebc89e4d0ea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/mod.rs: crates/xberg-native-pdf/src/document/mod.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in xberg_native_pdf::document::collect_inks_from_color_space at line 1160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3671224df8394723b5bac3ce76c91669f3b21bd956ab74aba15f6fc26c0d8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/derive/mod.rs: crates/xberg/src/extraction/derive/mod.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in xberg::extraction::derive::compute_formatted_content_observed at line 737. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/derive/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"5877ef5bd5e95bdbd79a33258119f0b6e222ab24a37f89144574937bc4e631b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-cli/src/main.rs: crates/xberg-cli/src/main.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in xberg_cli::main at line 844. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-cli/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/main.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f34bc1300a2f19caf87dffec4ac1ba12a005f2b396002a3890addd1be1e4ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/structure/paragraphs.rs: crates/xberg/src/pdf/structure/paragraphs.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in xberg::pdf::structure::paragraphs::numeric_multiplier_end at line 556. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/paragraphs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/paragraphs.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eef80d4a66ffd72f1687f4579b452b4a91887030c2bea8158c1b0fb9a9317f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/docbook.rs: crates/xberg/src/extractors/docbook.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in xberg::extractors::docbook::build_docbook_internal_document at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/docbook.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d93f8a7aebe278e0c2355c98829a72df75f6b2cd2b0dac127af6d10d53461a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs: crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in xberg::extractors::pdf::ocr::layer_token_recovery::plan at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea95a6b9c70124f065ab3932443940f4d31402ad9691e89c97314389a4ca0222"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/latex/mod.rs: crates/xberg/src/extractors/latex/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in LatexExtractor::process_content_line at line 929. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/latex/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f6c9e2bd19a7454fae1da0eb28a99332ba1f941f535d59adb6b7e0b8c77b4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pdf/ocr/tall_source.rs: crates/xberg/src/extractors/pdf/ocr/tall_source.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in xberg::extractors::pdf::ocr::tall_source::recover at line 234. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/tall_source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e88cf3d180ec27bd6f08341cd6953ebefb93348bd235844c6659ebd74030142"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/epub/mod.rs: crates/xberg/src/extractors/epub/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in EpubExtractor::build_internal_document at line 221. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/epub/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3bd6a75c25cc8a8eb39ce149549ca680e3698432316f292b892a21d8421dcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/fictionbook.rs: crates/xberg/src/extractors/fictionbook.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in FictionBookExtractor::build_internal_document at line 669. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/fictionbook.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/fictionbook.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c9b19b41b67b4df8edc150caf92c2bc84fd51ab32e69b84e5aef7874b7cbe3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/jupyter.rs: crates/xberg/src/extractors/jupyter.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in JupyterExtractor::terminal_text at line 502. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/jupyter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jupyter.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad710f08d38b86fd0c1e22db78290b347dd7aa36bad2f53b57c861ae94cc4382"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/objects.rs: crates/xberg-native-pdf/src/document/objects.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in PdfDocument::read_uncompressed_object at line 1115. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/objects.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/objects.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cd3f12995bf1c750d3d5bfe4cb74f8361d2b7736a0a98f53a814f829ebb51a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pptx.rs: crates/xberg/src/extractors/pptx.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PptxExtractor::push_markdown_content at line 260. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pptx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pptx.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"928ab1327a932021aa5a816fe9bd760c365a25471e8d7ed772f259803e59ba34"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/html.rs: crates/xberg/src/extractors/html.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in HtmlExtractor::extract_sync at line 710. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/html.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/html.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"8089f4d1e3673265fad8c15fd851ba0b053c063af4596294158e2912d54485f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/rendering/html_styled.rs: crates/xberg/src/rendering/html_styled.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in xberg::rendering::html_styled::render_elements at line 290. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/html_styled.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/html_styled.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5aa25b133a8d16af2d66296829a463f6e01c2f2b7b267d127f3b711a147f77a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/rendering/sidecar.rs: crates/xberg-native-pdf/src/rendering/sidecar.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in xberg_native_pdf::rendering::sidecar::initial_colour_for_space at line 1383. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/sidecar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/sidecar.rs"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b8b0fab5030124e48217d69a21c95451c622e614c6b1cbd805240bd7accb23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/jats/elements.rs: crates/xberg/src/extractors/jats/elements.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in xberg::extractors::jats::elements::extract_jats_all_in_one at line 15. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/jats/elements.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/elements.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4900d0415ffef163e69cc1717ad1e8a96aebade6e4778de6836e957d76039549"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs: crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in xberg::extractors::pdf::ocr::layer_token_recovery::minority_khmer::painting_candidates at line 456. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/minority_khmer.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb7387534f0076a1a72ba826adc8ef7fd9e8282aa7fba68b560ab7b6b833d80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/rendering/redaction_projection.rs: crates/xberg/src/rendering/redaction_projection.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in VisibleMarkdown::on_plain at line 519. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/redaction_projection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/redaction_projection.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7b77267e2218819384f85016bc3380623bd8869db686ad1dd6d3402938c28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/extractors/text/span_merging.rs: crates/xberg-native-pdf/src/extractors/text/span_merging.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in TextExtractor::merge_adjacent_spans at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/span_merging.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_merging.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5075fc7a7d6658fb5b0afaa1cc880b98e1737a54898d9a2271b175529c74d7c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/fonts.rs: crates/xberg-native-pdf/src/document/fonts.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in PdfDocument::load_fonts at line 499. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/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":"crates/xberg-native-pdf/src/document/fonts.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea264604aed8eb4d823758740d2dc4d007a3472e69dd3b05c7bbae47ac7cd6b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/docx/drawing.rs: crates/xberg/src/extraction/docx/drawing.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in xberg::extraction::docx::drawing::collect_txbx_content_text at line 432. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/docx/drawing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/drawing.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1445585a8a252856e49ee24174fee941b917a9d26cdbe08d817f2469431d8cbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/structure/text_repair.rs: crates/xberg/src/pdf/structure/text_repair.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in xberg::pdf::structure::text_repair::repair_contextual_ligatures_mapped at line 74. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/text_repair.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/text_repair.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4a5052870fe5571423b5f0877e8ab10bf1669a60e2d146bf89085d3ca6714d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/structure/layout_classify.rs: crates/xberg/src/pdf/structure/layout_classify.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in xberg::pdf::structure::layout_classify::apply_hint_to_paragraph at line 396. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/layout_classify.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/layout_classify.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5112553467848031bf24e404983e562f292e86d8ac5f4004bd3830db32d24f94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/jats/mod.rs: crates/xberg/src/extractors/jats/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in xberg::extractors::jats::extract_para_with_annotations_jats at line 55. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/jats/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ac6c6bf7388a381e5b924d0701e1c9f847006e2be2d602c23043f4a1334ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/hwpx.rs: crates/xberg/src/extractors/hwpx.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in xberg::extractors::hwpx::collect_section_formulas at line 118. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/hwpx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/hwpx.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2856612a8c38ea123920d3014f9e0f322b540aab3bc950c7c817a788fc0b010c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/xfa/parser.rs: crates/xberg-native-pdf/src/xfa/parser.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in XfaParser::parse_template at line 309. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/xfa/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xfa/parser.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a3ca539921f75f51fd1719684d9d1c9908094286193d0ae0b3770952aaa46a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/ocr/preprocessing.rs: crates/xberg/src/ocr/preprocessing.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in xberg::ocr::preprocessing::preprocess_pix at line 35. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/preprocessing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/preprocessing.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d9d623103a0539ee2b1e2978f228009deb200c452d1890e3cb0f760b4285de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/pdf/ocr/tall_source/samples.rs: crates/xberg/src/extractors/pdf/ocr/tall_source/samples.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in xberg::extractors::pdf::ocr::tall_source::samples::decode_source_gray at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/tall_source/samples.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/tall_source/samples.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63bb39ae78b2d4799d1888c13d4c3e3973e61e1488a59e6a47564caa637ea6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/core/extractor/cache_context.rs: crates/xberg/src/core/extractor/cache_context.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ModelSelection::for_script_retry at line 187. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/extractor/cache_context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/cache_context.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b652d1541a6af3455e1efadb6b350ad460d94ce1de7d96d6131f0fb2112d1bb3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/pages.rs: crates/xberg-native-pdf/src/document/pages.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in PdfDocument::get_page_from_tree_inner at line 843. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/pages.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/pages.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e310879399092f32bfe7167aefbfc295aa41a1aefe3c73239a47e87cecfa740"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/pdf/native/table/source_members/projection.rs: crates/xberg/src/pdf/native/table/source_members/projection.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in xberg::pdf::native::table::source_members::projection::page at line 200. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/native/table/source_members/projection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table/source_members/projection.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5137105676985e8210621a7c8cd27be9a8ea31c908185d2a72bc34641be549"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/core/pipeline/features.rs: crates/xberg/src/core/pipeline/features.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in xberg::core::pipeline::features::execute_chunking at line 536. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/pipeline/features.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/features.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b1898becc36e16eb9a12819704fee6c09c0d7d72207db6d15ee4c4fffd63c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/decoders/ccitt.rs: crates/xberg-native-pdf/src/decoders/ccitt.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in xberg_native_pdf::decoders::ccitt::decode_row_g4 at line 535. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/decoders/ccitt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/ccitt.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"10632c9b67a5712930212454413ac9c01ef324aade27b500f6ef6c8a0e9f0648"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/rtf/parser/text_extract.rs: crates/xberg/src/extractors/rtf/parser/text_extract.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TextParser::handle_skipped_control_word at line 789. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/rtf/parser/text_extract.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/text_extract.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"7752617599561c26911687ce07e613ec01c4bb0107698c4f03cc679ec4203d3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/xref.rs: crates/xberg-native-pdf/src/xref.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in xberg_native_pdf::xref::parse_xref_stream at line 709. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/xref.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"91209705842a0d179b0be973f32fa9de0c6953cc479b192a22b47bff3e5b6628"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/mathml.rs: crates/xberg/src/extraction/mathml.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in xberg::extraction::mathml::convert_apply at line 365. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/mathml.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fa19d8a69f9da5229f58ac306ba008cc89b534002a80cf22ae05bb26afd0c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/docx/table/mod.rs: crates/xberg/src/extraction/docx/table/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in xberg::extraction::docx::table::parse_row_properties at line 285. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/docx/table/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/table/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0081730bcf7bd27e748143764404529e27b0494ad3ad049c44319e05a3d63fa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/parser.rs: crates/xberg-native-pdf/src/parser.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in xberg_native_pdf::parser::parse_object_at_depth at line 206. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/parser.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"170bd99c0940a4dd3a044a3c48b0347cb06d00c9fc480f35b46c88ffaa5ee5da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/pptx/elements.rs: crates/xberg/src/extraction/pptx/elements.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Slide::to_internal_elements at line 417. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/pptx/elements.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/elements.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32e7856595ee6eeaffd6c81ea0ecb2198a188a7d3227a018e38d46097d5aaa3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/spans_text.rs: crates/xberg-native-pdf/src/document/spans_text.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PdfDocument::should_insert_space at line 610. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/spans_text.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"91197f9761ddeff2320e1ad22d02f04a1f1210c2db961a02e2929679c11b47b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extractors/odp.rs: crates/xberg/src/extractors/odp.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in OdpExtractor::extract_content at line 426. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/odp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odp.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c845bb459040984b2bb74bf1044eaade4a3f3a2bce58dbb368bb4d89fc825b5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/redaction/serialize.rs: crates/xberg-native-pdf/src/redaction/serialize.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in xberg_native_pdf::redaction::serialize::serialize_color_operator at line 229. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/redaction/serialize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/redaction/serialize.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b037b9aaa26f9c30b3857c5867939a56d33f5a0fc3eb1e49b9626ab37947b728"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/structure/parser.rs: crates/xberg-native-pdf/src/structure/parser.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in xberg_native_pdf::structure::parser::parse_k_children at line 504. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/structure/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/parser.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"84abd3acea034fc5ba576903d9380444a1b468860160fe64483a962eeea534f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/document/span_postprocess.rs: crates/xberg-native-pdf/src/document/span_postprocess.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in PdfDocument::postprocess_spans at line 304. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/span_postprocess.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/span_postprocess.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b778d491a7a719703222be6454b253c042df3e483bf4e20858159b4f02f5ee7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg/src/extraction/image_ocr/embedded_rows.rs: crates/xberg/src/extraction/image_ocr/embedded_rows.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in xberg::extraction::image_ocr::embedded_rows::assemble at line 40. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/image_ocr/embedded_rows.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_ocr/embedded_rows.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf41726fea60fc14340530308b307956b5dd6f557a826e673d0e5857156bd79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/sync_integration_versions.py: scripts/sync_integration_versions.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in sync_integration_versions.main at line 231. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/sync_integration_versions.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/sync_integration_versions.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d95e2e7bb9c00a951d10a50f25283362d985b315475c5732f68d43e555f00f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/xberg-native-pdf/src/structure/table_extractor.rs: crates/xberg-native-pdf/src/structure/table_extractor.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in xberg_native_pdf::structure::table_extractor::extract_cell at line 619. 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/structure/table_extractor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/table_extractor.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf21c04739b097295d448c609c9b4b03e1e43afd136769406d8bb6e6b9b6832"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/document.rs: crates/xberg/src/extractors/pdf/ocr/document.rs changed 53 times in last 90 days and 46 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 xberg::extractors::pdf::ocr::document::build_mixed_ocr_page_document at line 2631), 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(pdf): recover corroborated painted Latin OCR rows\u201D; \u201Ctest(pdf): preserve explicit OCR selection in glyph regression\u201D; \u201Cfix(pdf): report lost glyphs after explicit OCR pipelines\u201D; \u201Cfix(pdf): document the OCR projection argument count\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/document.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document.rs"},"region":{"startLine":2631}}}],"partialFingerprints":{"codehealthFindingId/v1":"e265f372c4561e417fdc0227b6c11a155ce5da369d88e2b76d978a6054140f8b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/rendering.rs: crates/xberg/src/extractors/pdf/ocr/rendering.rs changed 57 times in last 90 days and 45 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is xberg::extractors::pdf::ocr::rendering::reject_pooled_noise at line 492), 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(pdf): retry unresolved sparse glyph reads at normal DPI\u201D; \u201Cfix(ocr): address retained image-read review findings\u201D; \u201Cfix(ocr): isolate discarded PDF image reads\u201D; \u201Cfix(ocr): drop a rejected image\u0027s tables and judge small reads together\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/rendering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/rendering.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac7a888a7e987c36bdb2563c82b4fb9956b99fd4708fef320662194bbf97e42"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/native/text.rs: crates/xberg/src/pdf/native/text.rs changed 62 times in last 90 days and 38 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is xberg::pdf::native::text::append_span_separator at line 921), 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(pdf): restore discarded OCR reads across document outputs\u201D; \u201Cfix(extract): keep a native PDF\u0027s pages when the time limit stops it\u201D; \u201Cfix(pdf): cover the timeout stop deterministically and tighten its edges\u201D; \u201Cfix(pdf): keep finished pages when the extraction timeout stops a PDF\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/native/text.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/text.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5684c3c7a1ce8df7d3370af1b675e9731d27799eb77c80c3a1a98dc9dfb44c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/config/ocr.rs: crates/xberg/src/core/config/ocr.rs changed 49 times in last 90 days and 38 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is OcrConfig::validate at line 1202), 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(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(ocr): keep meaningful words beside symbol noise (#2974)\u201D; \u201Cfix(ocr): keep real digit lines that carry a quote or section mark\u201D; \u201Cfix(ocr): keep real short lines when pruning symbol noise\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config/ocr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/ocr.rs"},"region":{"startLine":1202}}}],"partialFingerprints":{"codehealthFindingId/v1":"296e60a723a2d646886bdef7208d8ae628a2ff432dd29dbc58f8326527e49742"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/derive/pages.rs: crates/xberg/src/extraction/derive/pages.rs changed 50 times in last 90 days and 36 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is xberg::extraction::derive::pages::build_pages at line 290), 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(extraction): reject duplicate fallback page boundaries\u201D; \u201Cfix(extraction): reconcile sparse page boundaries\u201D; \u201Cfix(extraction): reject overlapping fallback page ranges\u201D; \u201Cfix(extraction): retain usable page byte ranges\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/derive/pages.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/pages.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"4758de2343bda586ab90e8f2fe55c7a060f2475c02d25113b8f83f80596093d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/render.rs: crates/xberg/src/pdf/render.rs changed 40 times in last 90 days and 31 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::pdf::render::render_pdf_ocr_page_with_budget_evidence at line 1110), 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(pdf): honor configured OCR density across PDF routes (#2829)\u201D; \u201Cfix(pdf): keep render warnings with the extracting task\u201D; \u201Cfix(ocr): align cfg gates with their narrow-feature users\u201D; \u201Cfix(pdf): fit layout rasters within the memory budget\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/render.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c212144883cab5c04cddc4cdc87dbdda8bc49f7c3c5dc1d056b66528d5000e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/tesseract_backend.rs: crates/xberg/src/ocr/tesseract_backend.rs changed 44 times in last 90 days and 28 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is xberg::ocr::tesseract_backend::normalize_vertical_cjk_result at line 998), 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(ocr): recover Khmer and Han without duplicating text\u201D; \u201Cfix(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(ocr): drop the kept-line warning and name readers of the noisy count\u201D; \u201Cfix(ocr): keep the noise count for numeral lines and remap entity spans\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/tesseract_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/tesseract_backend.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"102dae6c6c7dab722c1717bce58e80fc4b79793e92328bd881165ddc1a083f23"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/internal.rs: crates/xberg/src/types/internal.rs changed 33 times in last 90 days and 26 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is InternalDocument::from at line 410), 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(pdf): drop stale adopted OCR page ranges\u201D; \u201Cfix(pdf): preserve unmarked adopted OCR transcripts\u201D; \u201Cfix(docx): keep style notes, links and placeholders out of Plain content\u201D; \u201Cfix(ocr): mark image-OCR gap pages and plugin OCR pages as OCR text\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/internal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/internal.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"e717a0b97c2e8df2a7db12b2c6adf52bbf1eed77647c1f78200381c866700953"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/table_core.rs: crates/xberg/src/table_core.rs changed 33 times in last 90 days and 26 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is xberg::table_core::fold_right_aligned_tracks at line 413), 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(pdf): bound repeated column edges, and keep wordy tables with a value column (#2290)\u201D; \u201Cfix(ocr): keep a repeated column edge from merging into the neighbouring cell\u201D; \u201Cfix(pdf): preserve numeric separators within table cells\u201D; \u201Cfix(ocr): preserve Arabic and Hebrew reading order\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/table_core.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/table_core.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"1268a55bf02cf6ad150d870abe4a576ce7dac320c78870d635cd448eeffdb7a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/config.rs: crates/xberg/src/ocr/processor/config.rs changed 30 times in last 90 days and 25 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::ocr::processor::config::hash_security_limits at line 42), 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(pdf): expire cached merged rows and painted overhangs\u201D; \u201Cfix(ocr): fit raw mixed PDF scans to workspace (#2572)\u201D; \u201Cfix(ocr): preserve certified source scan table rows (#2571)\u201D; \u201Cfix(ocr): recover explicit sideways PDF table scans (#2529)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/config.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"548c9d1dd88437a9aae94c66c8b3e5292d26c3470bdeda0abc43c90b336d363a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/cache/version.rs: crates/xberg/src/cache/version.rs changed 24 times in last 90 days and 23 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is xberg::cache::version::cache_version_tag at line 130), 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(pdf): preserve overprinted Separation process text\u201D; \u201Cfix(ocr): recover sideways prose on mixed PDF scan pages\u201D; \u201Cfix(ocr): verify embedded PNG predictor panels\u201D; \u201Cfix(pdf): preserve indexed rows across source spellings\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/cache/version.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cache/version.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10a8ed40f4416dfbb533cae288a5c86eff35f7df163e272c499459e77241a2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/paddle_ocr/backend.rs: crates/xberg/src/paddle_ocr/backend.rs changed 30 times in last 90 days and 20 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 PaddleOcrBackend::process_image at line 1560), 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(ocr): apply max_threads to PaddleOCR ORT sessions (#2660)\u201D; \u201Cfix(paddle): preserve order after automatic PDF rotation (#2522)\u201D; \u201Cfix(ocr): stop building a table from a cover page or a map (#2431)\u201D; \u201Cfix(ort): share one ONNX Runtime environment across core, Paddle and GLiNER\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/paddle_ocr/backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/backend.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dba40a03193fbf466913bac9f2cd770107a4533dd94ebfe6447e24efa7c039"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/security.rs: crates/xberg/src/extractors/security.rs changed 28 times in last 90 days and 19 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is ZipBombValidator::validate at line 367), 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(ocr): address retained image-read review findings\u201D; \u201Cfix(excel): extract the sheets that fit when a workbook exceeds the cell limit (#2820) (#2822)\u201D; \u201Cfix(redaction): preserve the findings safety ceiling\u201D; \u201Cfix(redaction): reuse the iteration security limit\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/security.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/security.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb726c554764975dfa5ba637abd27c639e55aa95751656413e7b29d9db3f7679"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/layout_runner.rs: crates/xberg/src/extractors/pdf/layout_runner.rs changed 23 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is xberg::extractors::pdf::layout_runner::run_layout_for_pdf_pages_with_security_limits_and_pages at line 944), 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(pdf): place layout OCR tables in the verified page frame\u201D; \u201Cfix(engine): keep subscriber and test scopes across the stack hop\u201D; \u201Cfix(pdf): fit layout rasters within the memory budget\u201D; \u201Cfix(ocr): retain raster DPI through prepared layout reads\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/layout_runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/layout_runner.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"6376596d68f0d3e0e83144b2c5212e5ad790ae5a1c7ecdb9a7e00e5f0cc4ca2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/rendering/common.rs: crates/xberg/src/rendering/common.rs changed 21 times in last 90 days and 18 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 xberg::rendering::common::build_footnote_ref_to_def_anchor at line 411), 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(redaction): verify math in binary output\u201D; \u201Cfix(markdown): close math that ends in a backslash, pin its clauses\u201D; \u201Cfix(doc): paint upper-letter levels, keep djot lists ordered\u201D; \u201Cfix(markdown): keep a TeX dollar escaped, unescape writer output only\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/common.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9096a97434099e5bd25a3d94a3e7d46057fe50e4fcd5fc5bffa62362f5e0af8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/doc/mod.rs: crates/xberg/src/extraction/doc/mod.rs changed 22 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is ParagraphOutput::consume at line 561), 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(doc): count every numbered .doc paragraph for restarts\u201D; \u201Cfix(doc): continue legacy .doc numbering across headings\u201D; \u201Cfix(doc): apply compact piece script properties per character\u201D; \u201Cfix(doc): preserve script annotations in subdocuments\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/doc/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/mod.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f95add95564eff6e2f285e0854cc690cabe6df6f86439923cbcbc039715b76"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/native/hierarchy.rs: crates/xberg/src/pdf/native/hierarchy.rs changed 21 times in last 90 days and 16 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 xberg::pdf::native::hierarchy::inline_script_insertion at line 726), 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(pdf): preserve source-backed inline calligraphic math\u201D; \u201Cfix(pdf): keep raised marks inside their line and sentence (#2655)\u201D; \u201Cfix(pdf): preserve glyphs and native text through OCR recovery (#2517)\u201D; \u201Cfix(pdf): keep literal primes beside their operands (#2453)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/native/hierarchy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9a2c04fec85e4a2fc10a88b905f88cf11ccd129170ccc9ff88782f3b592ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/unreadable_script.rs: crates/xberg/src/extractors/pdf/unreadable_script.rs changed 20 times in last 90 days and 16 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 xberg::extractors::pdf::unreadable_script::retain_unreadable_script_pages at line 693), 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(ocr): recover Khmer and Han without duplicating text\u201D; \u201Cfix(pdf): keep a script layer drawn over a full-page picture (#3016)\u201D; \u201Cfix(pdf): keep readable native text when a page has lost-glyph markers (#2637)\u201D; \u201Cfix(pdf): keep a correctly mapped script minority out of the ink probe\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/unreadable_script.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/unreadable_script.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7e76c9b9a63892ee6477fe317dc5c970c46130d72ed55c97fcf7228595b4c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/rendering/plain.rs: crates/xberg/src/rendering/plain.rs changed 20 times in last 90 days and 15 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 xberg::rendering::plain::render_body_plain at line 89), 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(rendering): end the Plain body at the end of the trimmed text\u201D; \u201Cfix(rendering): give the last writer of a Plain span its index type\u201D; \u201Cfix(pages): take Plain page text and ranges from the one Plain render\u201D; \u201Cfix(pages): give a prebuilt DOCX or PPTX page its part of the Plain content\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/plain.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/plain.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"caab1eb764e400a5ff1e30eb1674f7f920031b54b5354475b81a775ffa340e86"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/decoders/jpx.rs: crates/xberg-native-pdf/src/decoders/jpx.rs changed 20 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg_native_pdf::decoders::jpx::decode_subsampled at line 374), 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: \u201Cchore: integrate fixes and dependency upgrades for 1.3.11\u201D; \u201Cfix(pdf): bump hayro-jpeg2000 to 0.4.1 and drop its palette workaround (#2111)\u201D; \u201Cfix(pdf): reject conflicting JPX palettes\u201D; \u201Cfix(pdf): preserve JPEG 2000 opacity semantics\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/decoders/jpx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/jpx.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"592a074312370392a3c720a3265d6f8587dae35467b65a510e6478f8615858bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs: crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs changed 19 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is TextExtractor::flush_buffer_at_tj_word_boundary at line 495), 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(pdf): preserve source-backed inline calligraphic math\u201D; \u201Cfix(pdf): preserve wide tracking boundaries inside TJ strings\u201D; \u201Cfix(pdf): keep a script layer drawn over a full-page picture (#3016)\u201D; \u201Cfix(pdf): align Primary lead width with adaptive classification (#2848)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4921a6dd62b1adb0cd66830840648548ecffdbb6e788dea017d9aa072c903f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/scoring.rs: crates/xberg/src/extractors/pdf/ocr/scoring.rs changed 18 times in last 90 days and 15 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 xberg::extractors::pdf::ocr::scoring::evaluate_per_page_ocr at line 1321), 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(pdf): retry sparse OCR rejected by page quality\u201D; \u201Cfix(pdf): keep readable native text when a page has lost-glyph markers (#2637)\u201D; \u201Cfix(ocr): address retained image-read review findings\u201D; \u201Cfix(ocr): isolate discarded PDF image reads\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/scoring.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a9d2a71f067f006c842e63f940fb33ca1f5966a6350100e934c708bfb4c159"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/model_context.rs: crates/xberg/src/ocr/processor/model_context.rs changed 15 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is ModelContext::capture_primary at line 107), 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(ocr): track model revisions across extraction caches\u201D; \u201Cfix(ocr): revalidate vertical and horizontal retries independently\u201D; \u201Cfix(ocr): preserve Han retry on vertical model read failure\u201D; \u201Cfix(ocr): retry noisy vertical Japanese images\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/model_context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/model_context.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86e5a672b40d1cf8f47bc48120fa6dabec94401d111c03207b6af06610986e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/native/hierarchy/script_evidence.rs: crates/xberg/src/pdf/native/hierarchy/script_evidence.rs changed 14 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is xberg::pdf::native::hierarchy::script_evidence::has_adjacent_numeric_source at line 290), 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(pdf): require expression context for indented exponents\u201D; \u201Cfix(pdf): attach indented Gutenberg exponents\u201D; \u201Cfix(pdf): rejoin superscripts across empty text-run gaps\u201D; \u201Cfix(pdf): preserve source-backed inline calligraphic math\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/native/hierarchy/script_evidence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/hierarchy/script_evidence.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a412007a82fdf0a6bce7c78f9592e31aa2195a57cf11c87f81a7cccf479de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/number_recovery.rs: crates/xberg/src/extractors/pdf/ocr/number_recovery.rs changed 14 times in last 90 days and 14 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 xberg::extractors::pdf::ocr::number_recovery::verify_page at line 296), 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(pdf): recover verified Khmer numbers on mixed OCR pages\u201D; \u201Cfix(pdf): settle cold ambiguous font declines\u201D; \u201Cfix(pdf): settle measured number recovery declines\u201D; \u201Cfix(pdf): share numeric proof budget across eligible pages\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/number_recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/number_recovery.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9d9fcfcf5f06c362fbca3ac4e35f09dfed9393add2f494215112759e33c132"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/engine/extract_impl.rs: crates/xberg/src/engine/extract_impl.rs changed 23 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is xberg::engine::extract_impl::run_shared_url_group at line 984), 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(ocr): track model revisions across extraction caches\u201D; \u201Cfix(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(engine): version injected extraction cache keys\u201D; \u201Cfix(ocr): recover explicit sideways PDF table scans (#2529)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/engine/extract_impl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85feaefbfefe1b6e5bda425b89f99ba96ac6388539b56ac3ecc478193955036"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs: crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs changed 16 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is OrientationRetry::after_recognition at line 314), 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(ocr): recover sideways prose on mixed PDF scan pages\u201D; \u201Ctest(pdf): pin the guards of the detached table frame fix\u201D; \u201Cfix(ocr): read a mixed document\u0027s sideways prose scan page alike in every build\u201D; \u201Cfix(pdf): tighten the detached table frame fallback\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7db6823ba77ec5fe57175a6859e1f70810f65ff941f74e6070a1c5ab70138c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/script_stack.rs: crates/xberg-native-pdf/src/extractors/text/script_stack.rs changed 16 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is xberg_native_pdf::extractors::text::script_stack::script_stack at line 107), 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(pdf): preserve parent-relative scripts in equations\u201D; \u201Cfix(pdf): restore nested script markup in textbook text\u201D; \u201Ctest(pdf): pin the group order of a script stack and fix its changelog\u201D; \u201Cfix(pdf): read a script stack with no script of a script by side\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/script_stack.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/script_stack.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1918ff1959aa63c2367ad66d50f0b8300d8713ba8781e4914585c324f5b09789"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/doc.rs: crates/xberg/src/extractors/doc.rs changed 16 times in last 90 days and 13 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 DocExtractor::extract_content at line 73), 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(doc): count every numbered .doc paragraph for restarts\u201D; \u201Cfix(doc): continue legacy .doc numbering across headings\u201D; \u201Cfix(doc): preserve script annotations in subdocuments\u201D; \u201Cfix(doc): preserve script annotations in table cells\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/doc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/doc.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fd31aefeccef2528c4f11cd2fb7545417db7e16dcb588fdac4cf706aed85e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-tesseract/src/api.rs: crates/xberg-tesseract/src/api.rs changed 14 times in last 90 days and 13 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 TesseractAPI::get_textlines at line 1676), 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(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(ocr): make parking an engine for exit cleanup an unsafe call\u201D; \u201Cfix(ocr): guard the exit cleanup against a reused engine address\u201D; \u201Cfix(ocr): skip engines in use in the Tesseract exit cleanup\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-tesseract/src/api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"c570954076364e40fd52993a87774364ad8959bf83f53c0bb730f912270e1da2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/scan_detect.rs: crates/xberg/src/pdf/scan_detect.rs changed 21 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is xberg::pdf::scan_detect::score_page at line 135), 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(pdf): keep a script layer drawn over a full-page picture (#3016)\u201D; \u201Cfix(pdf): fit OCR DPI to native raster allocation budget\u201D; \u201Cfix(ocr): keep the scan segmentation mode on scans with unmapped text (#1947)\u201D; \u201Cfix(ocr): count mapped artifact glyphs in scan guard\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/scan_detect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/scan_detect.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4701386e9e6b17f418c830d30ed5d923d17ea6a5a4c4eb447e5260ca9e8cecf0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs: crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs changed 13 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is xberg::extractors::pdf::ocr::native_word_coverage::covers_complete_native_page at line 17), 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(pdf): keep readable native text when a page has lost-glyph markers (#2637)\u201D; \u201Cfix(pdf): keep Type0 native text under noisy renders (#2937)\u201D; \u201Cfix(ocr): keep decodable layer tokens that a whole-page OCR read lost\u201D; \u201Cfix(ocr): keep the non-ocr yield fallback inside the pdf gate\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/native_word_coverage.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94408f37d29d08e44e3aa5348fb9f361e064b36e4905988b4823cf140e003e72"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/mod.rs: crates/xberg/src/ocr/processor/mod.rs changed 13 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is ImageOcrPolicy::requires_provisioned_models at line 65), 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(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(ocr): corroborate recovered Khmer numbers against glyph ink\u201D; \u201Cfix(pdf): recover proven right-column text on tall scans (#2601)\u201D; \u201Cfix(ocr): recover certified standalone sparse table rows (#2590)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1a2e15f2d330ed308cddb8034056f201b62120b9028dce762aeab24dc3a201"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/rendering/knockout.rs: crates/xberg-native-pdf/src/rendering/knockout.rs changed 13 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is PageRenderer::painting_text_shows at line 515), 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(pdf): fit raster retries to live render workspace\u201D; \u201Cfix(pdf): budget groups in inherited resource scopes\u201D; \u201Cfix(pdf): build knockout floor paths with the real path builder\u201D; \u201Cfix(pdf): budget groups reachable through soft masks\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/knockout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/knockout.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17a14b6792c95d962e0037628e77331bbe47cf672297088b6d0c47325261589"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/types.rs: crates/xberg/src/ocr/types.rs changed 13 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is TesseractConfig::validate at line 297), 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(ocr): fit raw mixed PDF scans to workspace (#2572)\u201D; \u201Cfix(ocr): recover oversized JPEG scans within image budgets\u201D; \u201Cfix(ocr): route the scan-detection signal into OCR preprocessing\u201D; \u201Cfix(pdf): refuse a decompression limit of 0 instead of disabling the cap\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/types.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c01395bdb557183061419333fbc90fb9784acfec53e30fbb2ab241f18b884d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/setup.rs: crates/xberg-native-pdf/src/extractors/text/setup.rs changed 12 times in last 90 days and 12 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is TextExtractor::set_page_index at line 110), 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(ocr): raise default density for proven small painted text\u201D; \u201Cfix(pdf): preserve source-backed inline calligraphic math\u201D; \u201Cfix(pdf): preserve source ownership of raised text\u201D; \u201Cfix(pdf): preserve script adjacency across text runs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/setup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/setup.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb96f08dc6784dfab3d67b703f0a1f2b412e41c199d31e1b3a8f5928b62d9c5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/doc/piece_table.rs: crates/xberg/src/extraction/doc/piece_table.rs changed 12 times in last 90 days and 12 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 xberg::extraction::doc::piece_table::collect_story_subdocuments at line 698), 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(doc): resolve bounded complex piece character properties\u201D; \u201Cfix(doc): apply compact piece script properties per character\u201D; \u201Cfix(doc): preserve script annotations in subdocuments\u201D; \u201Cfix(doc): retain direct scripts and UTF-16 story boundaries\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/doc/piece_table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/piece_table.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ebb6db74e2ea287e0c4587f0c4246bd987d6a82ed24925715ccf6a57a945eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/native/images.rs: crates/xberg/src/pdf/native/images.rs changed 19 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is xberg::pdf::native::images::page_ocr_fallback_image_bytes at line 355), 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(ocr): prove no source DPI on pages with a UserUnit\u201D; \u201Cfix(ocr): gate the placeholder fallback image on the test module\u0027s feature\u201D; \u201Cfix(ocr): share stored JPEGs within the PDF recovery cap (#2477)\u201D; \u201Cfix(ocr): skip automatic PaddleOCR on blank PDF rasters (#2471)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/native/images.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/images.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"179319044dd9a7f2dc29e12514c5343fd72d74c30dd8cd393d1851f24ddfd742"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/formats.rs: crates/xberg/src/types/formats.rs changed 17 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::types::formats::deserialize_languages at line 13), 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(pdf): honor configured OCR density across PDF routes (#2829)\u201D; \u201Cfix(ocr): fit raw mixed PDF scans to workspace (#2572)\u201D; \u201Cfix(schema): omit null for optional OCR and keyword refs (#2042)\u201D; \u201Cfix(ocr): report a shaded-row normalization that cannot act\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/formats.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/formats.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaffa54485be2b06c125c9a1b26e717e241d5dafed0fc905c48c94fcc07378b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/candle_ocr/glm_ocr_backend.rs: crates/xberg/src/candle_ocr/glm_ocr_backend.rs changed 16 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is GlmOcrBackend::parse_options at line 433), 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(ocr): validate backend options before any page runs\u201D; \u201Cfix(ocr): resolve the layout model once per process, not once per page (#1720)\u201D; \u201Cfix(ocr): drop implausible-script and bare-LaTeX lines from candle OCR\u201D; \u201Cfix(candle-ocr): stop GLM-OCR penalising repeats per occurrence\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/candle_ocr/glm_ocr_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/glm_ocr_backend.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6748aab9280e992f44e7f278de58d943f7d9fcec17a0067200db2b139ff64a48"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/rendering/mod.rs: crates/xberg-native-pdf/src/rendering/mod.rs changed 13 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is xberg_native_pdf::rendering::pdf_blend_mode_to_skia at line 91), 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(ocr): prove inline Khmer recovery and annotation isolation\u201D; \u201Cfix(ocr): verify Khmer recovery placement and paint\u201D; \u201Cfix(pdf): keep a script layer drawn over a full-page picture (#3016)\u201D; \u201Cfix(pdf): keep the native page when OCR only re-reads its ink (#2633)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"315337987a59e4815f5bea6f3a6982a549efccc6c66d50c0fd760a53394ce1e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/image_decode.rs: crates/xberg/src/extraction/image_decode.rs changed 12 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::extraction::image_decode::standard_image_is_single_frame at line 468), 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(ocr): confirm proven DPI through the budgeted image probe\u201D; \u201Cfix(ocr): gate two image helpers on the pdf feature like their callers\u201D; \u201Cfix(image): compare the decode budget against bytes only\u201D; \u201Cfix(image): gate decode helpers on their callers\u0027 features\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/image_decode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_decode.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b2953603088de608490bbd114bc93c1a9f6709dbefa9ddc1a3146020f87803"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/layout/engine.rs: crates/xberg/src/layout/engine.rs changed 15 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is xberg::layout::engine::model_from_custom_variant at line 465), 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(pdf): recognise formulas on pages the mixed OCR route reads (#2280)\u201D; \u201Cfix(pdf): replace native table text with VLM table answers, warn on table model load failures (#2242)\u201D; \u201Cfix(pdf): five fixes to layout, formula and VLM region handling in native PDF extraction (#2232)\u201D; \u201Cfix(layout): restore the wasm32 gate on the custom-model dispatch (#1862)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/layout/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/engine.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"6676b520ad04654e94884e0927b3a899b089e2fa3e998394bece565b6a1318fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/table/tsv_parser.rs: crates/xberg/src/ocr/table/tsv_parser.rs changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::ocr::table::tsv_parser::words_on_lines at line 26), 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(ocr): preserve certified source scan table rows (#2571)\u201D; \u201Cfix(ocr): recover native counterclockwise table rows (#2542)\u201D; \u201Cfix(ocr): reject columned prose tables\u201D; \u201Cfix(tables): fold a right-aligned value column split by digit drift\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/table/tsv_parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/table/tsv_parser.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff26a8746864c2b34a0255de6fdb7938778ba74b10ebf4394122569945f214dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/api_pool.rs: crates/xberg/src/ocr/processor/api_pool.rs changed 13 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ResourcePool::checkout at line 76), 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(ocr): key OSD reads by primary model bytes\u201D; \u201Cfix(ocr): validate model bytes at request boundaries\u201D; \u201Cfix(ocr): gate Han retries and retain idle engines\u201D; \u201Cfix(ocr): read a noisy Han page again with chi_sim, no download (#2818)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/api_pool.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/api_pool.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"508e1a4d5b7855e2e0262fccbd3978aa23ba8b640deed4d0e205ca0e0ba93aff"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/decoders/mod.rs: crates/xberg-native-pdf/src/decoders/mod.rs changed 12 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is xberg_native_pdf::decoders::decode_stream_with_options_and_expected_size at line 279), 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(pdf): preserve packed RGB through image predictors\u201D; \u201Cfix(pdf): recover text behind partial CCITT hidden layers (#2606)\u201D; \u201Cfix(native-pdf): bound RunLength/LZW decode output mid-decode\u201D; \u201Cfix(native-pdf): route ParserOptions size cap through one source\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/decoders/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/mod.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f479094904555fba49c0a0c9884768da82f636623e2b55da175e231f6364d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/cancellation.rs: crates/xberg/src/cancellation.rs changed 12 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is CancellationToken::time_limit_reached at line 187), 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(extract): scope the time-limit stage checks and document the cut result\u201D; \u201Cfix(extract): make the time limit bound post-processing stages\u201D; \u201Crevert: drop the pdf gating that main already carries (a98ce8dfd9)\u201D; \u201Cfix(extract): build the page-loop marks and the 2958 test only with pdf\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/cancellation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/cancellation.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d034edb6881d28aac774339bda73f0e7e6a061fb82d47f4f4c028ffb6c522f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/rendering/markdown.rs: crates/xberg/src/rendering/markdown.rs changed 12 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::rendering::markdown::unescape_backslash_sequences at line 20), 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(ocr): keep adopted leader rows on separate lines in Markdown (#2773)\u201D; \u201Cfix(pdf): one arXiv stamp rule, so citations and body words stay\u201D; \u201Cfix(redaction): distinguish generated Markdown tags (#2459)\u201D; \u201Cfix(markdown): preserve source clause structure (#2410)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/markdown.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/markdown.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dff4f4285d32b4ce2b4f7f2b71f6660994c002d8f6a4dfbab04cc89ec52254"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/script_retry.rs: crates/xberg/src/ocr/processor/script_retry.rs changed 11 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is xberg::ocr::processor::script_retry::matched_primary_occurrences at line 1166), 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(ocr): track model revisions across extraction caches\u201D; \u201Cfix(ocr): revalidate vertical and horizontal retries independently\u201D; \u201Cfix(ocr): preserve Han retry on vertical model read failure\u201D; \u201Cfix(ocr): retry noisy vertical Japanese images\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/script_retry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/script_retry.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c606315b7bae18623a246a0e1f7a9ab75b5818ed167e6331270d648230d6ea5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/span_ordering.rs: crates/xberg-native-pdf/src/extractors/text/span_ordering.rs changed 11 times in last 90 days and 9 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 TextExtractor::detect_span_columns at line 240), 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(pdf): preserve script adjacency across text runs\u201D; \u201Cfix(pdf): order only real raised marks on their base line (#2659)\u201D; \u201Cfix(pdf): snap raised glyph clusters whole and skip list markers\u201D; \u201Cfix(pdf): recover the letters of a ligature glyph that has no ToUnicode entry (#2680)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/span_ordering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/span_ordering.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba38a02241e95030638755f3d76ba08364f4e92bdd02991e7865096be91c23c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/excel.rs: crates/xberg/src/extraction/excel.rs changed 11 times in last 90 days and 9 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 xberg::extraction::excel::generate_markdown_and_cells at line 660), 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(excel): extract the sheets that fit when a workbook exceeds the cell limit (#2820) (#2822)\u201D; \u201Cfix(excel): enforce workbook text limits for every input\u201D; \u201Cfix(excel): register the preflight budget module\u201D; \u201Cfix(excel): remove binary noise from float cells\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/excel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b62178c0f9e360feec023a62cccf9599c3f3720180bd1bd6d834fd3f11c841"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/derive/surfaces/capture.rs: crates/xberg/src/extraction/derive/surfaces/capture.rs changed 9 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is xberg::extraction::derive::surfaces::capture::html_heading_sources at line 541), 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(markdown): preserve redaction in rendered math\u201D; \u201Cfix(markdown): close math that ends in a backslash, pin its clauses\u201D; \u201Cfix(redaction): verify HTML headings before choosing output\u201D; \u201Cfix(redaction): prove styled heading and PDF text coverage\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/derive/surfaces/capture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/surfaces/capture.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"2916a69d5d2a50a366433adbfd82dd9b15099c6c056ece3270b7893675fa6d5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/config_validation/sections.rs: crates/xberg/src/core/config_validation/sections.rs changed 9 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is xberg::core::config_validation::sections::validate_language_code at line 413), 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(ocr): send tesseract thresholding_method as an integer, not a bool\u201D; \u201Cfix(ocr): accept every Tesseract language code in config validation\u201D; \u201Cfix(ocr): reject tesseract psm 0, which recognises no text\u201D; \u201Cfix(ocr): accept plugin-registered OCR backends during validation\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config_validation/sections.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config_validation/sections.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dc40126132fb95ecdba6ccbbf95468bcc9aef58f7f7de7530ad6bad5d230bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/internal_builder.rs: crates/xberg/src/types/internal_builder.rs changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is InternalDocumentBuilder::push_table_from_cells_with_styles at line 192), 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(docx): preserve math in table cells without API changes\u201D; \u201Cfix(rendering): keep every footnote definition on the footnote layer\u201D; \u201Cfix(ocr): preserve image list source numbers (#1984)\u201D; \u201Cfix(pdf): report measured font size in page hierarchy blocks\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/internal_builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/internal_builder.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c878f2de6b27e745c942bb00437a326b929c29f2b46968bf9e61a466354f422b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs: crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs changed 12 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::candle_ocr::deepseek_ocr_backend::requested_dtype at line 45), 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(ocr): validate backend options before any page runs\u201D; \u201Cfix(ocr): report when auto device selection falls back to the CPU (#1722)\u201D; \u201Cfix(ocr): drop implausible-script and bare-LaTeX lines from candle OCR\u201D; \u201Cfix(candle-ocr): pick the DeepSeek-OCR dtype from the device\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/deepseek_ocr_backend.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01eddf3aa8e732fd7f4c1b874592aed29c6e34e0349fe1a7e32025b2b247b74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/document/open.rs: crates/xberg-native-pdf/src/document/open.rs changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is PdfDocument::ensure_encryption_initialized at line 360), 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(ocr): raise default density for proven small painted text\u201D; \u201Cfix(pdf): preserve packed RGB through image predictors\u201D; \u201Cfix(pdf): retry graphics states recovered during Form visits (#2761)\u201D; \u201Cfix(pdf): bind named font cache payload to identity\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/open.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/open.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84403e435b50632750ec4cdbaa85b89a92fa870afc8ab983c8332d6c74f79c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/execution/encoded_image.rs: crates/xberg/src/ocr/processor/execution/encoded_image.rs changed 11 times in last 90 days and 8 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 Preparation::prepare_candidate at line 206), 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(ocr): run gray contrast preprocessing on the 8-bit raster and free the RGB (#2701)\u201D; \u201Cfix(ocr): fit engine-selected PNG upscale to the image workspace\u201D; \u201Cfix(ocr): downscale oversized PNG and TIFF with caller options\u201D; \u201Cfix(ocr): bound inferred-DPI standalone sparse retries (#2575)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/execution/encoded_image.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/encoded_image.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c6b91f5fd25ebc1dd3f8e6f1a7a1d58a1abd0113c58e33340c2142c9e97f34"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/html/structure.rs: crates/xberg/src/extraction/html/structure.rs changed 11 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is HtmlWalker::pop_inline at line 385), 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(email): preserve message text and recover malformed base64\u201D; \u201Cfix(email): leave the head, style sheets and scripts of an HTML body out of the message text (#2222)\u201D; \u201Cfix(extraction): repair per-page lists, figure alt text, VLM probe and rotated stamps\u201D; \u201Cfix(epub): stop dropping chapters, metadata and whole books (#1502)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/html/structure.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/structure.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b67d33975418ba695358a4389bbd25629401013ad7b3144b9784ebf6d827bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/plugins/registry/ocr.rs: crates/xberg/src/plugins/registry/ocr.rs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is OcrBackendRegistry::register_default_engine_backends at line 127), 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(ci): scope OCR helpers to their enabled features (#2595)\u201D; \u201Cfix(ocr): bound inferred-DPI standalone sparse retries (#2575)\u201D; \u201Cfix(ocr): preserve standalone image table rows in page output (#2473)\u201D; \u201Cfix(ocr): skip automatic PaddleOCR on blank PDF rasters (#2471)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/plugins/registry/ocr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/ocr.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1a7e41ab0ef7a5546e9e6db4f731aadd9c5fdc15917f755da91ebb82687fef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/image/dpi.rs: crates/xberg/src/image/dpi.rs changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::image::dpi::calculate_dimension_constrained_dpi at line 56), 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(ocr): raise default density for proven small painted text\u201D; \u201Cfix(pdf): honor configured OCR density across PDF routes (#2829)\u201D; \u201Cfix(pdf): fit OCR DPI to native raster allocation budget\u201D; \u201Cfix(ocr): match DPI cap to renderer dimensions\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/image/dpi.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/image/dpi.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c037b9d3c28ff9b27c70680fec8510c2f0fc85f0c1f3eadf13cec431a1a3940"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/symbol_noise_lines.rs: crates/xberg/src/extractors/pdf/ocr/symbol_noise_lines.rs changed 9 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::extractors::pdf::ocr::symbol_noise_lines::is_plausible_text at line 163), 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(pdf): prune repeated background OCR artifacts\u201D; \u201Cfix(ocr): keep meaningful words beside symbol noise (#2974)\u201D; \u201Cfix(ocr): prune symbol-noise lines on the direct PDF read of a flagged page\u201D; \u201Cfix(ocr): keep real digit lines that carry a quote or section mark\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/symbol_noise_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":"crates/xberg/src/extractors/pdf/ocr/symbol_noise_lines.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9620b5c38aa3528f1eb7fd1e2f65edf6a743949bfc025560b1d7edd763dcc6c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/extraction.rs: crates/xberg/src/types/extraction.rs changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ExtractionMethod::from_metadata_value at line 43), 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(ocr): require background agreement for texture pruning\u201D; \u201Cfix(ocr): fit raw mixed PDF scans to workspace (#2572)\u201D; \u201Cfix(ocr): record failed pages of a failed whole-document run (#2095)\u201D; \u201Cfix(ocr): recover RTL identifiers and report page failures\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/extraction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/extraction.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1971426489bec0908b1d92f87abd710c74b544badaed4d0387ab27c3059485"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/fonts/truetype_cmap.rs: crates/xberg-native-pdf/src/fonts/truetype_cmap.rs changed 10 times in last 90 days and 7 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 TrueTypeCMap::build_symbol_code_to_gid at line 147), 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(pdf): use integer parity checks in format 4 cmap\u201D; \u201Cfix(pdf): bound TrueType format 4 cmap parsing\u201D; \u201Cfix(pdf): let the cmap budget admit fonts that alias code points\u201D; \u201Cfix(pdf): drop the leftover distinct-gid cap block from the reviewed head\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/fonts/truetype_cmap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/truetype_cmap.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a667b756714b44359b0df4f463221f1522738ddde387c46ccdf73af631802014"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/fonts/unicode_decode.rs: crates/xberg-native-pdf/src/fonts/unicode_decode.rs changed 9 times in last 90 days and 7 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 xberg_native_pdf::fonts::unicode_decode::fallback_currency_symbol at line 285), 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(pdf): honor WinAnsi encoding when rendering glyphs\u201D; \u201Cfix(pdf): keep readable native text when a page has lost-glyph markers (#2637)\u201D; \u201Cfix(pdf): cache Type 3 provenance during text extraction\u201D; \u201Cfix(pdf): update HarfRust and preserve wide glyph IDs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/fonts/unicode_decode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/unicode_decode.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b54bae6752c6b26f9b4c3572db9db9a755b0416c194a2f6efacf7c710f4086"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/rendering/docx.rs: crates/xberg/src/rendering/docx.rs changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is BodyWriter::open_paragraph at line 326), 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(markdown): close math that ends in a backslash, pin its clauses\u201D; \u201Cfix(markdown): keep a TeX dollar escaped, unescape writer output only\u201D; \u201Cfix(markdown): keep TeX in dollar math when a reader applies escapes\u201D; \u201Cfix(markdown): write math as dollar math, not code math (#2781)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/docx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/docx.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb7187284c52375d503eb60c51dbe20a7d48b5bc6dbcc815a95023b1eb18c0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/builder.rs: crates/xberg/src/types/builder.rs changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is DocumentStructureBuilder::push_heading at line 90), 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(office): preserve equations and surrounding text\u201D; \u201Cfix(build): align XML and HWPX helper feature gates\u201D; \u201Cfix(email): check standalone feature test targets\u201D; \u201Cfix(build): pass clippy with the xml or hwpx feature on alone (#2272)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/builder.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"458583952ecbe4aa8c92576f471c126bbf5f8c07b699975099f12994ad68691d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/image_photo_title.rs: crates/xberg/src/extractors/image_photo_title.rs changed 8 times in last 90 days and 7 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 xberg::extractors::image_photo_title::place at line 668), 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(ocr): tighten the symbol-noise keep rules and score stages unpruned (#2312)\u201D; \u201Cfix(ocr): gate symbol-noise pruning behind a flag and make it script-aware (#2312)\u201D; \u201Cfix(ocr): drop symbol-noise lines OCR reads from a photograph (#2312)\u201D; \u201Cfix(ocr): suppress a certified duplicate photo title glyph\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/image_photo_title.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image_photo_title.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24447fe6fdcc6794ce94927911b422453b4cd39f17e4298cfd3cd47d0d92c86"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/rendering/knockout_resources.rs: crates/xberg-native-pdf/src/rendering/knockout_resources.rs changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is KnockoutResources::knockout at line 186), 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(pdf): share the paint cap across DPI retries\u201D; \u201Cfix(pdf): fit raster retries to live render workspace\u201D; \u201Cfix(pdf): size the group fit charge from the knockout reservations\u201D; \u201Cfix(pdf): decide a knockout page\u0027s work fallback before the pass\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/knockout_resources.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/knockout_resources.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ca6d2b9847b4f7e48aabc2a2248963d706110541c014733fe9876fc907d3d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/derive/surfaces.rs: crates/xberg/src/extraction/derive/surfaces.rs changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::extraction::derive::surfaces::derive_djot at line 92), 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(markdown): preserve redaction in rendered math\u201D; \u201Cfix(markdown): close math that ends in a backslash, pin its clauses\u201D; \u201Cfix(redaction): verify HTML headings before choosing output\u201D; \u201Cfix(redaction): prove styled heading and PDF text coverage\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/derive/surfaces.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/surfaces.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db6650b3b3ca1adfe3f67d4f2f46c951867d526b46b258a107268a32d45a144"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/ocr_elements.rs: crates/xberg/src/types/ocr_elements.rs changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is OcrElementConfig::select_elements at line 454), 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(tables): retain OCR headers and cell geometry through output\u201D; \u201Cfix(wasm): return OCR word elements (#1986)\u201D; \u201Cfix(ocr): return Tesseract line elements at the default element level (#1981)\u201D; \u201Cfix(api): drop the null union from omitted optional references\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/ocr_elements.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/ocr_elements.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d3d80a574faa938a391ede2e1904e2a34fcd824fc7d3deefa8bef463b1d0bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/doc/papx.rs: crates/xberg/src/extraction/doc/papx.rs changed 10 times in last 90 days and 6 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 ParagraphListIndex::absorb_fkp_page at line 355), 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(doc): count every numbered .doc paragraph for restarts\u201D; \u201Cfix(doc): continue legacy .doc numbering across headings\u201D; \u201Cfix(doc): retain direct scripts and UTF-16 story boundaries\u201D; \u201Cfix(doc): enforce cell budgets before assembling tables\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/doc/papx.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/papx.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"791766d7b4e9fb510f6235cbec83274a32b1ed3fd6f4b77555f879cd80853901"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs: crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is PaddleOcrVlBackend::parse_options at line 189), 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(ocr): validate backend options before any page runs\u201D; \u201Cfix(ocr): drop implausible-script and bare-LaTeX lines from candle OCR\u201D; \u201Cfix(ocr): stop candle engine pools from building duplicate GPU engines\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/paddleocr_vl_backend.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0826ee7712501e4d811af552805edec66d479959c9820a8cc36f4e270355482"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/native/metadata.rs: crates/xberg/src/pdf/native/metadata.rs changed 9 times in last 90 days and 6 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 xberg::pdf::native::metadata::decode_pdf_string at line 319), 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(extract): keep a native PDF\u0027s pages when the time limit stops it\u201D; \u201Cchore: integrate fixes and dependency upgrades for 1.3.11\u201D; \u201Cfix(pdf): carry fabricated-mapping counts from text pass to provenance\u201D; \u201Cfix(pdf): route a text layer that decodes to the wrong letters to OCR\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/native/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/metadata.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d27f657ece7d7ca2598e8a1d24707a05d01dd996abc2904c60d99ac153f29e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/paths.rs: crates/xberg-native-pdf/src/extractors/paths.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is PathExtractor::resolve_xobject_ref at line 467), 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(pdf): retry graphics states recovered during Form visits (#2761)\u201D; \u201Cfix(pdf): resolve an indirect ExtGState container once per resource scope (#2752)\u201D; \u201Cfix(pdf): honor graphics state in header rule evidence (#2703)\u201D; \u201Cfix(pdf): preserve source-proven grouped leaf headers (#2625)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/paths.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/paths.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4462817ae60845250c1a2eb72805e1b13552425a121469f5514446d1f5ec0a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/candle_ocr/trocr_backend.rs: crates/xberg/src/candle_ocr/trocr_backend.rs changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is TrocrBackend::parse_options at line 195), 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(ocr): validate backend options before any page runs\u201D; \u201Cfix(ocr): drop implausible-script and bare-LaTeX lines from candle OCR\u201D; \u201Cfix(ocr): stop candle engine pools from building duplicate GPU engines\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/candle_ocr/trocr_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/trocr_backend.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4a4ba9b410cb01075abfdf498627fe0cba011310b908455b30a422b895eb46"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/extractor/bytes.rs: crates/xberg/src/core/extractor/bytes.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::core::extractor::bytes::run_byte_extraction at line 209), 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(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(extract): make the time limit bound post-processing stages\u201D; \u201Cfix(pdf): keep finished pages when the extraction timeout stops a PDF\u201D; \u201Cfix(extract): return the pages already read when a PDF extraction hits the time limit\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/extractor/bytes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/bytes.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6d5546ce2af586e5fdbbfac4139ad0cd2cd9f0c664d5247158616af952ca0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/ppt.rs: crates/xberg/src/extractors/ppt.rs changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is PptExtractor::extract_embedded_objects at line 169), 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(ppt): reference speaker notes from their slides\u201D; \u201Cfix(ppt): extract a legacy slide\u0027s table as a table (#2114)\u201D; \u201Cfix(ppt): extract a legacy deck\u0027s embedded OLE objects\u201D; \u201Cfix(ppt): key speaker notes to slideIdRef, skip the notes master\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/ppt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/ppt.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0aba9c01557201c44cc681304b6570b4f97e91155766f04f76c3435777bd6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/extractor/cacheability.rs: crates/xberg/src/core/extractor/cacheability.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::core::extractor::cacheability::with_ocr_cancellation at line 152), 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(ocr): track model revisions across extraction caches\u201D; \u201Cfix(ocr): validate model bytes at request boundaries\u201D; \u201Cfix(ocr): preserve Han marks and verify retry model loads\u201D; \u201Cfix(ocr): read a noisy Han page again with chi_sim, no download (#2818)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/extractor/cacheability.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/cacheability.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fdc9c2116b57f62adc803d5aed91e8c0dedb7ffeb0b5d7b0c3151333945eef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/excel/open.rs: crates/xberg/src/extraction/excel/open.rs changed 7 times in last 90 days and 6 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 xberg::extraction::excel::open::read_excel_file at line 416), 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(excel): extract the sheets that fit when a workbook exceeds the cell limit (#2820) (#2822)\u201D; \u201Cfix(excel): enforce workbook budgets before backend allocation\u201D; \u201Cfix(excel): reject ZIP spreadsheets with inconsistent headers or overlapping entries\u201D; \u201Cfix: resolve extraction regressions for 1.3.8\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/excel/open.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/open.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c566897f64546df61c4997e3db3fb9d169d609f2675b5bc87028cd81dc9cb447"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/run.rs: crates/xberg-native-pdf/src/extractors/text/run.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is TextExtractor::resolve_span_font_provenance at line 148), 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(pdf): keep a word whole when a large TJ offset follows a text matrix (#2679)\u201D; \u201Cfix(pdf): recover the letters of a ligature glyph that has no ToUnicode entry (#2680)\u201D; \u201Cfix(pdf): retain placed Form text and decode escaped tags (#2441)\u201D; \u201Cfix(pdf): cache Type 3 provenance during text extraction\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/run.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e552a4f481054157bdd01eff024b49e8672cfcbcb705ddd1f8f01f62d2d0d84"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs: crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::extractors::pdf::ocr::orientation_retry::recognition::mirror_half_turn at line 329), 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(ocr): compile the two-table cover check only where the two-table route exists (#2755)\u201D; \u201Cfix(ocr): recover a sideways page with two tables when the first read filtered words (#2723)\u201D; \u201Cfix(ocr): recover explicit-block tables on upside-down scans (#2631)\u201D; \u201Cfix(ocr): recover two certified sideways PDF tables (#2579)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry/recognition.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"49198f603cc94a8a4adba1f915d846380a4771713038386517c2666aaecee35e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/benchmark-harness/src/adapters/subprocess.rs: tools/benchmark-harness/src/adapters/subprocess.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is SubprocessAdapter::with_format_aware at line 161), 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(benchmarks): bind provenance to executable build\u201D; \u201Cfix(bench): preserve native paths and report signals\u201D; \u201Cfix(bench): use boolean assertions\u201D; \u201Cfix(bench): preserve adaptive Tesseract fallback\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- tools/benchmark-harness/src/adapters/subprocess.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":"tools/benchmark-harness/src/adapters/subprocess.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8327f1846abfc9d1e0348b119b6acdb56d0d95f72d29526c6e14ad2227c83ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-tesseract/build_support/source_cache.rs: crates/xberg-tesseract/build_support/source_cache.rs changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is xberg_tesseract::build_support::source_cache::ensure_directory at line 544), 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(tesseract): verify CMake source identity\u201D; \u201Cfix(tesseract): normalize Windows CMake source paths\u201D; \u201Cfix(build): stabilize Windows source validation\u201D; \u201Cfix(build): resolve symlinked Cargo build roots\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-tesseract/build_support/source_cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/build_support/source_cache.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9dfb3c6e536d451dd0944a3beafaae2a64bfe2ba864e97fb0749690a51e87a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/document/matched_layer_occurrences.rs: crates/xberg/src/extractors/pdf/ocr/document/matched_layer_occurrences.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is xberg::extractors::pdf::ocr::document::matched_layer_occurrences::replace_identifier_group at line 408), 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(pdf): require MediaBox for OCR raster proof\u201D; \u201Cfix(pdf): require known geometry for OCR reflow proof\u201D; \u201Cfix(pdf): deduplicate certified reflowed OCR text\u201D; \u201Cfix(pdf): remove duplicate OCR text with source evidence\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/document/matched_layer_occurrences.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/document/matched_layer_occurrences.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"1736ca44a86a86f3a9e8e4a82679e48064d3f8fd3b565823d1deea79b28b69e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/structure/spatial_table_detector/source_headers.rs: crates/xberg-native-pdf/src/structure/spatial_table_detector/source_headers.rs changed 6 times in last 90 days and 6 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 xberg_native_pdf::structure::spatial_table_detector::source_headers::infer_complete_leading_header at line 68), 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(pdf): measure visible header shading after overpaint\u201D; \u201Cfix(pdf): reject overpainted shading as header evidence\u201D; \u201Cfix(pdf): retain repeated grouped leaf headers (#2787)\u201D; \u201Cfix(pdf): honor graphics state in header rule evidence (#2703)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/structure/spatial_table_detector/source_headers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/spatial_table_detector/source_headers.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11429b2d5b64555d2708863f078dab691bcbd5b278ed884d486e2cd9f915bb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/chunking/classifier.rs: crates/xberg/src/chunking/classifier.rs changed 6 times in last 90 days and 6 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 xberg::chunking::classifier::classify_chunk at line 43), 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(core): simplify boolean predicates\u201D; \u201Cfix(markdown): keep TeX in dollar math when a reader applies escapes\u201D; \u201Cfix(markdown): write math as dollar math, not code math (#2781)\u201D; \u201Cfix(chunking): detect math fences with the Markdown parser\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/chunking/classifier.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/classifier.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0cb651c3970426b22396c5961861645d545c47fbb9cfca0882f8636a5023ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/pipeline/execution.rs: crates/xberg/src/core/pipeline/execution.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is xberg::core::pipeline::execution::execute_processor_stages at line 56), 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(extract): scope the time-limit stage checks and document the cut result\u201D; \u201Cfix(extract): make the time limit bound post-processing stages\u201D; \u201Cfix(redaction): redact verified Djot text and pages (#2457)\u201D; \u201Cfix(redaction): rebuild HTML from verified redacted text (#2454)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/pipeline/execution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/execution.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6591f984dffbf1827d0a898580bd0d53e79b9e778d703434d23ea25bc9a75408"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/ordering_snap.rs: crates/xberg-native-pdf/src/extractors/text/ordering_snap.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is xberg_native_pdf::extractors::text::ordering_snap::ordering_script_baselines at line 27), 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(pdf): let a NaN stack position pass the member-order check\u201D; \u201Cfix(pdf): mark far stack members, test script evidence placement, tighten stack pins\u201D; \u201Cfix(pdf): place script stacks after page ordering and keep bracket pieces out of them\u201D; \u201Cfix(pdf): share one script-stack rule across ordering, rows and markup\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/ordering_snap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/ordering_snap.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcfa42eb086bf85d9d09a9fc552dc5bd9f4ace1d2fb71481ce0f69a953e7921"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/runtime.rs: crates/xberg/src/core/runtime.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::core::runtime::run_on_large_stack at line 74), 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(engine): keep subscriber and test scopes across the stack hop\u201D; \u201Cfix(engine): run extraction on the large-stack runtime\u201D; \u201Cfix(redaction): gate the large-stack runner on its only caller\u201D; \u201Cfix(redaction): run external-redaction extraction on the 16 MiB runtime\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/runtime.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"db295b84c8db471c69c8314354b7c84b240a2d20a3f48aa161497da74de32bd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/derive/surfaces/capture/processor.rs: crates/xberg/src/extraction/derive/surfaces/capture/processor.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is DerivedResult::finish_processor_mutation at line 92), 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(redaction): prove styled heading and PDF text coverage\u201D; \u201Cfix(redaction): distinguish generated Markdown tags (#2459)\u201D; \u201Cfix(redaction): redact verified Djot text and pages (#2457)\u201D; \u201Cfix(redaction): rebuild HTML from verified redacted text (#2454)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/derive/surfaces/capture/processor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/surfaces/capture/processor.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"34df5c5c93d888db237f6cdea877d3a33c332d154ff16e8b5ac988fdf3ab1760"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/excel.rs: crates/xberg/src/extractors/excel.rs changed 9 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 ExcelExtractor::extract_content at line 377), 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(xlsx): put the sheet name heading on the page of its sheet\u201D; \u201Cfix(excel): enforce workbook text limits for every input\u201D; \u201Cfix: complete v1.1.0 release repairs\u201D; \u201Cfix(ooxml): validate the PPTX and XLSX containers, not just entry count\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/excel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"a451391a5305d9e36547859503a72ec56b393d0e75ccbb6aac8a9eede77807c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/api/jobs.rs: crates/xberg/src/api/jobs.rs changed 8 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 3 (its worst body is JobStore::finish_with at line 173), 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(api): cancel the job token before an aborted async task shows Failed\u201D; \u201Cfix(api): fail an async job whose task is dropped before it runs\u201D; \u201Cfix(api): admit async jobs under the store lock\u201D; \u201Cfix(api): track live async jobs outside the expiring cache\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/api/jobs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/jobs.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50eb9538290ec4854a56df4cd71f1077891f05b4d5ea07b1f24eb3df4c23b54"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/fonts/cmap.rs: crates/xberg-native-pdf/src/fonts/cmap.rs changed 8 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 9 (its worst body is CMap::get at line 106), 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(pdf): preserve multiline ToUnicode range mappings (#2479)\u201D; \u201Cfix(pdf): translate Type0 character codes to CIDs before width lookup\u201D; \u201Cfix(pdf): finish telemetry sanitization\u201D; \u201Cfix(pdf): reject non-hex ToUnicode destinations before slicing them\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/fonts/cmap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/fonts/cmap.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a73aadccfa2e84019f0d2c3ed48b897770553835abfcda541150005e2b369a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/plugins/processor/builtin/redaction.rs: crates/xberg/src/plugins/processor/builtin/redaction.rs changed 8 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 13 (its worst body is RedactionProcessor::process_with_surfaces at line 55), 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(redaction): redact verified Djot text and pages (#2457)\u201D; \u201Cfix(redaction): rebuild HTML from verified redacted text (#2454)\u201D; \u201Cfix(markdown): emit standard superscript and underline markup (#2360)\u201D; \u201Cfix(redaction): fail closed on processor errors\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/plugins/processor/builtin/redaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/processor/builtin/redaction.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d123b5052043f84bd8d6d5849a348ca57dc7737f802bcdfe73b1bae2a64e1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/benchmark-harness/src/provenance.rs: tools/benchmark-harness/src/provenance.rs changed 8 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 8 (its worst body is benchmark_harness::provenance::worker_semantics at line 499), 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: resolve extraction regressions for 1.3.8\u201D; \u201Cfix(benchmarks): make batch measurements accountable\u201D; \u201Cfix(benchmarks): separate cold and steady-state timing\u201D; \u201Cfix(benchmarks): bind provenance to executable build\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- tools/benchmark-harness/src/provenance.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":"tools/benchmark-harness/src/provenance.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1fc034c710dde82a5b95f8383ec6140bf2cde263b6e2e6644adcff0aa6e085"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/embeddings/mod.rs: crates/xberg/src/embeddings/mod.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 14 (its worst body is xberg::embeddings::embed_texts at line 756), 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(extract): scope the time-limit stage checks and document the cut result\u201D; \u201Cfix(extract): make the time limit bound post-processing stages\u201D; \u201Cfix(onnx): isolate session option invalidation\u201D; \u201Cfix(embeddings): hold the concurrency permit until inference finishes\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/embeddings/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/embeddings/mod.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"96532ac05f9d6a2c57cb9bc0b9aa02b759f1ca37f47290c2e6ca4826d0ccc7ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/paddle_ocr/model_manager.rs: crates/xberg/src/paddle_ocr/model_manager.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 8 (its worst body is ModelManager::check_models_cached at line 599), 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(ocr): read and fetch the PaddleOCR models at one revision (#2421)\u201D; \u201Cfix(ci): align feature-specific OCR gates\u201D; \u201Cfix(paddle-ocr): resolve the default mobile tier to small, not medium\u201D; \u201Cfix(image): align helpers with feature consumers\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/paddle_ocr/model_manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/model_manager.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ccd02b931642f1f07b1efe3f1681013334afd2bf0ac35ddaaee34279fb6643"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/paddle_ocr/config.rs: crates/xberg/src/paddle_ocr/config.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 5 (its worst body is PaddleOcrConfig::from_legacy_value at line 192), 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(ocr): accept legacy PaddleOCR camelCase keys\u201D; \u201Cfix(ocr): preserve lenient legacy Paddle config\u201D; \u201Cfix(ocr): type paddle_ocr_config as PaddleOcrConfig in every binding\u201D; \u201Cfix(paddle-ocr): resolve the default mobile tier to small, not medium\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/paddle_ocr/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/paddle_ocr/config.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9723655a0338ad191497db712bf387b136865e97d4e4ef0d3331adc35a564f89"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/clustering.rs: crates/xberg-native-pdf/src/extractors/text/clustering.rs changed 6 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 7 (its worst body is TextExtractor::apply_ligature_decisions at line 298), 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(pdf): keep a script layer drawn over a full-page picture (#3016)\u201D; \u201Cfix(pdf): keep a word joined after a ligature the font expands (#2756)\u201D; \u201Cfix(pdf): retain placed Form text and decode escaped tags (#2441)\u201D; \u201Cfix(pdf): cache Type 3 provenance during text extraction\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/clustering.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/clustering.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"142d0303932420d6220f6f05e226529200e2d8ee7b597f37c562f47bbe41022f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ink_probe.rs: crates/xberg/src/extractors/pdf/ink_probe.rs changed 6 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 9 (its worst body is xberg::extractors::pdf::ink_probe::contradicted_pages at line 250), 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(pdf): keep a script layer drawn over a full-page picture (#3016)\u201D; \u201Cfix(pdf): keep readable native text when a page has lost-glyph markers (#2637)\u201D; \u201Cfix(pdf): render mixed OCR table text as Plain\u201D; \u201Cfix(pdf): keep a correctly mapped script minority out of the ink probe\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ink_probe.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ink_probe.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3a5864e3490c21e7ae15fedecb642905fd0f337c249f0b5a613f713986fd4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/structure/lines.rs: crates/xberg/src/pdf/structure/lines.rs changed 6 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 12 (its worst body is xberg::pdf::structure::lines::segments_need_space at line 171), 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(pdf): end a run at its last glyph when a text matrix extends it\u201D; \u201Cfix(pdf): preserve spacing after raised note numbers\u201D; \u201Cfix(pdf): stop welding suspended hyphens and cutting unruled bands\u201D; \u201Cfix(pdf): stop splitting a word across two touching spans\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/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":"crates/xberg/src/pdf/structure/lines.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a34e14a907fee06828e8119347ad12174c1e2d9bc0aa1071226bcf3a0dd9623"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: fixtures/repros/tall-scan-strips/generate.py: fixtures/repros/tall-scan-strips/generate.py changed 6 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 9 (its worst body is generate._raster at line 71), 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(ocr): recover more tall scans and sideways tables with prose (#2641)\u201D; \u201Cfix(ocr): recover tall predictor and indexed PDF scans (#2587)\u201D; \u201Cfix(ocr): recover tall grayscale JPEG scans within budget (#2586)\u201D; \u201Cfix(ocr): recover tall neutral RGB scans without colour loss (#2580)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- fixtures/repros/tall-scan-strips/generate.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fixtures/repros/tall-scan-strips/generate.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b83326464732422cb2b8d0bebb3229b78688b707bb7d1f93bb5933c05978985"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/image/preprocessing.rs: crates/xberg/src/image/preprocessing.rs changed 6 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 4 (its worst body is xberg::image::preprocessing::validate_rgb_data at line 72), 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(ocr): fit unknown-DPI PNG and TIFF scans to workspace (#2561)\u201D; \u201Cfix(ocr): recover oversized JPEG scans within image budgets\u201D; \u201Cfix(ocr): size the resample of an untagged image by its text\u201D; \u201Cfix(security): enforce image peak budgets\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/image/preprocessing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/image/preprocessing.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7be29a57959ec6e16c9ef9e12db397487bdd7e3d299753ad363f1e14c768de"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/engine/structured/rasterize.rs: crates/xberg/src/engine/structured/rasterize.rs changed 6 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 3 (its worst body is xberg::engine::structured::rasterize::render_all_pages_with_options at line 157), 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(structured): enforce PDF page raster budgets (#2465)\u201D; \u201Cfix(structured): honor caller-selected image security limits\u201D; \u201Cfix(security): enforce image peak budgets\u201D; \u201Cfix(security): account for live image buffers\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/engine/structured/rasterize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/structured/rasterize.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6ac8a4424daee24ec67a68cb55fbe8120de130e841d25da7fd5a38229513c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/extractors/text/marked_content.rs: crates/xberg-native-pdf/src/extractors/text/marked_content.rs changed 5 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 TextExtractor::placed_pdf_text_dominates at line 270), 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(pdf): keep a script layer drawn over a full-page picture (#3016)\u201D; \u201Cfix(pdf): preserve enclosing scope in cached cmap donation\u201D; \u201Cfix(pdf): retain placed Form text and decode escaped tags (#2441)\u201D; \u201Cfix(pdf): recognize escaped PlacedPDF page tags (#2402)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/extractors/text/marked_content.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/marked_content.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"927842d3d10d11938d60969e98ab8f9e88a2d0676578b2a42c6fc9335eac8b8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/text/redaction/formatted.rs: crates/xberg/src/text/redaction/formatted.rs changed 5 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 11 (its worst body is HtmlPlan::new at line 160), 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(redaction): verify math in binary output\u201D; \u201Cfix(markdown): preserve redaction in rendered math\u201D; \u201Cfix(redaction): distinguish generated Markdown tags (#2459)\u201D; \u201Cfix(redaction): redact verified Djot text and pages (#2457)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/text/redaction/formatted.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/redaction/formatted.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7be323165c8eb50b9e1729a2e4065869b9bbc6ca8ae6ceddda32708272bb5e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/doc_orientation/detector.rs: crates/xberg/src/doc_orientation/detector.rs changed 5 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 7 (its worst body is DocOrientationDetector::prepare_cached at line 181), 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(pdf): retry low-confidence rotated scans from cached model (#2464)\u201D; \u201Cfix(ocr): read and fetch the PaddleOCR models at one revision (#2421)\u201D; \u201Cfix(security): enforce image peak budgets\u201D; \u201Cfix(security): account for live image buffers\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/doc_orientation/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":"crates/xberg/src/doc_orientation/detector.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5111c8cf0b72cf1408f8274f8aa79c0132fd089b4875b67ddd314d22ab4791"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/html/converter.rs: crates/xberg/src/extraction/html/converter.rs changed 5 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 6 (its worst body is xberg::extraction::html::converter::map_output_format at line 13), 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(html): preserve default Markdown script markers\u201D; \u201Cfix(html): preserve spacing around formatted empty links\u201D; \u201Cfix(url): recover HTML metadata for pages fetched over HTTP\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/html/converter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/converter.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98fa20092b87abaaaca93dc76ed97abd34d5a994418969a81d3be5343028d5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/latex/utilities.rs: crates/xberg/src/extractors/latex/utilities.rs changed 5 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 CommentState::strip_new_comment at line 373), 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(latex): preserve literal spans and command arguments\u201D; \u201Cfix(latex): print accent commands, letter commands and control spaces as their characters\u201D; \u201Cfix(latex): scan paragraph comments incrementally\u201D; \u201Cfix(latex): keep \\verb contents literal and stop paragraphs at the document end\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/latex/utilities.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/utilities.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1e514049e1b01c84784ed6e4c7083b69996fafe51ca32cba1b2227a55eb5b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/keywords/config.rs: crates/xberg/src/keywords/config.rs changed 5 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 3 (its worst body is NgramRange::validate at line 41), 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(schema): omit null for optional OCR and keyword refs (#2042)\u201D; \u201Cfix(types): serialize named structs as JSON objects, not tuples\u201D; \u201Cfix: stabilize extraction lifecycle and contracts\u201D; \u201Cfix(config): reject unknown nested fields\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/keywords/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/keywords/config.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f4a51e1d4f3afe347b843490cf076f1301036a5712d2da0d9b05520c4497a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ort_discovery.rs: crates/xberg/src/ort_discovery.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::ort_discovery::build_coreml_ep at line 338), 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(ocr): share the Sceptre ONNX Runtime environment\u201D; \u201Cfix(ort): share one ONNX Runtime environment across core, Paddle and GLiNER\u201D; \u201Cfix(ort): stop the CPU retry from swallowing an explicit provider failure\u201D; \u201Cfix(ort): fail an explicitly requested execution provider that cannot load\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ort_discovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ort_discovery.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4d4c81f4802311c2da66cc394a082a50d64035870e1307ef7c19915e933313"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/symbol_noise_texture.rs: crates/xberg/src/extractors/pdf/ocr/symbol_noise_texture.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is xberg::extractors::pdf::ocr::symbol_noise_texture::matching_peers at line 165), 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(ocr): preserve ink veto when filtering texture donors\u201D; \u201Cfix(ocr): require background agreement for texture pruning\u201D; \u201Cfix(pdf): retain texture evidence in default OCR\u201D; \u201Cfix(pdf): reconcile OCR texture by source occurrence\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/symbol_noise_texture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/symbol_noise_texture.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc88b6c0c29113850a28c6a562d51707c7a61ad0c8d8165fa7e69fbf2e6ecbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/object.rs: crates/xberg-native-pdf/src/object.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Object::type_name at line 93), 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(pdf): preserve packed RGB through image predictors\u201D; \u201Cfix(pdf): bound parser recovery telemetry\u201D; \u201Cfix(pdf): recover bilevel scan text\u201D; \u201Cfix(pdf): allow bounded high-ratio image streams\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/object.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/object.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ed1f3b14f5f63f347afda46548ff62c11a477c0621be6d38e8cb9cd60d334e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/doc/list_numbers.rs: crates/xberg/src/extraction/doc/list_numbers.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is ListFormats::parse_plf_lfo at line 227), 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(doc): paint zero-padded decimal .doc list labels\u201D; \u201Cfix(doc): bound the .doc list template and label allocation\u201D; \u201Cfix(doc): paint upper-letter levels, keep djot lists ordered\u201D; \u201Cfix(doc): count every numbered .doc paragraph for restarts\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/doc/list_numbers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/list_numbers.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ec958790df0817bfb0961ef18a3484e43b6fe471eee09d4a26abdd668d5763"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/plugins/registry/renderer.rs: crates/xberg/src/plugins/registry/renderer.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is xberg::plugins::registry::renderer::renders_from_markdown at line 168), 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(redaction): rebuild HTML from verified redacted text (#2454)\u201D; \u201Cfix(markdown): emit standard superscript and underline markup (#2360)\u201D; \u201Cfix(ocr): keep picture OCR text in slide decks (#2094)\u201D; \u201Cfix(plugins): re-seed built-in renderers when the registry was cleared\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/plugins/registry/renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/renderer.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a3ea9219984576aad0f5b6b2dbae161ddc8584548881ad505c06050b41d7ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/markdown_utils.rs: crates/xberg/src/extractors/markdown_utils.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::extractors::markdown_utils::markdown_events at line 136), 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(djot): preserve captions and smart punctuation\u201D; \u201Cfix(djot): drop the footnote reference with the caption of an empty table (#2279)\u201D; \u201Cfix(markdown): preserve citation labels and inline image text\u201D; \u201Cfix(markdown, djot): keep each footnote reference with the block that read it\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/markdown_utils.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/markdown_utils.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e5e9982c1f25ff2f5b0fac5ac04d14225021631c24aea52fac524b94ca23ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/benchmark-harness/src/adapters/native.rs: tools/benchmark-harness/src/adapters/native.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is benchmark_harness::adapters::native::assemble_batch_rows at line 225), 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(bench): reject zero batch timeouts\u201D; \u201Cfix(benchmarks): isolate warm OCR language state\u201D; \u201Cfix(benchmarks): make batch measurements accountable\u201D; \u201Cfix(benchmarks): separate cold and steady-state timing\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- tools/benchmark-harness/src/adapters/native.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":"tools/benchmark-harness/src/adapters/native.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a1255b725e1ef5ec817dd0f37145af2e88825faaf4eeceb98221a61ace2f63"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/text/quality_processor.rs: crates/xberg/src/text/quality_processor.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is QualityProcessor::process at line 81), 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(ocr): return Tesseract line elements at the default element level (#1981)\u201D; \u201Cfix(quality): share the OCR confidence fold with the aggregate\u201D; \u201Cfix(quality): cap quality_score at OCR recognition confidence\u201D; \u201Cfix(extraction): clarify quality and table limits\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/text/quality_processor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/quality_processor.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a8dfd938991ca4abab2fae41e0065e442c2a82c7a39b2e17846d0b5cbff751"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/candle_ocr/config.rs: crates/xberg/src/candle_ocr/config.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is CandleDevicePreference::from at line 46), 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(ocr): route the scan-detection signal into OCR preprocessing\u201D; \u201Cfix(candle-ocr): pick the DeepSeek-OCR dtype from the device\u201D; \u201Cfix(ocr): let candle OCR backends ignore the PDF page hints in backend_options\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/candle_ocr/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/config.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ce3f5a142c2d6c8c2e93f539be66f57171461d0a9b07ca9b960173a36ccea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/decoders/flate.rs: crates/xberg-native-pdf/src/decoders/flate.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is FlateDecoder::decode at line 233), 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(pdf): refuse a decompression limit of 0 instead of disabling the cap\u201D; \u201Cfix(native-pdf): bound RunLength/LZW decode output mid-decode\u201D; \u201Cfix(native-pdf): stop a large page content stream reading as a bomb\u201D; \u201Cfix(pdf): classify recovered decode failures\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/decoders/flate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/decoders/flate.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc330fdcfc9ea66abed5f145581d8b4483fe380d484647f925db4f8af771cc02"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/image_kind.rs: crates/xberg/src/extraction/image_kind.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is xberg::extraction::image_kind::classify_by_colorspace_and_format at line 129), 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(build): keep the internal image-classify parameter bag out of the bindings\u201D; \u201Cfix(security): enforce image peak budgets\u201D; \u201Cfix(security): account for live image buffers\u201D; \u201Cfix(security): bound decoded image allocations\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/image_kind.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_kind.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f6e50843311f6cc3f2f5efe8518f5644b88c5810d906f53fe5882e68aca1e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/cache.rs: crates/xberg/src/ocr/cache.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is OcrCache::clear at line 292), 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(ocr): validate model bytes at request boundaries\u201D; \u201Cfix(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(ocr): fit raw mixed PDF scans to workspace (#2572)\u201D; \u201Cfix(ocr): keep embedded-image retry text beside a table that claimed no page text (#2009)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/cache.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"17242b539035787b72f4cb2ca4f080e8692d2f5d91d3f158f97a2042b80ba7fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs: crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::extractors::pdf::ocr::pipeline::detached_mixed_frame::place_table_in_render at line 96), 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(pdf): keep a sideways pipeline page\u0027s paragraphs out of the table frame\u201D; \u201Cfix(pdf): tighten the detached table frame fallback\u201D; \u201Cfix(pdf): place detached OCR tables in the frame recognition read\u201D; \u201Cfix(ocr): recover sideways tables with surrounding prose (#2774)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef569572368aac58d68a74aabee1fd451ff4cf8d2642f397d6ab3ff44489aa8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/number_recovery/shape_proof.rs: crates/xberg/src/extractors/pdf/ocr/number_recovery/shape_proof.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is FontGraph::copy at line 695), 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(ocr): decode the number-recovery glyph raster through the audited decoder\u201D; \u201Cfix(pdf): settle measured number recovery declines\u201D; \u201Cfix(pdf): share numeric proof budget across eligible pages\u201D; \u201Cfix(pdf): retain recovery budget after early source declines\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/number_recovery/shape_proof.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/number_recovery/shape_proof.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b69ff4939935d2ac7d5e3e88721a008c14d26e706241212efa4b0a05f37bcc8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/rendering/table_math.rs: crates/xberg/src/rendering/table_math.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is xberg::rendering::table_math::read_annotations at line 57), 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(markdown): keep math with non-ASCII text and tag openers in Markdown output (#2797)\u201D; \u201Cfix(markdown): write math as dollar math, not code math (#2781)\u201D; \u201Cfix(ci): match table math imports to producer feature gates\u201D; \u201Cfix(ci): scope table math producers and sort budget imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/table_math.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/table_math.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f498630103e5284059b23e087c91a16f3d42681ea08663569c1cc3539d32193"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/candle_ocr/ocr_result.rs: crates/xberg/src/candle_ocr/ocr_result.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is xberg::candle_ocr::ocr_result::extract_gfm_tables at line 210), 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(ocr): split plus-joined language lists before the script allowlist\u201D; \u201Cfix(ocr): drop implausible-script and bare-LaTeX lines from candle OCR\u201D; \u201Cfix(security): account for live image buffers\u201D; \u201Cfix(candle-ocr): warn when auto_rotate is requested of a backend that ignores it\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/candle_ocr/ocr_result.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/candle_ocr/ocr_result.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"667368c63ba6c701e4f7f0451b07bf9024fd1e30e30597993503836ffcfb3d66"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/llm/structured.rs: crates/xberg/src/llm/structured.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::llm::structured::provider_schema_name at line 105), 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(llm): normalize structured-output schema names (#2394)\u201D; \u201Cfix(llm): retain usage on structured output failures\u201D; \u201Cfix(llm): validate strict structured output locally\u201D; \u201Cfix: resolve extraction regressions for 1.3.8\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/llm/structured.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/llm/structured.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7214bda6e4082b0c258f871816d70cec7287f6677b8b88947b820c4fcd53d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/inference/ort_backend.rs: crates/xberg/src/inference/ort_backend.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is xberg::inference::ort_backend::value_to_tensor at line 218), 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(ci): restore Clippy checks for V3 inference and capture (#2384)\u201D; \u201Cfix(layout): align V3 inputs and validate model outputs (#2359)\u201D; \u201Cfix: complete v1.1.0 release repairs\u201D; \u201Cfix(ort): stop the CPU retry from swallowing an explicit provider failure\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/inference/ort_backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/inference/ort_backend.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2680925067455574774592205932fb81217257c9a55c4118dbff20d6c920e3ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/vtt.rs: crates/xberg/src/extractors/vtt.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is xberg::extractors::vtt::parse_track at line 88), 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(vtt): check timestamp arithmetic and decode speaker annotations (#2330)\u201D; \u201Cfix(vtt): skip the header lines after the WEBVTT signature (#2320)\u201D; \u201Cfix(vtt): preserve literal cues and normalize numeric references\u201D; \u201Cfix(vtt): decode numeric character references and leave ruby text out of the line\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/vtt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/vtt.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae03a77e595a40a85de7d0824e6ba8a3f0bff9bbfe438ca25c9dfa5d0b5e79ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/region_vlm.rs: crates/xberg/src/extractors/pdf/region_vlm.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is xberg::extractors::pdf::region_vlm::splice_element at line 326), 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(pdf): replace region content only when the VLM answer carries 90% of its words (#2263)\u201D; \u201Cfix(pdf): replace native table text with VLM table answers, warn on table model load failures (#2242)\u201D; \u201Cfix(pdf): five fixes to layout, formula and VLM region handling in native PDF extraction (#2232)\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/region_vlm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/region_vlm.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"328029233f0142ca826347029ea7757118110b7a731652e411e917ea17f351bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/archive.rs: crates/xberg/src/extractors/archive.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is xberg::extractors::archive::build_archive_doc at line 153), 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: resolve extraction regressions for 1.3.8\u201D; \u201Cfix: complete v1.1.0 release repairs\u201D; \u201Cfix(archive): heap-allocate the recursive child-extraction future\u201D; \u201Cfix(extraction): cancel the work a timeout gives up waiting for\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/archive.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/archive.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2e66b2cad28e57bb24f95b48e8b1367482e8d46b35f910f9d3de1d585f5ae4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/pages.rs: crates/xberg/src/extractors/pdf/pages.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is xberg::extractors::pdf::pages::assign_tables_and_images_to_pages at line 103), 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(pdf): reconcile native page table snapshots after selection\u201D; \u201Cfix(pdf): preserve embedded-image OCR text\u201D; \u201Cfix(pdf): report measured font size in page hierarchy blocks\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/pages.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/pages.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"241ad8c3b82a9e8dc9180afa286634ae2079c857d2c13167b381c6c159038252"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/pptx/container.rs: crates/xberg/src/extraction/pptx/container.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is SlideIterator::resolve_graphic_frame_text at line 274), 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: resolve extraction regressions for 1.3.8\u201D; \u201Cfix(ooxml): validate the PPTX and XLSX containers, not just entry count\u201D; \u201Cfix(office): bound HWPX, PPTX and XLSX container member reads\u201D; \u201Cfix(ooxml): honour max_files_in_archive in the docx and pptx containers\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/pptx/container.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/container.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01a3feebaa27f1d3f6e39177703c912b8de28d51812f9df4b4f65e77fe11d63"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/heuristics/confidence.rs: crates/xberg/src/heuristics/confidence.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is SchemaCompliance::score at line 35), 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(ocr): return Tesseract line elements at the default element level (#1981)\u201D; \u201Cfix(quality): share the OCR confidence fold with the aggregate\u201D; \u201Cfix(heuristics): populate the OCR aggregate confidence on the page-level route\u201D; \u201Cfix(heuristics): score a failed structured extraction as non-compliant\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/heuristics/confidence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/heuristics/confidence.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01699b289893e5443a07d518bb1180bd304597418e0049c337087143042a6e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/image_encode.rs: crates/xberg/src/core/image_encode.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is xberg::core::image_encode::decode_source at line 379), 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(security): close image budget gaps\u201D; \u201Cfix(security): enforce image peak budgets\u201D; \u201Cfix(security): account for live image buffers\u201D; \u201Cfix(security): bound decoded image allocations\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/image_encode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/image_encode.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef057bcdea13dda433a7e5e1a2223707431a00be19834fb885877858cc14b08"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/native/table/source_members.rs: crates/xberg/src/pdf/native/table/source_members.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is xberg::pdf::native::table::source_members::source_size at line 126), 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(pdf): recover open actuarial table columns\u201D; \u201Cfix(pdf): preserve ruled detection metrics in table cells\u201D; \u201Cfix(pdf): preserve painted fee and company tables (#2574)\u201D; \u201Cfix(pdf): preserve painted exhibit table source cells (#2550)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/native/table/source_members.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/table/source_members.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a80e1c0a54dd45c7cf4a59dfbab4ab1ff421b1def46aec0b869b1f92657d66"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/image_table_reread.rs: crates/xberg/src/extractors/image_table_reread.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is xberg::extractors::image_table_reread::second_read_is_usable at line 366), 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(ocr): scope Markdown row breaks to qualified paragraphs\u201D; \u201Cfix(ocr): re-read a leader picture whose first read holds a garbled table (#2777)\u201D; \u201Cfix(ocr): adopt the block re-read of a standalone dot-leader table picture (#2763)\u201D; \u201Cfix(ocr): keep the first read when the table re-read finds no table (#2745)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/image_table_reread.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image_table_reread.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e786de43e1c6475c1bbf50ff0c06070d3bf0294fbf1fea50f7a9b3070ddf25"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/rendering/raster_budget.rs: crates/xberg-native-pdf/src/rendering/raster_budget.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is SpotPlaneScan::form at line 114), 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(pdf): simplify resource scanning and pin mask accounting\u201D; \u201Cfix(pdf): converge knockout workspace DPI retries\u201D; \u201Cfix(pdf): fit raster retries to live render workspace\u201D; \u201Cfix(pdf): budget groups in inherited resource scopes\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/rendering/raster_budget.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/raster_budget.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"297666a0655c22a766f0d916d11667ad31f55a0038b40f846be52ecd4d91fd94"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/rendering/pdf/blocks.rs: crates/xberg/src/rendering/pdf/blocks.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Builder::text at line 462), 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(markdown): keep TeX in dollar math when a reader applies escapes\u201D; \u201Cfix(markdown): write math as dollar math, not code math (#2781)\u201D; \u201Cfix(markdown): emit standard superscript and underline markup (#2360)\u201D; \u201Cfix(markdown): keep code and math from turning into raw HTML\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/rendering/pdf/blocks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/pdf/blocks.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8d04d1e0ea0aed776a51e41878fae4080980f225d32789fdd2bc46ee6bcc3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/pdf/structure/pipeline/script_evidence.rs: crates/xberg/src/pdf/structure/pipeline/script_evidence.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is xberg::pdf::structure::pipeline::script_evidence::preserves_existing_scripts at line 75), 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(pdf): mark far stack members, test script evidence placement, tighten stack pins\u201D; \u201Cfix(pdf): place script stacks after page ordering and keep bracket pieces out of them\u201D; \u201Cfix(pdf): keep literal primes beside their operands (#2453)\u201D; \u201Cfix(pdf): keep same-row text out of script markup (#2452)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/pdf/structure/pipeline/script_evidence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/pipeline/script_evidence.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed00272e82bd95c509ac59d1388a490d7bc9002f0f436eb22f083db35aa1e8bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/execution/budgeted_downscale.rs: crates/xberg/src/ocr/processor/execution/budgeted_downscale.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::ocr::processor::execution::budgeted_downscale::recover at line 21), 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(ocr): keep a refused large scan\u0027s retry read that trips the noise check (#2836)\u201D; \u201Cfix(ocr): keep the DPI fallback when downscaling\u201D; \u201Cfix(ocr): downscale oversized PNG and TIFF with caller options\u201D; \u201Cfix(ocr): fit raw mixed PDF scans to workspace (#2572)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/execution/budgeted_downscale.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/budgeted_downscale.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5be0fbf62f0e36c29850b6a1cbcfb863eb5e1c54c5107d4ae1c75a6a65bcdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/excel/table_budget.rs: crates/xberg/src/extraction/excel/table_budget.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is xberg::extraction::excel::table_budget::validate_xlsx_sheet at line 278), 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(excel): extract the sheets that fit when a workbook exceeds the cell limit (#2820) (#2822)\u201D; \u201Cfix(excel): enforce workbook text limits for every input\u201D; \u201Cfix(excel): retain missing worksheet warnings after upgrade\u201D; \u201Cfix(ci): scope table math producers and sort budget imports\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/excel/table_budget.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/excel/table_budget.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21541e202c88ecd946c0846895480c4da7a069f6b2055d7999cf8b00c5b23f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/table/coverage.rs: crates/xberg/src/ocr/table/coverage.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is xberg::ocr::table::coverage::drop_elements_claimed_by_tables at line 40), 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(ocr): print each dot-leader table row once after the block read (#2795)\u201D; \u201Cfix(ocr): omit exact table rows from grouped hOCR\u201D; \u201Cfix(ocr): omit exact prose rows from lossy tables\u201D; \u201Cfix(ocr): keep embedded-image retry text beside a table that claimed no page text (#2009)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/table/coverage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/table/coverage.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af66b290c6cb17bf7757cccc91fbdc1b1260f9e08e46e6b3290189e0fdf0379"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/ci/windows_wheel_clean_host.py: scripts/ci/windows_wheel_clean_host.py changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is windows_wheel_clean_host.baseline at line 177), 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(ci): identify the bundled MSVCP runtime in Windows probes (#2564)\u201D; \u201Cfix(ci): verify the native Windows loader status (#2562)\u201D; \u201Cfix(ci): inventory all unexpected clean-host CRT paths (#2558)\u201D; \u201Cfix(ci): replay Windows clean-host tests on verified wheels (#2556)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/ci/windows_wheel_clean_host.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/windows_wheel_clean_host.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34846cfb772bfd3d34c6ee2a592537f5ee371cb04f2ff1fc655c37ac243444b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/plugins/registry/processor.rs: crates/xberg/src/plugins/registry/processor.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is PostProcessorRegistry::remove at line 180), 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(markdown): emit standard superscript and underline markup (#2360)\u201D; \u201Cfix: batch OCR, cache, and macOS release repairs (#2034)\u201D; \u201Cfix: guard processor snapshot lifecycle\u201D; \u201Cfix: stabilize extraction lifecycle and contracts\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/plugins/registry/processor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/registry/processor.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ec2bee56b9bfb957b9a5ee7383d314f15da7037d60b69c8fe3580c12ef8ba5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/config/extraction/loaders.rs: crates/xberg/src/core/config/extraction/loaders.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is ExtractionConfig::from_file at line 56), 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(deps): replace unmaintained unsafe-libyaml via yaml_serde\u201D; \u201Cfix(config): discover project YAML and JSON (#2025)\u201D; \u201Cfix(config): reject unknown nested fields\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config/extraction/loaders.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/loaders.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e6ad73002cd5b96af34a807f4e089e542e087035fca26819c9f1598cb9bc14"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/config/content_filter.rs: crates/xberg/src/core/config/content_filter.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is ContentFilterConfig::default at line 95), 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(doc): enforce ambiguous story filters\u201D; \u201Cfix(doc): emit header, footer, footnote, comment and text-box text\u201D; \u201Cfix(pdf): stop deleting a body paragraph that repeats a title\u201D; \u201Cfix(config): reject unknown nested fields\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config/content_filter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/content_filter.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb45b1d37a56426d773b6a7023e8e822d6fdd19707807e28e3d2a6c09501440"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/benchmark-harness/src/bench_matrix.rs: tools/benchmark-harness/src/bench_matrix.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is Cohort::as_str at line 140), 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(benchmarks): count zero-overlap samples as accountable failures\u201D; \u201Cfix(bench): expect OCR used for the image cohort\u201D; \u201Cfix(bench): include Pdfium artifacts in contract\u201D; \u201Cfix(bench): bound Sceptre image diagnostics\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- tools/benchmark-harness/src/bench_matrix.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":"tools/benchmark-harness/src/bench_matrix.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b383bb02d913c071eb25196ad2ddafcd21ea3d9568889bb58255d3421fb221"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/epub/parsing.rs: crates/xberg/src/extractors/epub/parsing.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::extractors::epub::parsing::parse_encrypted_members at line 147), 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(epub): stop dropping chapters, metadata and whole books (#1502)\u201D; \u201Cfix(epub): harden packaging XML parsing\u201D; \u201Cfix(epub): guard the link-label slice and bound container reads\u201D; \u201Cfix(office): stop a crafted PPTX panicking, and unify container path resolution\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/epub/parsing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/parsing.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c265f2192eb63c56384d3e7ce7ee722878e95f266ee37043e08bf621c58d66e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/validation.rs: crates/xberg/src/ocr/processor/validation.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is xberg::ocr::processor::validation::tessdata_search_dirs at line 174), 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(ocr): read a noisy Han page again with chi_sim, no download (#2818)\u201D; \u201Cfix(ocr): probe tessdata for the configured languages, widen the memo key\u201D; \u201Cfix(ocr): resolve the language probe\u0027s tessdata directory the same way a job does\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/validation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/validation.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c651e22ac42990f1c68d290ab45fc3dcd95bf338feffe7784bf4bc207229921"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/api_pool/retry.rs: crates/xberg/src/ocr/processor/api_pool/retry.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is RetryApiPools::with_initializer at line 49), 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(ocr): retain Han recovery for narrow marks\u201D; \u201Cfix(ocr): preserve Han marks and verify retry model loads\u201D; \u201Cfix(ocr): gate Han retries and retain idle engines\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/api_pool/retry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/api_pool/retry.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"845acb52040862f9cdcc9e535c90b0ce0069cd2d8a9c21ae047b1c3af77303b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/pipeline/sparse_glyph_read.rs: crates/xberg/src/extractors/pdf/ocr/pipeline/sparse_glyph_read.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::extractors::pdf::ocr::pipeline::sparse_glyph_read::marked_words at line 79), 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(pdf): keep margin-filtered OCR at normal density\u201D; \u201Cfix(pdf): retry sparse OCR rejected by page quality\u201D; \u201Cfix(pdf): retry unresolved sparse glyph reads at normal DPI\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/pipeline/sparse_glyph_read.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/sparse_glyph_read.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a018129a448baf54cadcd19cb24ac882c6388dd61a23a60e630a204c24bdb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/pipeline/direct_rgb_budget_recovery.rs: crates/xberg/src/extractors/pdf/ocr/pipeline/direct_rgb_budget_recovery.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::extractors::pdf::ocr::pipeline::direct_rgb_budget_recovery::try_recovery at line 6), 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(test): import PDF render helper from its module\u201D; \u201Cfix(ocr): read a large one-page scan under a named OCR pipeline like the default route (#2934)\u201D; \u201Cfix(pdf): honor configured OCR density across PDF routes (#2829)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/pipeline/direct_rgb_budget_recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/pipeline/direct_rgb_budget_recovery.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c2733942ac2e9075aca0a3ad10a884389865318787b007a5267b3f89e97557"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/pipeline/reading_order/structure_tree.rs: crates/xberg-native-pdf/src/pipeline/reading_order/structure_tree.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is xberg_native_pdf::pipeline::reading_order::structure_tree::mcid_order_zigzags_columns at line 143), 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(pdf): keep a word joined after a ligature the font expands (#2756)\u201D; \u201Cfix(ocr): preserve Arabic and Hebrew reading order\u201D; \u201Cfix(pdf): count recoverable input, and split the two oversized modules\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/pipeline/reading_order/structure_tree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/pipeline/reading_order/structure_tree.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d34ed6657ad41b5375f0114f7a32d2a7391db1f5c0abf7bc4a367d0c071f6ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/ci/check-changelog-sync.py: scripts/ci/check-changelog-sync.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is check-changelog-sync.main at line 133), 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(docs): make the changelog sync checker executable\u201D; \u201Cfix(ci): compare the Unreleased section and release dates in changelog sync\u201D; \u201Cfix(ci): synchronize docs changelog\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- scripts/ci/check-changelog-sync.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/check-changelog-sync.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b830e8afa2881b3c9dc70f754ab31821021a4e8c828547098060fc0a1bbf902"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/formula_recognition/mod.rs: crates/xberg/src/formula_recognition/mod.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is xberg::formula_recognition::recognize_crop at line 268), 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(formula): honor the configured model cache root\u201D; \u201Cfix(pdf): recognise formulas on pages the mixed OCR route reads (#2280)\u201D; \u201Cfix(doctor): probe all compiled capabilities\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/formula_recognition/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/formula_recognition/mod.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7488d091687bc7d7dbeb27ecf2e5a15ca9ee1ea7215edf67f36c9aa72acafbb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/reranking/mod.rs: crates/xberg/src/reranking/mod.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is xberg::reranking::rerank at line 736), 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(reranker): keep the balanced preset off CoreML on macOS\u201D; \u201Cfix(reranker): hold the concurrency permit until inference finishes\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/reranking/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/reranking/mod.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fecd1e200e838bcbcf8159e2bfa7d040da0829abcbd78edf6c5268d0ee5d3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/config/extraction/env.rs: crates/xberg/src/core/config/extraction/env.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ExtractionConfig::apply_env_output_overrides at line 196), 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(ocr): preserve PaddleOCR config compatibility\u201D; \u201Cfix(ocr): type paddle_ocr_config as PaddleOcrConfig in every binding\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config/extraction/env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/extraction/env.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29fd8b5bef1035a57389a40c46ecf2f57f6e6d6a028c79ce34745ebb992a164"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/page.rs: crates/xberg/src/types/page.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is PageDimensions::deserialize at line 90), 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(api): drop the null union from omitted optional references\u201D; \u201Cfix(types): serialize named structs as JSON objects, not tuples\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/page.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/page.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f709455790d9bd657a67457d0f086d434f244e615f465f4fb693fb40c6b7d2ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/xref_reconstruction.rs: crates/xberg-native-pdf/src/xref_reconstruction.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is xberg_native_pdf::xref_reconstruction::reconstruct_minimal_trailer at line 335), 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(pdf): bound parser recovery telemetry\u201D; \u201Cfix(pdf): sanitize xref recovery telemetry\u201D; \u201Cfix(pdf): bound the arithmetic a crafted xref stream drives\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/xref_reconstruction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref_reconstruction.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"565e26560420e7f57c396c79f8df79914b199fc964862845b1c539af4fcd8455"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/image_ocr/pdf_gap.rs: crates/xberg/src/extraction/image_ocr/pdf_gap.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 7 (its worst body is xberg::extraction::image_ocr::pdf_gap::native_anchor_text at line 264), 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(ocr): recover embedded picture lines on any page (#2643)\u201D; \u201Cfix(ocr): recover embedded prose with caches enabled\u201D; \u201Cfix(pdf): recover embedded prose with automatic Tesseract segmentation (#2607)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/image_ocr/pdf_gap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/image_ocr/pdf_gap.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5189a7bc15aa9c7073a8dbd5e81112a6c82e494644b8588deab9d7405b36aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/benchmark-harness/src/comparison/extraction_config.rs: tools/benchmark-harness/src/comparison/extraction_config.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 14 (its worst body is benchmark_harness::comparison::extraction_config::build_extraction_config at line 554), 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(benchmarks): align local layout pipeline with CI\u201D; \u201Cfix(ocr): preserve PaddleOCR config compatibility\u201D; \u201Cfix(ocr): type paddle_ocr_config as PaddleOcrConfig in every binding\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- tools/benchmark-harness/src/comparison/extraction_config.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":"tools/benchmark-harness/src/comparison/extraction_config.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a26784c51b0b2457591c5a81d5e99efd99193d2c8c08a242044513919b757d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/layout/mod.rs: crates/xberg/src/layout/mod.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 6 (its worst body is xberg::layout::take_or_create_slanet at line 510), 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(tables): retain OCR headers and cell geometry through output\u201D; \u201Cfix(extraction): retain unavailable table model warnings\u201D; \u201Cfix(extraction): warn when the table model fails to load for images and force-OCR PDFs (#2278)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/layout/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/mod.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7c4b58d5dcc23ea18e535351a5c3c7ef68e6dae3774602b5cfa462dba4cf9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/pipeline/cache.rs: crates/xberg/src/core/pipeline/cache.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 1 (its worst body is ProcessorCache::new at line 34), 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(markdown): emit standard superscript and underline markup (#2360)\u201D; \u201Cfix: guard processor snapshot lifecycle\u201D; \u201Cfix: stabilize extraction lifecycle and contracts\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/pipeline/cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/cache.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8312052bc47e93e3d7d4b71d000ce331128e3eda9b1c4311af4999e17344c68"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/layout/models/pp_doclayout_v3.rs: crates/xberg/src/layout/models/pp_doclayout_v3.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 13 (its worst body is PpDocLayoutV3Model::class_from_id at line 146), 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(ci): restore Clippy checks for V3 inference and capture (#2384)\u201D; \u201Cfix(layout): align V3 inputs and validate model outputs (#2359)\u201D; \u201Cfix(layout): charge each detection batch against the budget, not the whole document (#1730)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/layout/models/pp_doclayout_v3.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/layout/models/pp_doclayout_v3.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f8580cd2bb4fc6aad01869c3139f77f3773c483018c76d3a3b52e80621c523"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/engine/structured/schema.rs: crates/xberg/src/engine/structured/schema.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 8 (its worst body is xberg::engine::structured::schema::validate_and_merge at line 164), 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(tests): make the accepted schema socket blocking on macOS\u201D; \u201Cfix(structured): honor declared JSON Schema draft\u201D; \u201Cfix(security): force offline JSON Schema resolution\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/engine/structured/schema.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/structured/schema.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c12ce4735b69fa368efa65eff95ccf6a17519b4fcee0d466c0d16d909c7e103"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/csv.rs: crates/xberg/src/extractors/csv.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 13 (its worst body is xberg::extractors::csv::infer_column_types at line 461), 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(csv): retain delimiter parsing in production builds\u201D; \u201Cfix(csv): budget padded dimensions before retaining rows\u201D; \u201Cfix(csv): escape table pipes and line breaks\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/csv.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/csv.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"534e0512b8ed7b6a6e16d0968b3f6a4a31097251b25179d534bc0026865e364a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/math_symbols.rs: crates/xberg/src/extraction/math_symbols.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 14 (its worst body is xberg::extraction::math_symbols::letter_like_and_delimiter_to_latex at line 264), 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(office): preserve equations and surrounding text\u201D; \u201Cfix(docx, odt): four fixes to equation handling in office documents (#2241)\u201D; \u201Cfix(mathml): limits on big operators, mmultiscripts and invisible operators (#2228)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/math_symbols.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/math_symbols.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1449908871c04e66ed6714b5cea608d0337d1a8a5ffa9e5b94e832e1535447f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/structured.rs: crates/xberg/src/extraction/structured.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 13 (its worst body is xberg::extraction::structured::extract_from_toml_value at line 563), 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(toml): print a date or time as its TOML text (#2225)\u201D; \u201Cfix(deps): replace unmaintained unsafe-libyaml via yaml_serde\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/structured.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/structured.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e10bdd232460ae834746ed00be7856e73cce8d24fc9f2e63afdadd4ab68957"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/asciidoc/syntax.rs: crates/xberg/src/extractors/asciidoc/syntax.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 10 (its worst body is xberg::extractors::asciidoc::syntax::parse_cross_reference at line 272), 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(asciidoc): preserve literal macros and bound malformed scans\u201D; \u201Cfix(asciidoc): bound reference scans and keep passthrough text out of attribute substitution\u201D; \u201Cfix(asciidoc): read cross references, passthroughs, escapes and hard line breaks\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/asciidoc/syntax.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/asciidoc/syntax.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f9b8397a350ec9dd190b0bd5d68ab9b1051d024141d44b26c2a66da2feb8a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/benchmark-harness/src/adapters/subprocess/adapter_impl.rs: tools/benchmark-harness/src/adapters/subprocess/adapter_impl.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 7 (its worst body is SubprocessAdapter::worker_provenance at line 123), 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(benchmarks): make batch measurements accountable\u201D; \u201Cfix(benchmarks): separate cold and steady-state timing\u201D; \u201Cfix(benchmarks): bind provenance to executable build\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- tools/benchmark-harness/src/adapters/subprocess/adapter_impl.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":"tools/benchmark-harness/src/adapters/subprocess/adapter_impl.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef83b4358d48badf3c535a4bba6af087ebaa9c6512b1451b837e8b57a644e79"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/chunking/core.rs: crates/xberg/src/chunking/core.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 15 (its worst body is xberg::chunking::core::inject_table_headers at line 286), 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: \u201Cchore: integrate fixes and dependency upgrades for 1.3.11\u201D; \u201Cfix(chunking): make chunking linear and fix several splitting defects\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/chunking/core.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/core.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"da30d758565e7478f5810b317d36856ecfcf8a57e1636f9899be8af31d436c81"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/pptx/metadata.rs: crates/xberg/src/extraction/pptx/metadata.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 xberg::extraction::pptx::metadata::merge_core_properties at line 40), 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(pptx): attach speaker notes through slide relationships\u201D; \u201Cfix(ooxml): validate the PPTX and XLSX containers, not just entry count\u201D; \u201Cfix(ooxml): honour max_files_in_archive in the docx and pptx containers\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/pptx/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/metadata.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d23570d5616c18a4589396d3a2d04f3734dfcbce5f061c81da984cac0dcea8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tools/benchmark-harness/src/validate_artifacts.rs: tools/benchmark-harness/src/validate_artifacts.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 7 (its worst body is benchmark_harness::validate_artifacts::require_artifact_args at line 96), 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(benchmarks): separate cold and steady-state timing\u201D; \u201Cfix(benchmarks): count zero-overlap samples as accountable failures\u201D; \u201Cfix(bench): expect OCR used for the image cohort\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- tools/benchmark-harness/src/validate_artifacts.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":"tools/benchmark-harness/src/validate_artifacts.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e1a1334c1d19cb50aa58573b04338dd494ae53b4491992385f4ad6d64b2492"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/doctor/ocr.rs: crates/xberg/src/doctor/ocr.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 xberg::doctor::ocr::audit_ocr_capabilities_from at line 39), 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(ocr): preserve PaddleOCR config compatibility\u201D; \u201Cfix(ocr): type paddle_ocr_config as PaddleOcrConfig in every binding\u201D; \u201Cfix(doctor): probe all compiled capabilities\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/doctor/ocr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/doctor/ocr.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fa00b11aecf2738003cb4e3ebeb03fe719c0bca6d254a20285ad37ab909704"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/metadata.rs: crates/xberg/src/types/metadata.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 13 (its worst body is HtmlMetadata::from at line 1172), 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(api): drop the null union from omitted optional references\u201D; \u201Cfix(types): serialize named structs as JSON objects, not tuples\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/metadata.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcb8a8440a3bd5ad45d6158e4b77e37bc9f36f1934bfb7fe936c3036864ac31"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/config/processing.rs: crates/xberg/src/core/config/processing.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 3 (its worst body is ChunkingConfig::resolve_preset at line 307), 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(config): reject unknown nested fields\u201D; \u201Cfix: complete v1.1.0 release repairs\u201D; \u201Cfix(config): delegate enum-variant defaults so codegen can read them\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config/processing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/processing.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"5261af76b695a3e1f20b38f82cbf9877ce66c05f47b04bae164f9f43dc9bed2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/objstm.rs: crates/xberg-native-pdf/src/objstm.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 7 (its worst body is xberg_native_pdf::objstm::parse_object_stream_with_decryption_outcome at line 132), 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(pdf): harden recovery telemetry caches\u201D; \u201Cfix(pdf): bound object stream cache\u201D; \u201Cfix(pdf): bound parser recovery telemetry\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/objstm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/objstm.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"93efffc1f467c6da241e0319d06b1a42f9fae5341d5cf6b9777b7bab36347144"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/unmapped_glyphs.rs: crates/xberg/src/extractors/pdf/unmapped_glyphs.rs changed 3 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 7 (its worst body is MarkerRuns::outside at line 41), 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(pdf): report unrecovered glyphs on retained OCR pages\u201D; \u201Cfix(pdf): gate the lost-symbol re-export on OCR or tests\u201D; \u201Cfix(pdf): keep readable native text when a page has lost-glyph markers (#2637)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/unmapped_glyphs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/unmapped_glyphs.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"082ed3cc33f6069e83263731e8b7c79a9d62daad5dfad060ee325543d3572586"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/document/tables/source_ownership.rs: crates/xberg-native-pdf/src/document/tables/source_ownership.rs changed 3 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 5 (its worst body is xberg_native_pdf::document::tables::source_ownership::recover_wide_source_table at line 178), 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(pdf): preserve source ownership of raised text\u201D; \u201Cfix(pdf): admit three-row, 16-18 column source-ruled tables (#2627)\u201D; \u201Cfix(pdf): preserve painted fee and company tables (#2574)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/document/tables/source_ownership.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/tables/source_ownership.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cca1cee6be171d4df379f4ab9a7850412ea255485e13c1b6d1981b0585aa31c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/outline_ocr.rs: crates/xberg/src/extractors/pdf/outline_ocr.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is xberg::extractors::pdf::outline_ocr::contour_bounds at line 119), 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(extract): skip chunk embeddings after a time-limit stop, name skipped stages\u201D; \u201Cfix(pdf): accept outlined prose pages past seven drawn rows\u201D; \u201Cfix(ocr): recover full-page raster prose behind native stubs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/outline_ocr.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/outline_ocr.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7acbcd48513036be6786dcb2d2ec13f3bbcf8028d2c75fffa53c503b8085113"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg-native-pdf/src/converters/mod.rs: crates/xberg-native-pdf/src/converters/mod.rs changed 3 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 1 (its worst body is TableFormatConfig::default at line 39), 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(pdf): answer the integration review on ligatures, stamps and exit tests (#2687)\u201D; \u201Cfix(pdf): answer the review of the ligature glyph decode\u201D; \u201Cfix(pdf): join words that a ligature glyph split, and return ligature letters\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg-native-pdf/src/converters/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/converters/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a354319960cff6ceefaff35ad566f75b86497f89e8818a3566d49fca2d1733d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/plausibility.rs: crates/xberg/src/extractors/pdf/ocr/plausibility.rs changed 3 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 10 (its worst body is xberg::extractors::pdf::ocr::plausibility::scan_text_plausibility at line 280), 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(ocr): replace a junk invisible text layer with a confident OCR read (#2683)\u201D; \u201Cfix(ocr): route code-page mojibake read as Latin-1 to OCR\u201D; \u201Cfix(pdf): say when the text-plausibility check could not judge a page (#1710)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/plausibility.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/plausibility.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"463f71cd1f7467a1b1e480b2427c0e6a4f88c5c56eb68e9cf394e211b66843d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extractors/pdf/ocr/hidden_layer/embedded_gap.rs: crates/xberg/src/extractors/pdf/ocr/hidden_layer/embedded_gap.rs changed 3 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 13 (its worst body is xberg::extractors::pdf::ocr::hidden_layer::embedded_gap::last_opaque_panel at line 137), 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(ocr): recover embedded picture lines on any page (#2643)\u201D; \u201Cfix(ocr): verify embedded PNG predictor panels\u201D; \u201Cfix(pdf): recover text behind partial CCITT hidden layers (#2606)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extractors/pdf/ocr/hidden_layer/embedded_gap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/hidden_layer/embedded_gap.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"104ff24ac6e317497c592b2ec18ebff4c3a2840984550783106613ed1c59eb9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/processor/execution/full_scan_table.rs: crates/xberg/src/ocr/processor/execution/full_scan_table.rs changed 3 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 9 (its worst body is xberg::ocr::processor::execution::full_scan_table::build_grid at line 257), 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(ocr): recover source-proven dot-leader scan rows (#2628)\u201D; \u201Cfix(ocr): separate a merged standalone table header and record\u201D; \u201Cfix(ocr): recover certified standalone sparse table rows (#2590)\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/processor/execution/full_scan_table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/full_scan_table.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5c0493ae40a09c70bee3f00479af24a0aa3e0013b155b15bd5cc94c6480e18"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/image/text_height.rs: crates/xberg/src/image/text_height.rs changed 3 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 8 (its worst body is xberg::image::text_height::median_glyph_height at line 34), 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(ocr): fit unknown-DPI PNG and TIFF scans to workspace (#2561)\u201D; \u201Cfix(ocr): recover oversized JPEG scans within image budgets\u201D; \u201Cfix(test): satisfy clippy 1.99 lints in the footnote, resample and dictionary tests\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/image/text_height.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/image/text_height.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8aabad58b43175befd735c63d37fffa55784f1e29623915a19c822068439f22"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: plugin/.ai-rulez/hermes/index.py: plugin/.ai-rulez/hermes/index.py changed 3 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 9 (its worst body is index.call_tool at line 45), 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(ci): align Python checks with the 3.11 baseline (#2404)\u201D; \u201Cchore: integrate fixes and dependency upgrades for 1.3.11\u201D; \u201Cfix(plugins): return supported Hermes tool results\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- plugin/.ai-rulez/hermes/index.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin/.ai-rulez/hermes/index.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1a8d57d702c36f54144bd7cd8ef557ff8d40e032cff91ea1254a98267bde3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/plugins/processor/mod.rs: crates/xberg/src/plugins/processor/mod.rs changed 3 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 2 (its worst body is xberg::plugins::processor::register_post_processor_if_absent at line 49), 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(markdown): emit standard superscript and underline markup (#2360)\u201D; \u201Cfix: guard processor snapshot lifecycle\u201D; \u201Cfix: stabilize extraction lifecycle and contracts\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/plugins/processor/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/plugins/processor/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c84cf5a6a6dc78fb5f0ff164a115382519a41351fc7cb64e2f5716afd80d43"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/layout_assembly.rs: crates/xberg/src/ocr/layout_assembly.rs changed 3 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 10 (its worst body is xberg::ocr::layout_assembly::build_markdown_table at line 270), 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(tables): retain OCR headers and cell geometry through output\u201D; \u201Cfix(ocr): stop publishing a table whose OCR text was all filtered out\u201D; \u201Cfix(ocr): emit text from a table region that cannot be recognised\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/layout_assembly.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/layout_assembly.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"324870c4105e425082259d83fafaa5b6cc8a90f27eec2226873dffec67553e93"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/docx/math/elements.rs: crates/xberg/src/extraction/docx/math/elements.rs changed 3 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 xberg::extraction::docx::math::elements::collect_delim_pr at line 282), 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(office): preserve equations and surrounding text\u201D; \u201Cfix(docx, odt): four fixes to equation handling in office documents (#2241)\u201D; \u201Cchore: integrate fixes and dependency upgrades for 1.3.11\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/docx/math/elements.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/elements.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dc36b1c63e3fdbf85d6cd07ccaaa3d17802cfb57e7a88048b8b57c98555fbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/docx/math/mod.rs: crates/xberg/src/extraction/docx/math/mod.rs changed 3 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 5 (its worst body is xberg::extraction::docx::math::collect_and_convert_omath_para at line 100), 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(office): preserve equations and surrounding text\u201D; \u201Cfix(docx, odt): four fixes to equation handling in office documents (#2241)\u201D; \u201Cchore: integrate fixes and dependency upgrades for 1.3.11\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/docx/math/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd1e86215f31b8522438e598d8a9aedb311e2ed19439805ed9479e3e892380d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/docx/math/render.rs: crates/xberg/src/extraction/docx/math/render.rs changed 3 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 13 (its worst body is xberg::extraction::docx::math::render::delim_chr_to_latex at line 325), 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(office): preserve equations and surrounding text\u201D; \u201Cfix(docx, odt): four fixes to equation handling in office documents (#2241)\u201D; \u201Cchore: integrate fixes and dependency upgrades for 1.3.11\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/docx/math/render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/docx/math/render.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b449087d53c3101d37c4662f18d55427c3c53ba37b878fd5f845968267c41b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/extraction/archive/zip.rs: crates/xberg/src/extraction/archive/zip.rs changed 3 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 9 (its worst body is xberg::extraction::archive::zip::extract_zip_text_content at line 99), 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(archive): extract readable members from encrypted ZIPs\u201D; \u201Cfix: resolve extraction regressions for 1.3.8\u201D; \u201Cfix(archive): bound ZIP and TAR member reads, not just their estimates\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/extraction/archive/zip.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/zip.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bc7e00afc3a57c367f45ccfa4a48b38d1eb72990267eb06ba585d4b7c43e14"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/ocr/table/shading_marks.rs: crates/xberg/src/ocr/table/shading_marks.rs changed 3 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 4 (its worst body is xberg::ocr::table::shading_marks::is_shading_mark at line 47), 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(tables): fold a right-aligned value column split by digit drift\u201D; \u201Cfix(ocr): keep a stretched edge-row word inside its table box\u201D; \u201Cfix(ocr): keep a table word that holds a letter, digit or symbol\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/ocr/table/shading_marks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/table/shading_marks.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80f1b50da0ba186c828bc83ddea2fc58fea50c5086699280f71521bda79fdd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/types/djot.rs: crates/xberg/src/types/djot.rs changed 3 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 2 (its worst body is DjotAttributeGroup::deserialize at line 32), 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(api): drop the null union from omitted optional references\u201D; \u201Cfix(types): serialize named structs as JSON objects, not tuples\u201D; \u201Cfix: complete v1.1.0 release repairs\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/types/djot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/types/djot.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe00c2610420fc9f1ec05bd8ebfcff10263194e9eecc78d2937a90d60a8b4e29"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/xberg/src/core/config/reranker.rs: crates/xberg/src/core/config/reranker.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is RerankerHead::try_from at line 146), 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(config): reject unknown nested fields\u201D; \u201Cfix: complete v1.1.0 release repairs\u201D; \u201Cfix(config): delegate enum-variant defaults so codegen can read them\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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 15:02:48 \u002B01:00\u0027 --until=\u00272026-11-14 15:02:48 \u002B01:00\u0027 --full-history --no-merges -- crates/xberg/src/core/config/reranker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/config/reranker.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b24c78d3610d2c4dd3be8eadc21da1bd35f0307c6cc2ca9bdfba20344d4e33"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: NU5128 \u2014 this warning is switched off for the WHOLE project, including builds years from now. It is raised by the build itself \u2014 the packaging, restore or SDK step \u2014 about the project as a whole, not by the compiler or an analyzer at a line of code, so there is no call site to narrow it to and no per-site directive that could carry a reason: this element is the only place the decision can be recorded. Say WHY here, in a comment on the entry, or fix what the rule is reporting and drop the code from the list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/Xberg.Runtime/Xberg.Runtime.csproj"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f215c2583b8d2c66d23fc252b9cda858183e133819846c3808c642cc18049c54"}},{"ruleId":"D20","level":"note","message":{"text":"ADR considers only one option: \u0060adrs/0000-record-architecture-decisions.md:18\u0060 lists one option, \u0022A repository log of MADR records in \u0060adrs/\u0060, checked by adrlint, as org ADR-0...\u0022, so the record shows no choice being made. List the alternatives that were rejected and why, or remove the section."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adrs/0000-record-architecture-decisions.md"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"841e150408288e3de540e664f412fc7e097acd891f784a1d49fdaaf1b1de4f14"}},{"ruleId":"D20","level":"note","message":{"text":"ADR considers only one option: \u0060adrs/0001-synchronous-extraction-paths-on-wasm.md:16\u0060 lists one option, \u0022Make Tokio an optional dependency behind a default \u0060tokio-runtime\u0060 feature, k...\u0022, so the record shows no choice being made. List the alternatives that were rejected and why, or remove the section."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adrs/0001-synchronous-extraction-paths-on-wasm.md"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfdf9901fbf58d5a30be59080bc4cd25a8764954b6cad8bdcfbb48c60b7f32f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060Xberg\u0060 overshoots its size bounds (42551 LoC, 437 public types across 1 namespaces). 1 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Size alone is no reason to split a project: where its type references show a separable part, a Split row names it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/Xberg/Xberg.csproj"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b87baee2075f12d1fa6d55071ba2601717afb465aee1225752a81459a2f6165"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d3d1dd4f7f909b0dd25d4fc295db6c378a9ef2e272b2d45c3050913aa245d99"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13a0655664144d4d3bc27940ee626f96cb9538fa2df08b54705c89bc7a3b77eb"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87349eb8dba823824737b62df1596f4b5a2cc310640375b34e24ae12d857c18c"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75fed38557f5a7bba7d22309c5250a8b39b080646c5108ac8e217bb71b197755"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3b726b29a9372477a9bbc0100a480ddfdb17ef21eecb01a6e985bdc3a72399c"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f68cd54a5e6c91b965a17ebbdf783324056d2ddeaf5015a2d8dbcba19f9eeea"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcf8a9ea99c3efc9f4ac5284ae11cef0c163b6a50f0c2e68a4a9511dcfef1f4e"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4654d515d1c7b323dc92e8a753e50774e35043147ef6dc528dd729aaddbce3ea"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1938a33934da28908d2457d5fa46db9d3b407e9d0bf2610a787a1bca64fa241"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"750fda58f1294bef983a0421483c54919dc0b123a383ae90d6d96a7016c890a0"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"add7ba67afa1d1c25d09c328d4aeb1d11ce8769d02a2c099a510bf4aefe77693"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"397bc2515f335cee5d65d3a22a99e86ff54ba663d5308ba9e277cab7308ef1ee"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c79c1c2ace418be3bac308b3bce2f409570767cdaa557407ad3fc4b0b743a15"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abe7b58d23f128403c16552435d13f6c3e22ca9f973d317dba01ed9ec50715e4"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5988d687aaf6cbdd33cfea43af713cd60829a14bc31aba4ffdbd8c722e78de0e"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ee1560430dbd10ec638c995ff81208cf5d24c20c7da556cd4b02cf1f4e33c68"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99be45001a2d82779a58aee63b886b725216224e0b07ff1d40f046b95e3630e4"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed85685cc8f1d5e06b5caa69b023561a1b98d3c7c36f74acc0f43377f13c2e13"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20404ebda80516a0630e164c9a30b020a7295d7ea2f5623b7e0ad727d084962f"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7120a9e9865cca37b0d3a57f9ca39e14c17cd38b7bf71c9814976119b250d76c"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bfec1e2496da895bf75e2ad7b09254a7040b29f5dedc1558ed2b3bd39c2524a"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5903177183f01f8ad3aac9bc82d95a790d7b2c2b8c1d040da73b61827e7a38a8"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11b51284031ef35212c374c3bf617c7f3cce038997116c391d188f360e71882e"},"properties":{"commitSha":"f9c71090c76bf9b3c8b3c5b374bc07252b841324"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1a4174df42859488de42bde01be5453fd897a1daf6b6f18dd607c3318f2c2b7"},"properties":{"commitSha":"1bf2a1a56b107c64332f620ef61f6b1b95f8272c"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec2f1d24c0ee4596137e96024359a550ec00f7efbf4541239225451b90285e26"},"properties":{"commitSha":"7b764bedba75a5f49c605d73807329af7c1608ef"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05517fe278123a831dfbbe4cf713a9852d637f4538702b43846b3d0706c35257"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c751c6ea7cff8ae24e4a97038fe49b89a67f3f55cdaa64b95a783f0e38cd94b"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31295c7dbe4241e3d63aade2f90bcba37c1e6e0794d3273383e9a1c7c342f227"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72de5d348f1a09c1c95a41b4fa3519bd1a81fc1bcfb7b966900369f19c5364db"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e7ac248b4136f4e6db3ccef30dc4fd9a8f94236bcf3402c675f45abddb9abe7"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3dbeca0cfe9988b2613ecfcf1f828d21f7db709850e8e7b16167a03224cbe62"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a10d9210733fab9ab75b9888b9085dd686a216f8fd8add34f294e4be5807ec2"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96afc51f6d65f27adc4f7a31023473b35c66269de1507da8af09530f516cd1da"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44bb3cf7cf5ec5e1fe85e3ebd353d1250d25aa714880e914cbcce0e7c150d636"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24a4c32f6bab718adeedb487f5bad37c9cc7994af289dd277b4f47f3a0284282"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"530da2b9a8b32e435b7cc16b4419a4adc0cb9de13675548876a497b17fc0b0fa"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96a8f3409399aacf5abac5b2ec9ddfa4d2f2bb18d2360061b4a8d63531011d28"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e77998280a90c7dff6298045c41924a0100f2879672f9abdcc2bbcbedcee0b8b"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc000264d19a64b9a996d5801468ed203dd7d3403fee3f06f5590180a84e9270"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5684820590e3e9373cd758e9aa564ec2bfaa49828aca635f38a1b958243d4403"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ee1e5bb847bdbe1c64263ccde10db371a5e2fab076a3609c5a1e4e7dcd02a36"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"943435728cbbb4515d8fc4aee7355264b7545adac7b7ed1a6f8ad8672a424e2d"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfefaa1c6ae9fc171285f34352c56b0c942f43f0c37a51afa3970b5fdc9d6a7b"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dc009e21a620ea81f1c60504351b167b2650fda9394910d233129d5289f5f6b"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"905df8bc82daaeea120a531d09cab2df8ae8780f8b1dfab4d542ce157b3abb38"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"952c00b07dbe7e3d388b5b424ce1290c152d05debdbfd60cf7fd843e104dd86b"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0ece7adffcb3ed6db00c07c1ab2818890e42e81129fb9052027d2e273550413"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f823ea0dfbc581842f7ee292ef71991dc6ffad7aeb232df14f9ebfd481e15234"},"properties":{"commitSha":"328c40e35ef62279795ad1ab07987fa469ccc7e8"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11b0b2cd6959f2e79775959a7273ae009237d1ce2f060f4534686223f38292b2"},"properties":{"commitSha":"eecd8b942b3b686b88259f99c8e2267a14d9a5db"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee7f78ebf2754b1109612ab4e23bd271e38dd128ed19380406e2d9b5b9a5e964"},"properties":{"commitSha":"53f20a5f3a56943dcaec08378b38874c1de98eca"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ef0aea2967dab21e423a2bc505bb6dd6eb6e0562fa54c73897f91f53ccf18ca"},"properties":{"commitSha":"67a59a2ca6e01522dad7e7e5718d6259bdbd3f85"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a700daf089742bdd9d1ff573e23565a90a02c06e495b0dabf66435b16b543490"},"properties":{"commitSha":"3d3cf0ad3ee5bf97b47d0a86d4df2fe6793f9fa6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd9514e28fbb2f94d17bcd1247c69a1eebfdfad8bd834b85d52abe51d9577357"},"properties":{"commitSha":"a88ca49ce5a7950bcfcf6b188e0be7a6540e0159"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f532d546656a645d8a55313add25f89d426351daa8574ca08333c7b73c75cb14"},"properties":{"commitSha":"9e783b438df72e65cdfd69874d9bdc8296e1150a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"801e3d420901e6e7b4e3c6540d5ee9ed62bb62804cc6feaf7072ec7b5989a91b"},"properties":{"commitSha":"175f5313f8525e6cb354c3083e6887bdb9f2a5bf"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ce80830b9351482f014e533a2090c64eaa05b854ff8bcff527d16faf39c7c0b"},"properties":{"commitSha":"f850c7111550c25c15a1be62374fd8b57588affc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74d192f0e6da6f4b616aa222fc45cd892fe720ddeced912e58632c10e483d79a"},"properties":{"commitSha":"84502f2ca224f734150e937f428f243c893e42ec"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abb7d85a010f1e3bf767ad95ee8fa65ff9009d2710fa76a40be720cc851f4536"},"properties":{"commitSha":"b59f29576953ad8ba45f6f7eb19d7c19a1bbf9c4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5db5fefa4df41d866ba7cb8729f2184713ceedc298f570a44dff5158dd9751e"},"properties":{"commitSha":"16f0da145a547465da4f649fa2e5fb46f82c7bb7"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9178cebaea443c517ee023796cc4704747124815066671c34c14a37b778e347b"},"properties":{"commitSha":"8e3cacb081235005e5c8f97342be913ca8bcd7d6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fca2c6fb6473392eb8cdab4802e8804518478005822662f08da46c670228053d"},"properties":{"commitSha":"5da34e5e0cedc5ff5d79fa5a9927c52517986624"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49bdb8811b4a7055d609d549898d6bc235d30138dd9312e2fabf462981cc1a2c"},"properties":{"commitSha":"cee9a0d9ce3fbbaea66ae74eebcaecdd064fbe4f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e69dea018d8693f4134b178bb53d64bdee684939a77ed43559668f6a7378227"},"properties":{"commitSha":"53f20a5f3a56943dcaec08378b38874c1de98eca"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55ddbc2f0e58e7a9fef3dbdf5c2069e8e4fb91b8081a6a7a46ab0dadf84bc91a"},"properties":{"commitSha":"67a59a2ca6e01522dad7e7e5718d6259bdbd3f85"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8ceac8bcf6baa779bbb218b3c2feb5f07d0f6b0cefaf5afa0fde69eba063f7f"},"properties":{"commitSha":"3d3cf0ad3ee5bf97b47d0a86d4df2fe6793f9fa6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ec4205f5dff914d807cbad9aab7f5fb906dac5c97318e09cea17cf6077149cd0"},"properties":{"commitSha":"a88ca49ce5a7950bcfcf6b188e0be7a6540e0159"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d3bfcd4f2c12dbdac6f19c137b64a5a50cd4ed178edc807be6908c3267866c3"},"properties":{"commitSha":"9e783b438df72e65cdfd69874d9bdc8296e1150a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22971b1dbcdd220eeaabe0a0d9449802d9b12b5ce4066403f1dfc3f37cdda29b"},"properties":{"commitSha":"175f5313f8525e6cb354c3083e6887bdb9f2a5bf"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"604ab9a0baa1f7fc8267e135733d41b3f26a21669d2e16d83ef5ebfd720fc4cc"},"properties":{"commitSha":"f850c7111550c25c15a1be62374fd8b57588affc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a19970475107c54dd6779564c5f4592474244ae0c1f00030724d1ae62535364"},"properties":{"commitSha":"84502f2ca224f734150e937f428f243c893e42ec"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"890b06fcdbf01e59eeedc5be365d8850257e3443699884de36b8c0c10113c846"},"properties":{"commitSha":"b59f29576953ad8ba45f6f7eb19d7c19a1bbf9c4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c982bcc74c008ab8ca33345db44ccd3b1118b8779fb91b74444e83613520565"},"properties":{"commitSha":"16f0da145a547465da4f649fa2e5fb46f82c7bb7"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f61448e9d3b2be697253068cb48f046a54d6be2b542b63c85d0a41b15bd2e082"},"properties":{"commitSha":"8e3cacb081235005e5c8f97342be913ca8bcd7d6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e4710e46a94e1a03166837af1ef3bac850c745d03bc3f7121ab8eb44fc6775c"},"properties":{"commitSha":"5da34e5e0cedc5ff5d79fa5a9927c52517986624"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03c7bbbda7cc3987ebe6c5b9b3a4769d2c00094b025794833ed86d1f8de94e63"},"properties":{"commitSha":"cee9a0d9ce3fbbaea66ae74eebcaecdd064fbe4f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"923b0a625427eae67fecf94b7d6dcae3d5d214f53be3da70b8b8f69e7b7c65bf"},"properties":{"commitSha":"53f20a5f3a56943dcaec08378b38874c1de98eca"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b76f2566f9b1b5d62ec1c1d11270c052e1f11d6593e28d62ace1df166c84f2f"},"properties":{"commitSha":"67a59a2ca6e01522dad7e7e5718d6259bdbd3f85"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b37c84a0669500906bba3ab82182a5180a9ad52b0edb30f5f2b7d2ef29aaad1"},"properties":{"commitSha":"3d3cf0ad3ee5bf97b47d0a86d4df2fe6793f9fa6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a99a1b17a43d4e5c89fd94828fbe06c2d388a0d2d4ff79307dce31b153956998"},"properties":{"commitSha":"a88ca49ce5a7950bcfcf6b188e0be7a6540e0159"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"16bb9c7e9b274d0d85a31671a9a49ea64b899925b95d5b1b561b464800a3a8dd"},"properties":{"commitSha":"9e783b438df72e65cdfd69874d9bdc8296e1150a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e559151dd18a2b3c6690990cd45d8fabce30d74ea46630cbf8d651bf0f34478f"},"properties":{"commitSha":"175f5313f8525e6cb354c3083e6887bdb9f2a5bf"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ddbeff12e6145dd516932fd83868a8b0170c53b980e8d6fe74c31d6b42349d9"},"properties":{"commitSha":"f850c7111550c25c15a1be62374fd8b57588affc"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4add1ce5a287f46442c7921f8d184396960e8d8667220552c183f466b7e3b632"},"properties":{"commitSha":"84502f2ca224f734150e937f428f243c893e42ec"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4531a8742755196f1c940074080d92fc635e7fb9034eca3c06289b26b576d18e"},"properties":{"commitSha":"b59f29576953ad8ba45f6f7eb19d7c19a1bbf9c4"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9f420b6ea80a81139154ec89b9c501a5838f793de852b76a5dbd24fee0964621"},"properties":{"commitSha":"16f0da145a547465da4f649fa2e5fb46f82c7bb7"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6d3c04486194e0b41198d8e9c071168288ccca926264dbf6cf475111a945bd"},"properties":{"commitSha":"8e3cacb081235005e5c8f97342be913ca8bcd7d6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34cd5ec769c2df25ed3c99a24defb202f015277229cafcbe00dbcf7564447caa"},"properties":{"commitSha":"5da34e5e0cedc5ff5d79fa5a9927c52517986624"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9b65ed693988c571fe71f48f37660d3f30ad5ae94d69facb0f62c31ab722ac2"},"properties":{"commitSha":"cee9a0d9ce3fbbaea66ae74eebcaecdd064fbe4f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"579c079cfdefcf7edb4c04a5690691052da3b941b1e50ac126f339165fe678b4"},"properties":{"commitSha":"1795cf64088a2a16c03a596a87cf2dccc3ce0d64"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94ce6d06f8ed511f01d87e8baee38f671003ab8551c051c9fae8edff6c9e1086"},"properties":{"commitSha":"1795cf64088a2a16c03a596a87cf2dccc3ce0d64"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d5da7870389369e48a5fc16fa5dc179b84c8993b23f5dd4dbc56e76e1bfe140"},"properties":{"commitSha":"1795cf64088a2a16c03a596a87cf2dccc3ce0d64"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33aa4f88521867b1fff819a3793d874d5c161dba21b70eed1d7f6b2c90da5126"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7299460716d4ff4256a2e0bc073e42ae51d8a504dc02b0f379d2b344d172ff24"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7efb27d60c00493101585182d61712293e3ee785de3ef442ac2d028f1cafd2b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5506b53eda7d4cc9bac1c385c91cb0ae276bdb184651bca121d436e59ec3e254"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0be0ced210cfa92adb6ed1a75ddc750210cd146411a7b2d5ddb528d7a16c3359"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3545de0560e27b39870b2b3cb5596044b8a31ae541442979a4bc10a9abc44b04"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96bd8f85ec55ad9592f08a2ce0cba1a60653198189e742e12bd2b57e7a6ec40d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"adee96c53dc1ba51befbf752e88966ebfb5f7173f10e70ff6e6a1f02bfb35827"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e471477c98862a8f3a2665e60451c2d86131a88a3ec90cbffae648dda8e23b2c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af02c6b1cd1ffa4ff5b34f9b7a12ebb35a9eccd825d123096b66a53b3871f7d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6bacc03005aa3b1f7572832477eb4a3d670a165adab8db98c1585386ea7001c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5201a43fd634938547d85c0e2c87502aba379caa974a694d07cd9b0fa4528db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c28066ec6ab0bf4dc33afa4c8f313bebc95ac408ded7783521f1306100976898"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da7d9349f54ffabb87da50fa11f50718483cc7d0fed3fb1336a41bee0e14214e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1264c192ce560098ea5e66a738ff3248ee81875dcf3a2e5b798af19d56bd15ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"49961273cef8cee0a188b8ff15e50845cba967fd44be834a1a3067fc704eefc8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4857b523acd24e11cc478ba5e631ff5501040f7aac9bf80a4b141ebc9ddbd7f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c887ff883d03fcfa6b77e8293138d0e27bd4d6098086753b34fa01f4cb78ed7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffe08bc3ef452e0bb32da61096aab57b655c6eb139ba830c0d0afce23f182709"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa0a289c837def23de51b668e3c58515cf26826af00ba7563dab15dbd193f450"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c956588b8ad2d50047bd60c42188143099045c11da2b9b803d0290a4a49aeea"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"054b4c75566aa81c60b24a2f4bf93c0a480a7dafca85634baf0983ee546ca717"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8561e6ec7db829226971b9d142e0e2e1d47ccbdb7c5cc02c523d39c9c16d009c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c44a61c56b8e23bd910f44dc47aeee1abf8effe9565a70f752d13bf24261979"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06a9f07aab32f2eb7a1233ea7dccd6bfa4196d9a59acf4b8fc153f57b29687f0"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43d343ab53bd2c1d2f7d96a416ef70ff7067ffc2a2fd1f01d1414359b50d1526"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c947aefb2dcbbe6e195124d318b87b0da966c2d625aacaf44cf8061a91a88e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b725402bb39bf59462a42bec749927ea92405f31e0a562ca9df747525f3c8a8a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be62e159da10b5064fa11e7a8e938acfce608db9cedf400e94e3d405059112ea"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5705e34db1d651f1b18bd7e092141cc92c46a30fd325a3b6b3b6d410e3b8fcf"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff64d71bf1a036e5706d90ef57f085813c48e9f8087d6e033588e09dd4f2c3b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"725c5fc38bd9b35a8c67e278e78db16d1faeab96acca01303f403bc80422dd57"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39a56c68ea85f1a6e04565eb0ad21a6131cd2aa443f6d394582f40d6ec3eac16"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fd8bd2e64b9b19e3799cd8a42192e07b58b6ec3bcb84da54f7e29e77d70cefd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c543a9488222824337ec4415cd9d062b02b5c511e7a1ee36ae5a4a05e073b7d3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9dd39afd54c5cba5323279a50b6cab6e9169eb93612b83c01ce10dd33501ebe6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa13f1fcb34996563631834d33c39f91d5de0ff96091b093ed60304341f3e0ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4306c07bc9db0191e0ef3a2233366d3c170e31e5a9a9b96b3d84972a3acf871d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b2686bd96197c95ad2cc74b584a65c7e82db6cd27fa1569f270c19b5f7b8304"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1429c987bae6e6f795d50a7b35563c3c24feafce0f0c1dad5f94adeed17e8427"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f8aed8600acb09aa6868039756128463ea13d536d3c9acddfd23a1bc73df82d"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d6aae1d9d92f4d430a969273b911a9ff25c6fb117bd79e135425427c038dc96"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be43e97b17fbeffc17615e1449cc5282bdc1c5766fa7cf8f86a4bed2a25f1111"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e86ac553162b8d0579e9b83e60562278b088c56ac47d43d32f9a68a746336ffa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32695a5fcd4d87dccf6ba45d28e121526d743b23edc3b93a363214ed0ea10016"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d2bc615861b4fcc184bba0cce2b3dc0650b37fca79e963a707f6d2148e70b86"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3077ca7ef95163b7a42581852ed443763ce1f983eeca60f7c38e143f973f10e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfed59d693496ccbc6155f6d10c859e83ea4b6bddd8fbfc511ea7e6596d71311"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cee304863b0b7b526731d26358f435c91bfd21728ce407b2537df857e9a65dff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b5b6d0cce24c313875b6c6b86bdf32127f33e768ec330e5f0282bd0ed62081b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"386cad8e9429cf3208ef6de49c61464931b4be03c9d4c6e8d1d7f7aa4281508a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad3775c3f9651603f85bf042bf4569af6e0e3c7243e9dcbb99cc1b55271634ba"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f0c81a0170a3b47c190da320407fd45238c3333af495028d1566e487869c38a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f180a872d7413bc039497bad0dc84a952d0f5b5b27fcedf24c09931e4b9c927"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a954f829974c27257a4bb200a391c1cc29e129fad6ef12e4a310fe0d3d861ec8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47c797f980b8f27921402a007aa87c789d0be7bfc2b64a732bed5628daeb4947"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72be3d896c599c6ec3993e49b6ec0ed708d47ab26b58a4bd06f02cc13ce7fb92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ce8d50318329e64580f0b97905cc5de6cac67d356a43562711c6668a45c4164"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e30c9bfcb08774090970524185900303000ce21addcf7e99040c957c6d6c500"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40300b34239a9544d3e028a04eb55f1b1a3572aa305b85570327fdd1b79e2a4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d81c3a439e5e8bcd845ae5882f6dbef4561c0dc73d1d4fdf5fa8b4b5fbead37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e11dad2787367f7e20f644a676530565d1bb50f7251c5f005de76eadc68974f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d61b1de48f74633a7eea3e28acf71d0a5e729278aabe8038c1d9d814e2c300c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"808934773b3957b62169e209b9c23c9ed5eece0cd1edff67b3dd1d957a869607"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"944e2a8ce389c2340f17b84fc3ccd3e2195bc5e5d6a2af428558562544b93175"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f53cf0b0a946dc671c8b613d4f1d26599b4ad9d77c441872eca656567ab7e59a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4cf17b856feab8368da7ce48f188619e43978694885a8fc3f5ffb8c846be31dc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2255d5f38e1cacc6c548b4e89e0ae6f1e3e7c8d39364a64f0496414aae3d5219"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cc8aaeb42ccec6d0de82f0f8e67712b42d5e79b1304dd75b513ebdebae1e5b4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27d02b85ae31a2227fdc5353d7967645559706d720ca24a2caeca4228da747ca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b073ffd46d0112451f601d74a273bc100aea2e466121482868318c688f2cacc7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e319fc1bc5a4e693b93d35f602b7e70fe5131a1ee8ef4f047ac2fd435e90201a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2780c5c873999db2b563788dfc09220fed97cf5281a52f572772bbf853f084ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62db9b98510c6f403b6180198b91c129eb991f2c62cb167c85c7b212c61e8887"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd4e9c4e7d2b07b5f68a2d1a11786cc480f4086336bd21885b4a5d0d6c23d784"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0bd76afa256b71c958ce8a6e8ee7752916c2db1b5782b55469ac162722d076b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c2b9719e37ab198c07f11cec2d2b00228f6bd489a2ba84bc04a9a5bc3026ce5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a98589f5d9009abfec8527b555fcf4968b32dc29e923d45dc5aaaa58b70c03db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"475a473564f7ea316f78d27132cc35087929697a4285ff8b1344463765ef57c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"077db6a523669d6d7ed447dd6ddbcf114a982ac50af075b1585fae99e9169fed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37ceffb3fa0f54e2dc7a55a4a4f2fb70585e92c439a45dd66a78fafd2b5e3778"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6be9b6ae528a9330a1c3973e6c2b3251117f6866ede3ee7553a631a1d4d994b4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bcc222ce23db5ca90b18e0f855b8acd2654c8230d0a223a97bccb07be7664259"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e2f4071de87b438a72dc180f74250d41e058ca665297077a09d64281b73bb83"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8880700ff52dd088476f273f5729c537520e80dfb536e45db1e4dca8ecfe0be6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbfcdf88ac7d3e3a47a61cbc491027b133a67a4012da4d3c6a1c6830b45d9fd7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6edf334a348e85ec781240395b3275bc91d807fcd72a73cb703a9dcfc2761ba3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7db0e87b2b694cedde6f52bb829972751f6ad97c2cc6790572f32afaec7aa07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"efbc175f920ab4a0da5ff48af47bae51aa523ad11b5c807bc70430b07b0f0549"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a824b8764737c9399168f934f54537434aa32f65a8d5b7893c4600b4befd929e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b60775b648e51abc56e658b901f6d869ccdfb3786e51962d7e8268bdba62f808"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b67301d243a22ea15b85bcc0929aefa00efb02067faa3e68d7245318edf9530a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36272df492e84d8456ff6f443e6ffd8d9a182e59234102def4f767396b1a64da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dfc3380cf4e3e8e8196a0e8977defd1a9bf61a697df013c7b97a7357d0602290"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58ecf494363c1a66abc74494c93b5f1ac0e53679b2fc7c5636a1b4d5cf39c8d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b615ff30f6daefe8ec684695b1780dadbcb8f4e283c59c03496923f4ddc5524"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0b278d4a7823bd164d735858e61e4df4ff0cb4b3d0b36edaea37b803937755a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a76db5422aa5ddce4b5b2e5e568030b4ab2448f9d3721459c219f5e740fec2ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef6cf932a15a9e46614b08b84efc266f5bd92b68182c1f85921dad295bb9af0e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ab5b96411d18f7dc7c1f2eaf06bb1c1c08bbffbfec60fe45e63e65b8b343859"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a8d559d771c5f4c8a95e672ce029ec11cbf46634118f4b7d041f2808f9e4de9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17751a7dce3c833b9c9cc910fcb5074fd0833a536a74a251177b8367282a88f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01fe3a76a57ea0996add535e920cd2856da438d823c843c85cb8a395ea30e682"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"379b54e5dd6dfe235d430e5e342a7e23bcdcd126c23881539cd536ffca48fcd8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4feff5c7808d65b74e0111ae667359bd1b547a4e3e15b7925a7d93b6d09c40a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"25a8a0a883445a0d992d547b514e04dd27abdbb056d2ffd9d0385513cd272fbe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5d76a08ca64c935bec380db2f8bfdc463e9b7deb4fa4b12dd63f031ddecd753"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7124bb0a42efd3ca8770dd177ebed23afc3b00a72712c7dcbeb20d48a8df9a7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f70b07fa6c517bfb99396ac14d8d4864927a72d5efef31fb565ad87334c0182b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"591a78521f8ef768e10ba616d7fd0a6d2e65f9b4b24e17f807f6b77ba797ac15"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"696316c195891ba4469e58871eb26a343dabcb1baf2020ce43334540db7529a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"926353a3aa65287858cf3ec6ab1a4286326315b0065ba9011383e20b462bdd90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"745f4dbc5bf92e32440b178d5c624f58e79c3620f4c82e44d3f31075107057bb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a056d5f994fb4509c21d333af0379b14170bfbb434b047d43f5f591d6b99a428"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4864f20ac51125628453ce7fcbdbeb6daf1cd6e3c44e438a792c1a879f44fc76"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87c184d75a390ee302577df99b7e23971f7c383b79370fc1011d0a851abfaf4a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c3444a0686f885ac5fd5b78430919dc3849277d3a00f56e5736d119dede79ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbbd3b25c00c7ee5a3ebdb0870daf758740c6c971955f8a282f12c2fa5e21a11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5fad9b918f447046537d41b24372799acf8286de3e5505fa4bb05178ca44d7bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00f38d31a176b1f2569a6a05113021a0ae0bd77ff7c819928062307e13f959f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24f666a72e7db24fb349bbc7fd82237478a7feddd2913ba436b5fae06b8e0fc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7db5e70475dcde498ff61ff956e40a649de00292f3b6d9016acfc9801a6c8c56"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"870b4714fa4361a7d71c3b2ec9e03a992515b3355fba59fd77f3725d5141f8b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"309960a3f8ee6af0ca6ecc97bdecffff051d2785e3dbbb1c43e53714f98e10f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d82ab2dda310bdcafd17f262f5f9b97fe6f53687215729ffc5c7cf59b5b5a38d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b087f8e710d7c9ddf0fb698873b10870199471f07e5dc03c5dfcc9f58e3cf4f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e61c58dd230efe0fb4151af01aac47faf388440bf48987ac2031bec3eb7de8e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f12ac6c10ce02a6c8680a12516c775709b38bea9b7e31e77ab13d39c918f780"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f9f11b69c1f4388182f06e0d26ce7969321831b58739345b6ec98ad59f2bed2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"618faae41a40a599781f63e82b2776c8db98d9a49e42975847fec8291c0f1580"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"132ddae7ad76b94d75d4fc1164b23b3037a52713924653de9b4d95d91082bc0a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5518e0e6418ad881ab6ed57dde4f3aab7524fba839e9457af37f7cab5005affc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf9907fc946b7d3d517f1530fab15d1d4a876ee64c63024940cf601ce0917042"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3fd4e89144f3d05f1c1f0da8c6ab737876a5c56633249cd0acd7a8c436e864f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcd7d4baeea9db931e57f4af8d20636205fefa8a1f74fda6f9667a199973dc6c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0bbed6bdf3bfb3594ba5ed02b43988a71ca043e38b26453c30748e82ebd4bf1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff8d6486ee6c15c1bfb8575254cdb13440d85d0b2170601055e178a65db33b5a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac03c8697ffce933feb351d93fb08cba88a6b901e9cf9f90ccda0db750bd6840"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48cb3ae012dc8eb90a610d8c05023bbf915a61e4003be953d15032a75849020a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2ca1073e842221ec0937ea459a5d92cef23edc269b394a3aec4c463a5b00e1d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"468c1b1b62ba3151f4100d6d02da34c99d9c45e2e500489a81c9248a7664ad44"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7153559d63bca3d9e11b29bc9baf44704a86f2df9117ed4c367dd6ebf1bdb186"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3108d4994c4e44d07b5b9f9b5de40bd463b7e729d593fccaeaa0ed0952ea1886"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8324fdb909605883682764116832686c3c35191bbb60ebef825c66235fee00d0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b596678c02402acf3b7e63c7eaefb4503c20eedad9384631c1627018e912460"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0dc07df3c4321edef74ea2f258df5dcd67be98c766c2268a96e59f92e200a063"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c219c25eadcc3711db4c1f3aa9b8ba7475dd8c702f7f9e212fda62eeb716929"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b405d6159933d310b1629909b72c1993ab86245b7f747e9d7c18a0f555396bb8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6780efc9bcac07512ea56e8552d4e1768be83ceefe88e9bafde82a0a5f0b6b62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"949071299f947f9d9d2f76cc042ad82fc68a1171058c700845add9dfbd6ee959"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37baeeb0c87fe78b95c2b7a3e8f0e14fee1a4eeb59f8b152a09c7d0b82aa2b91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3252f84aa82365a9bf75184663813f08f0bade5f2f0a69170856c9b60cdaf5b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34588431acb6a62696f4af04b85e31fd733279cae88260212786811afacf9138"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c9a6bb25a1c8bd5fb677ab501eade1faedd9fa41618a8e40748096ec26324c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57c0198d2ac81b718db4a511e85338389fa74331c31547c983d5373611a1ae92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22f69bb62d55de7abdce31ec67a19d709990ce1e11816459c6beab39ff695102"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32554b6037b109739c20ab9763874a8b85df1efa9c296a7850752c94e1add120"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8991cc97e712162907f556ddef2a63f18b1595940d56c9059f4f7c145199e551"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77ac2c4315f5703ff1bcc223bd050374fb184ce27ce6c1ed959ae8873092ff28"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90263d722e5492b855d883e335f24b3036d43aaba30aeee5a51e1d7dcf49a40d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5253d96414003ecae0531a304ea73d0c43e0eb86e113011a14724c963c73cff8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba0aa629aa4ae1a4f2af8463715089df814a92c7acad2afa719808263b73b170"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"505c8837f37c067931ba66a2cdc4bc6b21b66b798f8fa2cefb3b06a155ee8a19"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c1f66f32c68e0602a4849f19cb2566b0a79d3025f328ed7b619db60601979f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"efcbe204fbe3940081a36b56e743ab838dddf4482505503cc9c33098aedc42ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab82198517343a30e9cb8c0af6e7a9c0956c59bedc27cee0267b966b86f17e38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"437c41d6ed87b82caf2cd27e089fb11319ee9107950c6e76b47a4a718928a5a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71153f6d27df553ed571372f0335c2383cd4c58d61c9ce2abe49dc65076e2755"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f88c1211087564d83cf073d6f5a1873989c0c7dff5958f1ccae7eb223fb3df49"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3410573f4444c2d2449190f20dcce754ef379f119d6c86da92c16b8cb3137f2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b76cbec1751b209fc0daed9d189b5b28e7cf672e1689fb417d6fa67647224529"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85f7db257c824fed0a5a34e106e4cfac000a9af7b71fa39ef3f4f6971d455f4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"781ea1bce1b6e81028e888b771a7c2205b67d2dfe668213c90cb777d96c7b025"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ed249fd300170fbf5e37a58d1250dc6f5d027748859b9a6e8ccf17b21fa1ed3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51c5ae32fbb06ef4c5c107591db4c2b35b7d7cb652f9d9fbe8d577d089fc7b5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"626e71e4334b04c0e9947d27693def48fec8581227d400a3a8bce756a39c5bed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e34c1eed40ef5cf7c112ce682ebec2c89eb688d5f71e09d8868f53dd917143f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d399da7667b8ecd8917ebfe123e1c9c2eecc62b0ab376382b420a7573ff3eb88"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0bab0e29ed337b23d0eeb4d33dad3b25c86dfbf9e9e576b7b14b0c8cefc0bcf0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"332739065f879c6769212eb4b1c6d18d52ab400e1e51d3a46efa3d4b8308d0be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aae13714f1aa8b9736ea9fc4672dc3b6491643ce1a892b3a244f3a0c7f851abc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc97847f8817a141b77cf67f10dc109ad428e301923986b691178e4cf4b40f3d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbd4002f06608fcdc05c8498949a3404ff8ef63d05586003b3281e975f8b84e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed06e5f53aa70470dc6ede051f9a9b98f262e0514def20cb59721473377457fe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1d588422dea54bec2e8a5dd9ef9fdb2c2905339f348377a25e234aae3a877b2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"497cdea012f3a80b83587bb29ab1065bf375135ee6f5cbb33449e41946d9e4cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9bd06052316580341e63bf886677c1e36b030e257db47895d456d025c9fd0fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e00909d849b80cad758fa4558bce5ec5bb284eb9f99b6205d47894836456e3b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2000a28d8ca853733021d9d37ea4ab627ed97edd8168cf4ea8cc0f6344e844e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d42f96bde0cf40ce9fbcaf89227490042d0382bb3c90b8b1e08782cf755a757"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0910a181e640d5d7ba61e46eaa9817815f47642541b837494075de90102f775b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88c6fceba7d884244f9b61023bdad625d2427c99d57746f1f0baac3d87844a42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"244b1d25474f254ea292b671c85191ce08b04538181fc75f8e6964026fe34460"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bdedb35c2dda91290d9bd2fbab211dc10837af1ce1a3f0efc48ad12fb366396"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d5417abf7a314a3f90f029f0f6fade2578526f402598f8fec7a52c603b2f59f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29b3e6afbf3a4df8102ed9c93e5e6109f875e3eeb0968ac67072570e01b4bd06"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29e8a6f16c09d4dbff8859cc4c3747c59f4b176f1ff3c91252cd8f941780fc83"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32c98f9aeb6042182add1ab0d88e23ec407bb01dde0d755ce2f88ee87dac9005"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1b5a48de37af3ed8031af1f9ef55d02014bc62ad30543256c6f25a2e524803f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48c08da589559ae29db3966fac5638ce48ddb7a8ed96b41618afa06d80bbf82b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"822d37d6ab602b73afad9181b0b7aa0e77e531f98885c6208a861aa08fe5dbfb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bedc0d6d6224be05b3b4ca15dbddbc10ae3c56b17c1d4eb838bae742c2f4a07f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f777ced6b2c38a180ae0fbad8e29b04d5e9c00af081745e89b2ef1dace859b86"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a92a703b824e2a0025acdeba3de569cf46b6500d49a4f9e30e480dd8caac8537"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6e70f6e001e3aa63158f67f8d148f593cdd58c97221961423e3b6ecbe2c7f89"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9de92b95ea305deb91a9a4e68673e48ff7695f96da6f42a9cf0d6b4d25a2d204"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed87a58315f1564c33d9d7ceed6629296e01ae90ae5eb74a8bf92f80bb7b97dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b01a1cdf5badb7ec293255ddfa8ee7e4b571635423a6cc03bdb8f206c39e39ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd389ff25623cb46c5e939d109f5680bbddb0eed76890730be4c287715885fc4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13f13535719fb678babd9d8acfb8735dd22779e2924f2d587cd36e568964bc15"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce79e00e7fbcec206719b2aaf733f29b1c485e678896894c56095abfa3c6e01d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29be4c837e535900e9c87570113327ba0ad72d0b4ffd690cdbf2867bf46b0303"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c65e1e685fe1fa2cba93974db0534d6a77ed26c18de43b49f1e4e36540a9549"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97dc055a9605db398359738f5071bbdfd28f625f2f85eefbd576b49968744059"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e51e254aa7709e5d68abcddc2876b8f2cbe35f5443a7c9f606c6acbf88218fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"791f264fbc205dbbebe78d29fc388042ac117babdf4d75affb0e3916bef6c30b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08791280ef8f7c65af88ff8b0c0f48aa3a51d3f058ce3bfbf6d9495666d045c8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f62b190ab417c844c890cf18bd02f5d19040a809c526aeef87b47ba53bb0a380"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e77618ac96bdefb22bfd259bf44a89dc91a4ba82d951a35f0e8bc9d8bfca1328"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd307a7f108edd367869982d7238d0eef63e8ad45727c09626ee869fa3255203"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63f89e9793418f0f999bc6849e2b87e570c13d5ebbc10fec2197251a8d2a849e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a878afa4e02f33f9a86e68f2028a9794b50b81b4d951940c4d7404a17771d17"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"300eec3931edd1f828e7b7591621eee846326c0dff517bc9c12f75b3ff0777ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8a3e5c7ba14e6048044ca9ac4c213c25232bf0e4448ddcfd8b69857d5e714356"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86a13d98bc2e27274098b4f7d7e62ee3afe8492abe0690a111bb8ede5421900a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb0a2e4c31534b4994e01c67d659983c2c6653a86e4f252ff31d13b14f8a605f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2976eda8069c6a79adb3e1b8e2da4d524621ea562f4fa0d9c5504f875370bb9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35152b7e18e5dd87bcef004007d2c0f9f0c405fb100db9e3391f443a4d378918"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a3f999522667c0e4a8605d8c6b1e01bd2d8b24854616f75a80b6bb071d34fc7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"56186edbf5560a8fa2b63cd2ffd3b58abdcc060415900d057fd5884afd9a4252"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6cd53f7f13e8bb06529ca6154b6186a777abdfe6fcdd3de558adb8f5d834dfe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bfcdf3fe36f7dc662d9c0985406352225caf7003f4f6a911a547c62687a6d20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c02e035757bf756189acf3647c0527a7d9426949b57fef925cf9661f14cb7199"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"839423c8389b35db89d56871e9a0cf0e18cd483b60bac727c3ff708bafe4a40a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a4f5d24206f89578ae0b9efd1a6ad9ccdd2cd2bd508c44baa465929e8f4a5de"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f2fd5c961f8b920b4e319b1cbe69f294566d56ff5132389d126608a4e9d11a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9425e61d6e84a329836585606ce760f0ad0ee8adaaabe207bda3460afe70b431"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40d86a7f4453f6a1639fd9064597dec0a2a94031f7ec393cb1bdf5475531f659"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70f6d6fd861ad15648bb1c897678156a0b2aa7791a91308e4b64bf481400de9f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f43b68f8db711015da0d36161185d52d568020d45038d821ee665e633ad7cc70"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a496e54a9b3da84e3b3d122421952e4cf65a1e16858a55b4c02baf7ed696aaa2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4fc66eabd71dc9a1d2624e1277c635ede32f7e84d4b7788e008164db6e25aa3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3b358cc274ed04b0ed327f9833f3f46e7ca5d379223a1e7b748d24b90b9fa4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"186a9aa3c48b675ff57ec49bd1f57a4bb242f7c2959bbb1a627587d073860baf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"078ebe8df43d0bbe721ee26dd08dcde9c03ffee35493039233af535fd97a0ab2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c75013fc5b567da8f83d4be4f12343cccfa44a007b37d924f582fd989d9473f9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5227bd37109c96fe48ec8871c1c48d65ee50820682cccf535bd6971faaf1aa84"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60e7856728ec5d51ea96ce202bb0c0b91e8da9b3fac3289e962f7bec649db7cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de0e011e1f271adba5b96bbc401e9ff89ee5082e6ff83ee6713f7b02787200f9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45b3c6d4257b332cd55e31c2d82d7aed5530ac4f79cb8e952b0b5b9b7149670f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7e8f2308662708a5f45637194feed9cee7ff937403636e860255de8db5580e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f50ebd19e7d9ad47e1a24f45572c24238c9cf215ac88a6dd424fb76e2b6d7207"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e598db1528633a043370a46fd7c4d377334bf5a948d94dadd8cdf0e8eae65f93"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5353018d34ffe89ee8b84f62a0b716f10f662693eb1d73fe8c53bf99214f61bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c2aa95dbccf729a964f3b3fa94ecc871a2b613db7954d2f768cc215f009834d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3387eea59051dbbeee32b226f98340c409a062f4942b05d200914159f8613e2c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3366272a9d1906da0b709d8419a47038c47bb08bda625f411e20d785b04efb7f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4ea8d425833e8c000bebb05ace8f7f949eccedc10eb53e1a4956f2f61ac2084"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4562f58aa9f4d28f15605fb9f7bf9e23c79ea0e991462fdd16cd2227d1f74ae3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"286df4d3f7456ff960eaa0d8b3d345430eecccf7028c5cb9b3f4eccab6022a37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"972c00985aea4c0cf43d9fa8f6e8b944611fb501648922d6dfa1f423cccf69f4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3d89cc748b2a6e18968546e3789b4047788bc4c496d4653458c5e1f1c33ff64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddb02b312751633ac3ebcc3d86a026555d59749fa63ec0485ef4db493d5b54f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e49b5fdcccd8193961d58fe25f1b7234dddacc4fad1423316cda92ea36e5c0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db1340124c3bab940e209a382fcb3eac20a2b2dd170bb2099cada38092959b1d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7fc5f5e03c45cc8a53923fb8bdf55312261fafb2d186c83103529e6acee9636"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eda1d7ad7a54f1608c40f1e4e0056b142512b297f7cbae5829e9ac7777dcd485"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7aefbefe3f1965a575585b8cfab073587ad7f4afc9ad0e7c7773a9a416e8e5a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4a19bf20188e3cfe01a7c3047344e61110512e8f57b770a9b825c197617e3c81"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce84569b85cf91f1eb425c8edca4faa9fcae6ce581cfee9c9b46fd0de7d83124"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d68636e38d57b4992aaa194397842f13213ec34fa4ce1f06824ceda215a7826d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a783e25b53b898f09a78a2197b56774057842a6c6afe84a706437b9d5668da11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ea23acc8becb1af28163609e3ecfa7d64e912bedee19e39bb67f252463193a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6663d207e34f59cc91afe53c9bdfafdff36d3f58d4346466ee291857d89513e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3dc4880a5a0cbe9d25adf2143dcc327ac5535f4ec9f56ed91b79e94ddebff1c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bcb361b41132dd7047cf8379b7856c7970cc89318fbb865c02c5762c51351f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09c757e874ee1af19228e2bf7b73d5207b379a78497effe0fc9bfc516c96ff3c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50e6d4a2509bd2d23653263e5ade90749a7edd4d66ec9f9b761c658ecf87766f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21fc469022022377d05097402a56244b5ac7764dc7dcead7078fc3e5ecdff735"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22379f0248b3682b625a6a078484cfd1c08d5574df39b02563e64842ee8fbfe1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96e2682313920968c8937cfe17fb4dfe2656dfe7f1a992ded9e3414f36842355"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"349e460dd52d315fe1d799eeb4e9372730335a0129acb0541c9a94975c29bd74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bce1d034b066d663a55b565e8a58d496108c0f8047b8fcaf9df5e0ed4e9239c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c880d5e6616b28dcb65312da69f367080c7c8e873516d1fd115735e7f946ed6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1b508d5aed272993e47e9a0883611c88cd2d16ed9670812a63a4ea40ea24b0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88d0f6f553c50336513ce53f1b98ec88f6673dce0e7d1341501a253c1cef50a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9cc30a9fb172ffd9a3554ca13481ea461b9331e501bc072d54756219a5090fbd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"568396e2288f14d06ebc164b25d4347fb0c9ac61e1b14129ecec2822a2fe0aa1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4efe29406817fa5883f503405aabf7038c71a64b0df147410e6ce6aa60a712c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8974220ba26c32983877216a0e6747bdfa720d33ebd30c4b4bb8bc225a63377"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d2d89c2d674e896e102aa0b67def56f81dcb37945a9221f78a09c58c80c0c37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df09a70e0b391efddb90a75ee0b2ecf57868865392bea1bad1e7f3b7a9af0569"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ca28427f7ea383fa66eefe0e13a1c6467a249f58f6e8671b3da9fee1713f64b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13511b25aced862e7857365e8a8155f31b1371d45f7c4eb2beaf5d52d52579e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc1f26074d2277a0fe6f7e735fd276edb95c71099a6e8aa410b71d32ddebb5a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0709c263dc5fc6df5e15b1f9709f844fe4991bbd281b6ba219e9beff48116f77"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d74000992bd8e81c1a61249d970b50cdd5c59e371d133b58081dd3ba7f01de95"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d72283e56112880e28d19549ec8aacf57f1ac3ccd9fc8a1a38fa3c4e6eb19cc0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"554ae4b88adc15958e268b4eb43eb410f7b79a0e9bd5175b1e0e3490b0685c55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19bdd5d14588b02064147b8c9eb8eec6a4a28a9f98dfa78a68839588d75ffae8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ca5945ac18a096b3c3604f752f90c0eee66a1b0a14642e95f9223dd3b44c98f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f819f67fa42e03f738c88be0f725b46463419b54c6302af015326ba7536b22d0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"427d63155e2452273af39f8a3af712646e7c86ce364a7cfab8143084da8582c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7432d67b0e0e36493cbb78c2f949a03907c4b9d952c1a0f1dfe2a71cfad92a78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bca25e17fc525f3ed18eed957589c65b687ada52f3a28b04a675afeb0e8403bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e128cacc16d2e8685147e786b3dfd95b682fa6845b9c2e38dc170fc391895d6a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2512da0267a80bffa3bbfe45e9799d5cc411ee8b4ef7bcfd567e14e63af81133"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"711d4b05e3c8d195ac72b74a06fe0e70bb15832e99b377ff62653aed52ecb0a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3079578f29155cde6b12ecd1a3dc326dd22faa0b389a1df0588d19569cbf83c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0aea98ac5489d62d6cf536dab61f83e725d52538c1ca6ae60a8e97e2ad5101f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a28f3631cc4af091dbe6cb945d4e1f58f0d8d6f7e728e87ca12395815defcd6f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a3f7ca5079bd3f8f64690b18e6082f70e3ec89a68144edabcc2583086d55456"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"019abd3a699f245823810e0490850072af774796a66c9e7641d90d84af00c3c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1649046500070f3e753dacf7e690da27ea355951d6940e19cde08016096daf4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9ef7ada3e5d5cdf0ad3caf1f43a130bfe79f749e1e023285b16d5e2f3bb4e510"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3570be36ada96c79f32076e403e96217e773dc47efadb3a43043fb10cc13022"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"629c2b913e66daddc5b560ad3aa780506ca6812a63cd2ae7954f75789db6ba8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17fef09d6cac7415710de04a5d59b113b26a3aa7c06e2e2520852e6d595902a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e069d96364186dd6d3767346b794bfa62f4cf7beeda3f97c6ead0d4dee37e0f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65fbb64e2fb1f32fe96e44daa8afaf9c2d2eb4a74c4589b2ace2af8043568447"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5122befca3596a6eefc2158a3d7bad145c984de8dc1cab509cc9252faef2669"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"623dddbf8de05cc942f5ee9c59ce7505ba0d277d2bc4b6c3d60c9d7ef294c62c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19642d2fb3b48e4be12dd90e122ba0b311cad799c3764b1b5d2db4500a5f9a56"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b41da754d903b32e99e27d19e80b7e513ca588b72a88cc8ee377b1ec81eed4a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67d4b1a63912a0c9df254d5d28ba48a325f8cb2bcf1d7aa3b760112572bd08ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b93a28d6d3ffb1b366f0686fe148c9a21979144d30347882d89e572afe541cdd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f524bf32e75cca5d667c5a90ff005b1e4d767c55cb90aac567dd304cf8c4d35"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e73c95a29da4dcfb5527649a839adf90458ab35d13ac24733c792f2db50a8056"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"192a1f6d87535523506afd7f25ce81f17806fd2009358c2ed5370e21e74380cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb9d8f5b9463eb397d9a70d8cadb4b7d7022f68d0fbbd91e1035201c9ae38797"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b7b73ceb36292cd0aea93dd38e1b409f82797a2981ce67ca229c5a7ea92aaea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1b8431063f61a7203a1da65aa113b207c2be3f7e4da8721bea725d7de74d36d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9eeccbd4b0d0e6e62930dd1685d253ab7bb99215c410c334b2d7ad2f0b71c17"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"435fe65816be62ad1c8c8b3ae5a416a319d771118b3f872ef5698cfb9bbabc78"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8d7fc3146b41541e9378c88a5f7e61501618826cd7b6a3e65b676eb108b3aff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a14b5cdb7cdf37359cd38c2d9de176d37de66962476edfe5997ee0bb54b64b8e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31f9b08954b0c494da6e5ab633db25a1a43efcb3439701e64da4b07ec6dc8750"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"353f7c6196cbf31b59a2f0e97dfe463ba23217a9fddf2c6c12a737a67b2aaccb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b0d3125dca06e7f77804cc82b36d81ff623a6475d4c06c83ddb371bfc2a60f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4290cb851ee9b284e5e1299bcf96f2c53a9ae79b40457c15ad35e8135c825764"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6638980bbbcab7351bdb7844de82eb668d9478a1b24083e315da52e3b5ef362"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d9726eacdf96109fe67df61728a65640474a933ee3b18942b1f4656d39bdbbd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c12a266b9b75dbc679d8dfb18f0a9f126d44a7cb4b99fdcdcfb586acfafd85d3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"835625837a60b39b2b77c9a7cdba06eebeee2472467cdf79152fda06505d760f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c96d9bb33d39f588516da9f20fb5280dc636ae3173f9881a105a03c1d6168b4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5408a31413184cecde6f580e44627a1edbc508419fe9dad73f291c66910ad9e2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"33b2200bdcd81d6aa992a4ccfa797ef8a5ed2ee6e9436002bc6bd531202b52fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"461050469f192b9c6415c3ba15f3d3ee09fe803e6d916006fc23b91eeabf0b7c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0223c23ce994b59505d8cd5fd407797539fd2d75bde8b4cabc76024f7979d456"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f49c8ebe39791ef397ce8e322bae8a051ffc47cd74c0dacc100e69a0986e9c3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22dacc6eb0f9d912293217fe891bdaac64840269cc4672f4ee629c22fd25a79d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c5bf139cf07ac8930bde1c2004fc8b2db71ae871865cba86546a91f8863538f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"821d4e3aade02e2aeab00329e8597fb2c10948fb74e993368cf0247dfd8087c4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"544c61576055371a8bd58cdc33b21c69f3f09514523294c40e978ae6f0696594"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"677639a7672bdf44481acedd95de01d525e2d5d6d5a7c6b1a93c5001c23e330d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd485fa8726a4458c1ba45aba051f66e1b923392e5e49762f9225c58ab9a3901"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d81f10040ece49035f36b7263faad31139685721fea045df5f36f19e11bd654f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b59fa29e1bb13801ad7c9b150eba6b51f3b105654a8be1b4b9776521ef7615a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a40e1192493940cb38b182b20ea16acd0b1dd57b6f375051883f86302a40e6b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30a922f4efce3e84129f48d7548e1f5a37f3c9863568f4defe7f989292363512"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"990f5cff120b61b92907a32cf921741551753fb4787996654cb29ebff2afc8ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa162dc6dc89d15ab2341f76706052da5a7880f4280a315f0fce0e13296d5794"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf06ee28378a5cb0674c98c37a2377817504f7d5dd2bb1d22694e69e10ba3d29"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30c6f0e5dd0f3c497a75014cf030ff3509225adb3355b5ef4ad9ca63d832e4cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9b670e6d8f426b819c214bd3c3ed36826c5b0f39fcff044346c8877f567b441"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4077b2726a141a4dec5238890dd2234c7f3c17a7c4bbbbd7a937538a19b7799e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e89bd6d1fcf2e8d1409706463c30c49944d65c6d2054ee38e25c54d0804787bd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c52626ddb60024fc673e527666b24cb555d7e746fc12de13ea1678cfa25d56d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e078b338e02979d2492314493a5794f1c4176f0eece5e8bc9534ed45310c5085"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"231f771637291f6db1afc90527cafb69baa61ddda8d445a010564e52c271e9e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcfd4062ccab378d36ab35d9bb2f368a7738a6f779fa030d19340bd0bb13ec51"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9845a13800802470601a3012212b52d446d5df93350aa6821c351a08d707ff69"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2c4cdf53fb83f13e9cbcddc9236dca06d5b22e90f305ec9a6ae8850866f3919"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08110115e5f4aebe04a58c34f99e7f29bca9a9193cb8f0cd7e51410960cd53ca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed3529cff82b3d5ab4fd3bf4d2eb9fe914d03f1cdb50ab8e6838c4b49cdc12d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8bfebb4678da7fff045e4d8b709524222dd8e0f00f73456b8efd6eba1bc265c5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47fda8e759c5eb3d2845880a81e9915066eee7d3bea722134b8e0053f7863090"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7782f0540eb87e05abeaa42fe35cfc3e6029d08a3dfb668ce0206ae05f8089e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d2ccd5c32ed45957fc358315cb9b7ead6311529230b2e32fb4a47d7c04337eb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c9a82608321c090b377c5d6da864db60a6dfcff74e00ecf1977bf9dbac793a0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cd063845acb5b655f0189451d4584ca7033dcd5103e26f829201ca3d21cc8c38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"923e8cf823eab01a9e47bfd9381a3e25c91b2f8425f2f5da7018ee176aa1359d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4622747bb2c5f39ed52ef739af1e016080fcc28c28342e480768a06ce04591c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc0eacee6fe4731e2bc54512468947c159f71c1c623c77893d6b7f63f44a8f7a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"916d6b9f7327db78a4bafc3b9d3d6121ed6fe48839176b5662b3f6d56163c6d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"957dc8029b6f78b6eda2a698a8537d2dfeeea8d2b537595320c50aa1da414268"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f11c547c2001333ecab69de1e4e970cf31a89542198123254467e78bf2c5dbbe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"585156323e86a3facf21e2544a391c423a79fe889849c8ef9cd074463ef09337"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eba04f0ce856a373e6bc1595cef4ce1f6142d282c5e7c0e6037d7f858e2718d5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"618643abe95321e6770965313e350107d83ab87801227d264089fd96cce80d1a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0236f26bb0bd2a9ff1ab21f562a8242fbbf7cfe5025df4c244a1fa7009e635d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ff2acde6cf83e091f8e2ef34ebdd00a9ce7b055fd2033bca0941c7619e5d30b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34de1857bf2785c1f76cdc6616fe34c02e3f43b873be2ccd9e2a01dc3db3f315"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c58325478525d6d0e52a99b68c06a3426fedc699c06b3b652e8b55651f7124d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fbb69d4251fab51bc85c4332c0642912c79e79b718d65c01723ac71de35cdef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0c89104936a2234567600904c386a4ef006c97cdf4cfa8605657312bfee7514"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68b338ed7130c9ad51eaa11f5c62bf2bc71dff6a25b9a4236a886bc55806711b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b422b4010fb9aa29e68518ee78b36f00e05d0c4ad000c927827bfb5dee64ebfb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7ca7682a8d9a105ae5c44f1388ea41060ffb8b7155ecfde26e6a6d5623be882"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfa5e12b3a7c85942cee04d24f2f25d972f34aa003d6a44748fd8fd769669401"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80ba045d2cbe427314e4f3459f9d621ab3d0ffac0c8ac28c1fc0ee85139a4c77"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbeb1c8986503f949de1020290e14ea3269094cc6c6c3dd22cc11ab96d99d8f8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"088f614bd4836278697117ea7d4bce48280ef325114481300a7ba8c98ec71bef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c3bdc7f4483a30e714a5e77e7323d843eb07d8898451649fd07bbe912005d74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46030da1238d1035d266b45b61e073426108c5fe8ce954da46167e0260353bad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1feda9e17e348eb170d25cd154255cc04bb1fe44d217994297c6ccafffdd902"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a237df77ebb23a6fe6737cacac231bbafbe48cb4eb92b548560307caf35aee90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b71338a0ed28b19115f7867e962935e2b232e0008c81a5750745f7e34332866a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef90b200ac8a73a7ffcb7689d6da8d4c4b13043b9d0567b5ff315037a12473ed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f209553d7cacf65539080f5a97b84c3ef80bd79f166cdf4cb6bb6287e080ed61"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2229a460ce876ebcf074672bce4c1be1aecf221d9a5c6768362e2a1b35128762"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99ed335daae01cd0e1edb31ff805203e402c5d67b34a69a1f4b8d33eeef9918e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbf584aff402a4a1b729f70bd6a9ccd9d39e531d19faff1b1e799eee0abfa9d0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47750bf658f63da34a3522626d3c912bc62bad255a03ab2ef10eb21a6e5e308b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18acd0a0738822c407107e640fa0519923a6acd7933f3061d9a9a747c7a5e911"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecdc80e12e7263881608c374d36ce2016814c971bfa21fe1670f1ad0588eae1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01e11f43a70f47f2a3daa3a8d5cdeeded72bad8315b898d6d921e20c92854dab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"357748a0d740219f786bb27004bd2c5068b4b904224e39c73b107b7cc5943589"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31e3c9423d01dac75564f466c72d576e49d4dce452eb1cb717b417eb99d5a826"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d24ca2c9dece4f0cfcb13d6be63bb7930d86dd366d0d90bf3841f6b952ee449b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"252d5232a0716fd7cbe3ec043701c52f41edfd50b36347cfb4eb620f3c5e2eee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"919e2200811ecb69eaf92a46502fcab4125f43a8c022e9a1ab3af3ba703fc1f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f77308fcb3ecbbe8ce52681410765689bee91904da5a1b4bae597e0bfe179e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cac7cfe5c57f5d9e79b338a840998ef350b92ba46ff95c65fa872c667ab5f459"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c42ac175db41645a04fcf5d94fb7719b976ed57a2b5614e088cefbe93778ea16"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1348abbb27865725e37331180baad87a7a31b4ebbd4bf07cfe61f005d9fb104"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7baac8828849d33af539cf2c592f0574d09557fcf5f0b5b951880bb464cb0abc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31b3a989c92ad8e50cf991468a07790286b721a0179786677e13350d096d06de"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca11f363aad8b14d5fc562637c71b821fb133a35358877e63efbbcbae1e67310"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2579b450c4a28a4c40c7cfedc3e8d0d26039f1f6c19df32030c9c10ad70f2be6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45522ed37cc76f247e2b410b017255987f94926cc155e9bec568eeb59bfcc389"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"363ff4f4ead8ab0679980df8efc3a8bc59b067d75e0ff8b8be323dc39ecd8245"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1574c826698ea9dc2c9635b9a50a03581f7e2f1206243d1753e71840493bb0f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44d4ddb05bec74abd8650b699cde7b279043e8114f8e757672a02977f13ccd54"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2148a8aba08a3c0370267f44d567fc306e741a65714de7b67a187f4602eb015"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5372fd7e156038297cdcdcaefcd8ddce95ef8334b0f89f2c360590ab20924f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e8b9d79ca82958065608223c167ae90064d4a76af8aab0d738f9e491f2f7709"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f1ca1c6ba478d43a1879b1c76b0bd21235426269ecefb7442f47d7932716db6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66446af0904bd084ee690d26831dab99ae47d2f2d22ea683e867021af599414e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"743d175ee777a762e848a36dfee1e145e0b7d9bd4e5a4671d8d8be22bfc61e4f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5e933ade3b15a1ab0890e78668c78c873dddbd6bb7971b36efe3dc835c5ba25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dec1e86233c9eaffcce48ba259a66a69a83fc74923d4df02a132067a6742558b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a9720d7c30ea0945298cde01d7cdf16d1ef3f24b3654b076ae61c251e8a28bc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8a38b21acf4fc39384616a21cd56fcbb6f971aeeaab6a05e2d7590dcc306e19"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03c8e1e380afee25dea54aaf351fdc5dd1184c82dfdc0fb7a324955b1cb8a876"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b721d0a0917bbd9a6da96b1b1b17f8b6cbf416990ab83dd505c10371fef1764d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da8310e71ad230e70ebaafb434a7b45afbcab52ca1c50d2b6ae5624facba9209"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34a54e2d5e0f3c7c762a5ace6b2ded17e71cde61ec67e0e45122eab0f8ac9d01"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61ece03f8d40ce20d262e1445c2041e10a7aa11da4f73358c002fd93d76900cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e2b19c0e9b879f87ca18d4689b1c8366981e2d054224c46c123ac13a0ea6d77"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b7f3d66927e9e2cb138f5e57bf2220d18f4ff1adada0f0df8f5dd142ce858f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9378fd81089912c42aa54eeae209302996157afdb00e97cce67e14754bc47571"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"219dfedbc664153f5836b4c1774ac9b73c904ba9b1dac6cfe091386698e5009d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a776244a5a793ef949e44c4069c0c09599e34d2f48df00b36c1a7aa7cbb49223"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02bb4a720f66801ebcec6713c1fac63d02a0cfa77f4986f486b35a8c6d2c859d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65281b7e8cf921fac0eb9c2e8868665c9a3d75ba2a91415de4c775c21de76aaf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2f00f35c215f138bcf3a51f0a62ae6e2b6f91af95a904d5e01e63648150bfde"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcba4b2b9e67ae6198e609748ca26cc94dec1557d1a4c3945335d32cb6f0d747"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd04c1e6b4628c222fd3b7f1f5e0e8fd8e046044e16be374ab9eb301c9415b0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5995a5f86cd72827b4a87b9029d40482e170fbf2e504a8fb12b9fb0a348524e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05874a10945e422ea084b3a683862147833f1c1e3ef7cebbfe8fe50c42addc02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6054e06acd21b50db3e8d679b87a8636fe9a60d89b0780a2b1a2f53931e242c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95c19a86c99b53f7eabcd6d14536c7be1ddc8c3fce4ee66989c3dfc9acb56360"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c2a9f7f09ddbbefe1c70ca1e95b7d46715f3a9cf4be4910310b4e914b26ce842"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"631f25b912abed8725fa1a3775107c719a7f61a6dea734347aef2a01df5f2d7d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d45753e942d1232dd341faf2fac68b396822b402624f8bb5d2557ee08d579428"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b34fcfc94f1bc102e6b6c4a6f54992fcfc9a70a3c8e61b274af844c2f441d044"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3aa147504a4b89f6e49fffa920e2641a910e88487b7ca13e8a6d6bc768f9b58"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d18bffa052f3efa1e422cc62b0ab8c3aeed86b66ecdf89aba7d7c129318d73a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"034ea9a677d0746b033ce64edc2fbd5c77b1e06f5415f33a7ebdbd85176f84ca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa335b5e762276df1ddc1e80233d3448bec7dd45fbb091b517b5bd55fd16efb8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e2d2ec153abb058d1026699abd3a90842318e6455a1f9151e268617c3b7927c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7bfd1c163db6283a13e3a97e818af0f91dbe984faa21cbf5f79f9d7062f56e4"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99bb4ac67e23db3978c349ae7991fe15dfaefa1e05432e1a4ff70e11a9c915c6"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2cb7b4e0ea4797b1c65a2428a8e5fe6ca625521ad821edb957e037b1bc37d6b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb00a3db42749d2cdd8a1753ba27b06f3eee5995475e8f2753be593e981f3b85"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86359f76fa3ed08c4c6d41ed5eb9e0742b0732b133d8f69101ecefa4cbef1201"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbea0409743e98e4c9e2c3679be30f6e3e63844c43c5973d05ae344d47280bb8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"810c693c36228a4550fb74d48906a0b760dd80bada75b77b097dbd72e547a423"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b5884e8229274adf837d4ea3b7e864dc11e8b60c633c5416c11d2ffad4a1315"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"503759eb9d9d4ae3be15d98255cc9384a0af2ae75f4f4ccaeff5b340c238efb2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7499d835d64ab1a05a56f399d5885c0446c4e950ee63a840c6794d85d045a7f9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17c831108855e17f1e3ce2caadb29709698e17a4b917c4248affd2e6c24954ee"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ce4d131babdba5eea87b5505f73fc0c743bb1b95957087f463cc306a0cbd6a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e9f4729611812b4708fb7485b69c57d2925438ee921493b94544742db3282d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3324197efeeff73a5144c7de27ebe43685bede62dbaea0fddd886d9950f383d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51ff0d02137372a133c918de22f10c1e92770627aa6b2050e702863d96707593"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cbff9dfbbcc4cc4225e3ec97106ab8e5e6a27c9834a800f7d42a0a78e7d09634"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c1812974af00962b79f12f1592a6dba1207068e010b63c583043be9f20ac270"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9abad19bbcbac6279927dbf41652e457f98f22050d76a72cd674c200011c4b11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80c4a67ec10f2b70270ea52fcbb8e5d889039f3d0b878d3726333b5d685ecdab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5dd7cf15bbacd4b2f73f639198b2ff4a626b5d96a06e7be7cfeab7e044adc996"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bec4549a17c059037cda6df1598a3178167f161f99f96c34895302aeb279ec74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9cc7abe3569b9b077c4847420c12d0abe31641bb4ce26a4c235c783d958a16d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8521ed1cb505953b7c76481578429fc8d0858eae244027692c46b05d61cddc67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8efda935aace8dc2967388cf77cc6eae1f9afd363b75da537b00bbc99fd3a62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"964928bcbe04e66057c921745ecfff94297e31bb9fd9903e54e798218845015f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b4903c69f8b6292e2c78b4d7b60239b7ed9da4364a077ba931b52384e2f71f4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42aa0df11c49f157b71a1d24e7a3b2aea591eea84987df21cb34884a8afe5f99"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6a3efa02a2407359b7acaebd5a0e2ec7a75b087f0f130a81eeca3c182f08850"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a3d9ac5503b98ac1fbc871798dbc2ddf93fa4b87050558fdb5496b661d67d30"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7218592b5c37a602e4748ba124e40ea3c39f4d74cb4b278654a078d9e81561a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bbb7bbfc3b1c724faead063a74e9ccfdf6d26e278dbdf8e9d61f8e95ba8c6bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"198c8af5af496696ed09caf8b8f9b90bcbdf47f875bccfdc83401498fb720242"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47ff589992365ec653536ceda7f4f49ac6a526a0fade22d31f2d88609acc8b2f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d1b70098cfe9ab737a39d46e225d3abe783c660087422af4b1e35c26d9438adf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"222918cfe6516e2b12d0fe65aada523622e3e01e96ba9643b8c333630fd00c6c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2963404f50bb0ce16576309ac38660dbe3e871878b7c5863edf1a95a6c53a760"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a8a4684d38e7b8030617cdc43b0c814f60f94693392144e6f434871b63a93ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2573268b9207f9e2efec923493cdc9909f2d8e861e7491e4d72e831e05853d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c190c5cf82ee3ea495262a9a12bc61d5b832efcc07c8f3bb6fff65004db91c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"516926911dfd3af5a4fdf18d361d8fe6862ce62eeed04dc072efecf31720d9d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e94e4015419f52a5dbcf4cefb0188095b7e349356fc6da81318c1d26a7b170e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f83f1a7b6ac294f5ee74662c79b0c2592f1b55c32bf6f9a723d5a003f998a4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6824c1db80ec80505fa5f7e6c14dc519f91f77d1793b145100083c43e3bb9823"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6afadc747ea6086397cc4b5aba2fb7b284bcd6d045fc4a44f0cbf1907ff88e5c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fb17297a43d680ab731ec2fb93f6130b0f2213ceffd970771181476c07690ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d720dfa1b82c66aa5d45b75702e4f946b5ad5b66e18c3c23c1201020ef7f3cdd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"489401bd9e978039f83ee93309a8af92689e6cccff5c81f3c9f4995322c20a07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93a31eab4c056b00215b8d13d74dad97be5149dc755d444989af64d57f0a9394"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eca6f96e1be697dcb224450d6a674da7d66e10d65760500f724f0b0252778633"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"db62eb2a1438a080948843b8dd459362c116a91ac0959fb66c0710e759b0ee55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9481193feb484e2e12ea439feccde11e20bcb8d84afa3b396680200b35976f90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a437e04fee0bc83aac1712045ded313bb60756be978cf036e3eb2abd99fd0eb3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"702d0d8046d5c65d715ab0c98f3f0dc749a9ca0e32f62a6d5d51eb3579e78bd6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07eb7813e1070f49b58b3c8549b2fdc2764cb2656d1650a505ea4f4a387a0cfc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d3221976b8c477faddcdd5648f83bf24be2a8df4cbdce89c8cafd72f2ea906d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20de28d0c09692485c3f9d7222b7b2211f79ade4f84e644b82ce15fb7397feda"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1cd20349795866f352d609b2feebf6c2a36a182c186d2142614911a05294c9cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26c1d89ef88002d29ce30284073938c058f0dd8439e9da4fc83dc49ce4b8cb1d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d5105a19ca0d1bc7acefc69dbb4339484a740cef7ca5c3b15851cb35aacdcf9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26dd3ca1278bc4f91b055bc500623d872bc1d1a8e097f3367edcc45a5128329f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"810ffe3bfddc02c1ea351f62018791bb78335a12b7b7932986cb9c12e81fbd49"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e427ecceaa5f9c263ab4d1bd88bc85f5f862c34dc9aa72862d7d389ec53cdb3c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e54d6dd5d7f22d47e54b41f885ae3e8a006fccd643be79db09e6ae491b45176"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"644a40adc9975c32ba4b397815a5bcd834eef1f57b79a61ba588e2073932a012"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf1ba675a9225e28287933deb2aa75974b70a356b9dd75da155de36cf19a9ef3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3dddc65538a7bf0217a708fdb775b0b06ca86078b2f9bf1fb4562d51622878fd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"add3c1db6428d46f1d0094d3e1fe37e14d128f8fd6fd8389edf51fa7dc1c9231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e77f2870e7cdcf2550ab67364cb898a1b6f3de4236c111ffb003ecaf7799e38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95058727c36294bf6d6cad91e5296c1781d03af81746106426d9febd9b433e3a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94a2a40a9efa0f6e822918042b0afc38bb847941644bddc17721b6cd1f871e15"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"562aca22ae48c2553743f7fe2aec3451d0a28e046c22535234f9510d5608f240"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89854b126012df18a2059b4b8830869f415e1e631804c4fcbaeaba9a6dbb5623"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aff94afc11d543276d4fc31cc2ae43d937852c5851ddecaff52351b12ac319cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f004447d4997a2dfaa8191d90eb29457fedb5d1bf2185a21619eaca20d0ae85c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78e5bf40442d7fe15015811fbe9198e4e4c5ec7ac4fd6b3c84ec224c617148a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9b6fac93aa7730c9d6a8c43190a815485ad413eea476c26d6c409990ead234e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b33f11bbae722c2922ba540701b270a08f1663e7155175708a31e65f7e11a0bd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb390983d42e1b52e1f5de046988892e4b2caffd9528c473123f1b591137c089"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54ce4a5932d2efedc40ad64cfa50e0b2288e73a8852b9521c6d750445c48d11a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"202ae0b450845230b3983b7598117fddc2f5106763a5376a5c7d99fdc3569e39"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3a8b3b80adc15b0a2bb4d5e3531a0f82b7df6adf8c876a250986e6af6289a61"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f3d3d608a8498c3ac26e6999c00461aef345e6e5b656804b0bd2c228ebe690f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a25ee7c8d606eda69cb0ef8bbad4d820bd23e6c6b92bfbf2fcf77dccce60797d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90577067e38647aaa889a3b6cd847a00681f25585e5b76ddde5f03cd8a598cfe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54d0c5524f53b07712d6b0aeda83df7b9865da6299f22612550d9afe806a962b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b35f8d383f1f0efb1b904a223bb7aeaf13a8f6515f94878e49a7c6e007222939"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cac7e0d1e8c27b076a35791fc8a017d739aa9ca11aae8ceb3d6a78f6f7426491"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc8a11bd5cbf47bde35db8533236968f47dd082e00cb12e4daf8db554a8c0aeb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2db9b94bd86a078218fa41613c972db8103e8e850bbc76b35354d8686953ab2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be3c737c9dbe52f3f58c5bdba5417c926aa3f1b286da89eb3179c05bbef9c4cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e111dc77c819443f7fa393426a3145f7fc7ce85ad42af1d9e5c599a8a43eaa10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"daa7b986803c8b4a8bf4a8acb23fc5083684dfcb00b6d58bdfd55d1b08c24c2b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4652a246079324eb2a7737ba1ef2fa66d1dfc170fdec30175d1963337855b594"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50ba46a2738eaaad55c13b46d13d07c03f05c63950ad2634ab960278671d82d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72b9eab070da8664d0b6d0340a86f0bb08422970f3502245e0fdc270dd62f461"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d142e5893fc6d6862a64adff23b8b92eff84e7c2cecaa8f7d0ccf6455f4970db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4051d75109186af39d6ddbb3e93f17a82db265105b761319c032c7e98a7b7456"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d69281ab18d938ce98a855b48c9258300a72950c5be9e31cf6d2be255690fcf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29c639eeddbce18e4be2567b4b3099a3f03ee7db960a25b1e2b2f8e84325f8b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2636cf17c344e46689af970532b236e89ffea02e3534fa35ffd377aefc075481"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d9c4f75cca5d6d073c090c5e15e7b3f561b8083d67e5602c0c55fa17a61376d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e765e0653e12a84460aad9c227b41c79c53875628aef088e189ca3e744255f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58992ad6a7cafb1fd93bbcb874843f6e92e1095ce7c49bcd87a249a95ab555e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28ffd1620dde8c9fd852df34a5b2d3c04551362544d15864369572998d7194aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9efc7f20293fed9bd62c68dd06249be42d71af1a9a790ca46337fdeec88e908d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96dc3d8a79339c61ff54614e8b010295fb2ac7bed33696c7420b2542f78af2bd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"313f84feee6ea9d1c80cbd8e03483e6b4c08ea776329d7e0ddac37df823ce2ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55ad966e78729efa234f583736b0fb4ef7234847aba6d5b4f1a2d4fb54e909fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5947c6fbd20484cf1e8073cb986d7801f4826bd8bd8840757cf46247cdf1388e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e9eefb46d3b99de827c919242c196e16f87c64857f22cc876e694349b8c5b7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"492a36f3a578dd73ec102271dbb4c6848c57fc7aae8cafea1d82d8991192aa3b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05c7e17d37a03b7b506e717c0e66b428b827c7887c435127ee26446f727d0c14"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60eed365f2a95cd5410c02b9b853fd230df57c4890813faad82153369a6fadde"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7fc595663a32d278cdd6f175c3405eca00a468d6dce9b297a6b72ba62bd2173"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b638f082bc80663c308565681fb4d5bf6a63b49805def0fbdf4585e145aa75e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e5ede36c330aa7537f694efab36d0bef137827d1cdd4317a729fc6fb08c8035"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d90b0bb34350e897f756d9f0b11000fb7afeb0e1e8ba06bc8a45d061e7fbd73"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b540c25b3bae7142a5dc3c5c2b541c170949ef13722bf36dde080d1eaa4ec40b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aee9ae39b3f86d856fda323040cd950280873ab147ef4e11b9932222443c9ce6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29ff5e90f14a9897d7f3c3ad98d2873370d36b0527fc2c0a7c2fc3321680ab4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1eaabbd3a08d11f24231c5e54b61e3e8f5ca2d7e5440ce37329cba4d07db0e37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"516ab832e644d4f39f8cd5082537d9c8aa969f5f7912ebecdf0237a4cf575c2d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34579a8ce6ac9f23856fa1c5d439656ec2b95c3e68b7c874490f7ed99c406d45"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a80b1e819e0f4b021966ec2519e961472ae6c65477d7296c8f981f2007be1725"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c26ae83cea1a69f3130c149b8732aa24adfa0cdde38a1e1bcecbf0c68485958"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed0ec467be9b4f3f50ec2da9c1dfed841590734a0952ddb264134e8fd7cbefdd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72307e9c61b891bb64620de05f6ad10b1a113200d7d02228c79e575b3df4d1ef"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"02745b0be597ef127fb2d3daed4867e2f9abb6fab863fa7a2843bdc84af2ea22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92b3f055495571cb1d3ee7791b859351451bd9250a9d8107168226e06bfdcb28"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fff8e44f5b12511bd50b5f39e183427f4b2053b01eff5fabdc46e7ddef16ccf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1e32df16c6fa2ceac263dbe44c95a389575e5327c4b92d58a79f7ab5d79513d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"390466b4d5e292eb8504cd6b104d71a2b94c9f5d844f7229ea2a146974b4f708"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8685d6a5b806830246821133c560b719e0c51436874ead6686e827d6470a129e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"929dd346692a7f9cf67f89288f22117bb2bb9821c40d9ca52360204225152dc4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0331d298b8931354e550969fc1c9fe764b6c5d488bc4c4abf23de20ea80a9869"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b4cc01ec7bc0a8ccaa5b99173304decf1f2e3e76f17875cfd1f2031c84da3fd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4aac78373315baefe494cd1dd853880992b6ce2c55a1744689863ee691f23ee"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da8983fec838846f74345f12115c20efe9b0eeca31ffe599ea62573cf47faa49"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5faac7b85f0a296150b0358ac03802672dd49e059ccf60bb7efba1b6127a8b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b3a96a4d71214e5bec25f29802c0fcba5bef000298f8358c60d42be3bbb0a94"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62db581538e90a6b12146f2a2303c907401b91c0e902244a8bfb3c2be9d60a79"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"318de0fb917d52565250d76d0cc0f8ba6f2e8cf9c30ac227266c4fc0f6899cb8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba88c8801da73d52b246bc43d4aa6e026c2219d081f954bd69df940c0fbe1e4d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9bb2f108bb4b66f2dfcb21b21852b2423cce028a1993a3a134f4c341f74105fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2af2e73804d6b2c6d5a917e2ac93d5d3cc3b0e8ec064082091b3e286c78dcb24"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"037e11e745beb4211cd8a6e9d3e1c945c3a07dcef3fa06660d9b534cef8b9ca7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc446a1e582fc784e55096767488bb4f78a59f87a2d79572d1dfa3310aa9e11b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f8fde2ef12db04f85694cc2ec49be12754efb7d6bddf3797af97efcaa894c4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"346a7620996ae19ca780a23203762b50476dc11915d782e0f9c2c6d5a6038c06"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f01c4ab772d11ca2e1637ec30941142ce60fb459b03bf19065f5ccac68260220"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e72b9d4d1bdadc6d018751df54902b80bb15d0446d2256cbac25e955ff6c514"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"417977cc8e5449b50f828b89328f0e01124e1a4078ec623f9c9aee1396c98e1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e89e2058b006e056dfb6bbc85936c5beb06ec8701c3193e926a5780a208a6f3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f205d7aecc12f6ab7b3f9630b5367f1749f9faec908473044608c7bad65456a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4381d206d6cf61384563a8e37b1fa9203118c1f970d51c7fad65dd7d17c40f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d833256cd19fc72f8338bf43b6f1ac2b88fd9597b5963c76ad9b4c09cdc3e610"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7dc68149cd719257199e457a87e8f2483b29729fe494c83a12ee8a422bbc3469"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6e30d6e446e966968d20d641d7d85d6db33ea0c59066d32756171e1361a6113"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d53fd441e7e874749f9fba35d4f0985aaebffecaf6b6b4d5b5322462b313085"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83bc560ded27ab80ff6f1207caee0770a5ddbdee3ff538a6c58344fb7fe616f7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ea64c91c734d1da1a4f78a8a68274891679a2d72179c5c9aee9dd602e41563d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0311161eb7ef31fdfc4acf78c2c218f0ce13ed53ad92c4ed40df0aa1a02376ed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6a7f17edecc809c8172c9f111b6f59cf7d2d607126c58bc00adea3f2ed58f54"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0950ee4d73dcaf23b36c27e2b709d2dc4f6e41e63ec7ee5b6fd3d4e52202bd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d92a77f84a97b106a302a7366ea5d1265d0fa3ecebf9f136cd62ed69d1169a6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73620d66ae76395e4fb8adcfcb9f730c28d8e5976ba50e34b3a14b5d44e99b66"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"428e254ce427c24ff0486c2a50787cf433f17bbad9cc414cd3288d6d38f163e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"078b3278a4dd2b03fdad9eb9f3505caf3e9821f513005948a5fea37bb00ea807"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d17fb1450a5c35c4d5599f8259cb2a92cfff180a236792b8404494d9744b81e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aeb5e8df70bbdc046a15932022e056f67df9b7d016fa93aa3091ea7b89b392d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7056a33c0a46e3e0caf1f0c7ead60f5a81bfe71304d5e8c64d90e4c1a25cc6a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb35b3b04b423b8636df17fe1806928a17c8642913e13e989fc644351af6f706"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1397dab764181f3d8bbd01efd0a016cf7f108caa3aac8e3bca174d23f562597d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f08b03b3cba9697ecb0d8f084f2376b19fdc3860cb5f89e5c709b9d7f5d0bf3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f48bf74cbdb99358f18c0114049195f8570285c6cfa089ade31930b6110f334"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f06b21c9d723a8e09e91481072fdca4ce2bf209468918cc53db05ba3fb3afec1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed0d67bebceb6931bdacb6324b4147cfed97a28f9ddcc023fc776af5cf32a136"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"735553dae1ff5ed73db1b85b063f7d1fe43c7b2df457208ca8a58d9410f5f437"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae7f499917079b4768f187ed1b5033e4cde4f95adc89e9525d529981617fee27"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9abc17728ae944039e38357013b5051e15c48227f265e79e2054c388cb12817"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2415c343aea8f7944d3f87b894ba4fb2f3de1bd71aab9a67be45f654a2b8221"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"664fadd896ae12dea96baf9b9b23d3975309502f912caefa3a897612004c38c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"456c0c42c4a81ef972021dd5132d0b5a840293fb47f775e3fc9ba7f6c133d56f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15101c8296143ed5c54432592c69da81b60b22eef89211f6e5f03c12b01af6bf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58656f03f3e676bbb077c2e08f4c283cc5664f8161f8de16cf6fc807c3983365"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d255231d41465fe0c5356d0495f5c7d8ed06d4a05de6b8c6c3f58c89df9c300"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e17e2a1e8a2ac9fe18feed42560152c07aede4a44427ac66283a3b73b804bbc8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c80035f074630a6882c4b07c61d488ee2bae6b9f2521bcf82e2c379adbc407ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81be245453d02ede191ccb51a64869003e1eec8854ee35a075389171374ce691"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86cca785b9882ccb08afb236e11f736e9001366cc09af507d8c0da55dbba2848"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea2fb9b1ef7b80530dd659905881c0d8a6a2756f7140156e5b790f2462814797"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5924fd446d4d4645dec2057254e2dafead1da6c99f3bbcfc5138080ed40f5d9f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2693d7570bd39b1c33870cc216c5433d57597e84f19b72a776f8c438735e3ee9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7f367240819a4404dd8da1b2760dc708791dc71faf43e1fc144881cf6c63ea2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f837cd96cfce729f9a316806d81c1ecc9f17f65d27b9ab277d42f5e0d66b388c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28b740c5e963c23488f1971f118fc21bb82f9499cc40bac93ec2e59aa9483db6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbc5266bcf49ef29cbd39cf65d80af88f61638b762233b7cd545644aefd494d9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2873c296cd37f137057ca8b5f1288b8bf6122f1ec69f7e97a55d74e3616f3610"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f22bf730b280c6382c6573acc2eedd64eaca8897cd86187dc0e940665242361d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4560ffdcc3fd03f49cb20b6995cf9f95184c221f46099b26e978d9bf192e9931"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a54911d4f89fdf241acd21a21005f9bc84ea5c74d2b048c9c9a827abf10d55d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c926e18477c59a0348d09d1a0fc4e34d926d88e2c72678619f662d7b77c88c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b683e0b8d95aa1fdd8590d49b0b6cef623eafc90fc07055b42cd53d449806662"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be7c2e22120d374326d1ee29af09f04abf856206309835efc787029642eb9408"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d40e5660cfb457d2aa226874ceee74bc25bea9788e937b71898f4e0b4f4117a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83ce7bd05f408d5ce4db0619f225c6c7cd20fa75c85dc2652b97a64bffae06d1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf6008971832519ca31b732bed1df73286cee3c26ea8d6e0dd95305953f64098"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1855da46ef88ecf3ca291d643a597c266b55a8a7ab9e8df8f62109152a30e92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb89c590299c92f605cb82216b3231ee916f5cf9f3e99b48b0323a714ea4c255"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac6ff14196c93c7c6d6e8e629a6038870f16dc34a8c1a918e1efc95c336c27ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d32689bc5f570c28cfeaa89debbf43b5bb93d0de3defbe27874d2bdb4a73250"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c36f983d3af2caf930cef03e5235c82df279bdf9c2a9371580c7a6c89a9557b2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae1b2fde3c2a7c1635cc3b6794f6308ef6b51ef470dfd1357697aacac56d7409"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9241b6c416352082482a4e03ba5208c4822df1c9f3f03332fb9a06972faf668"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0807a51492fa8797be3f350c32100c9bd2b6f5a633b7df131e0e6124bf83c8a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abd53d3376df9552a8ae665dd7735921e10d56d123e2ff2bdd5a27dcc434b746"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a25370cae09ef4dee3392b7ba62d53270a666cfc41555dd1d0e63c06b189595"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8ab5bbdc031a5f6106d08be9545e2710e592ca7f5ea56a34ad744ef5bd6c766"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"711ff0b6d0ef349c78b37dbe70f5e07865e0a1947a3c8f3bfe920353c90e3a03"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87529d913df588fc5b757dcb5848031ad5b1c92a5995ce437ee3f5254679a97d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3578a9f935ca3bd767782cae55bf290a5671d12ac4f3dce883fe356b2228e005"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c7c33b836c4c08034e22d5aa73b43422549abbffb126a5429827920770c5c7da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a674f12ceac6e07dbc0e6c8cfa2c0d15907fd21da083948847010f2bc4fd164c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11c6110c3800eed247eaf32eae00998aa6ba9ed163ae6359973c899dd4dd3023"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e34bcd5ea493c4a42a72d8a8f73c35820225a6378746593fe7b76702e2c19b71"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"adae664fbdeff1521696ba87d82fb2e7d0babef463e205f1dd3e19758b3b77a3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"65cb1821b1f7435caa2929627cebc3c49c634f6245a7f018b26d4dacec111680"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b4facf6851e36b855dc0370738a53704c48393f4b89ce24e58e496396b90795"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11a8aa4b2bbb77dacb19f67fe3e1c88df63fa578cd25684412a43503923c132d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83ade4224ce88775917c7734eff5dbecd0822c9e91926152ec3f1aa77e4a8af4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d799481c0e89dc9ed22548d16107993aa53aa406cbdbe85b1ff4fbdbeadac5c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b6f9e0a22bf413909a561a61d2f5dcc168a35dc0446b981235d24513c2cfca9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddd21c068b4533e1e3fa533c5a70a2af7c6d91c6b358fa040ef28e70c449461e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e20939e0e29a20765b779b2187e633a8a3e2e563604fbad3b9f9d369fc84c002"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da5ccbfa5005571fd718693ee5f52edce668fef21c44ccb1f439f118051fa206"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af29204e81e5aa61307f5063161bf6330e83c4764b8f8d3808833be94ee8f9ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ccf2804ce37f48646e80edea624dbfd3c31027bf9d711b17c1d12c971440723"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf7048c85dc185d17cdeea899674bd40aa69947398b1020ff148b651ed319007"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d24d311a0fd2e110088d1c1f1cd035944878d4d82055420e44e91636b81b3cd1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b6c4bd10d79d8761f70b060d01529e1181213e31740e7e078d02308abd0fc66"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"314450c6e2cb923eab4032c6324a2fc00b14dcb0658bb604c8002df7a23efc57"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13d0fd19e11f9534622b70c241837b9b7c6d8c4a7b8177a292d913331ad8344c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"589ab0ae9a9b67e5f222b1f6120f948aaaa8fd8dac37a8593d293e6691dfefb2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0e8958deedec096dd0d8e4a6818ee7ae2df860a85497635857a2857e7ee013e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0ee2dec8a3dc1df5925c828b267489df17bd188395dc219829804f72c62e46c5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ed6aa3976e8f8375faecd045cd83ff2209d5e241a01ee64e7082ed95d149bf43"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac570f32142869e7f09c2a47261ff25a24a009f16ac02ae61f78a940a25346da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ad94b88bbaf5a0cc66b42c84394166a5e399c9c4f009e27598d6feeb8b4ea11"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd02f87ee29ffdf8fe972d87f9d4ddd0aad3ce5186d69193436e8d3ee1c03b0c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9aa48df7c1953ca1c6d2edc1024d130e870323a2d06e086b8f65b509c21b6f6f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fdec61339101599882d04c53889f800af32871d89c45bae903d18237948f0d5"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ad6788b6ffa3d47e89f184fa4477a2e87a4654f47879fe6f6f1eeb0110a4ec0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87345d7e6dce39945191e6067b99ed95e32694004dbdbfb6becb776f786bd44d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f37edb06f85ba6818015c2fa0b8d3e5b05088fadafc17462681a84b509f5c1ed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fb65962c160fa46a6e07c0a94300f8ee37ef2a23c15befe40e0f4a35d90127c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ce326968bc4b5707c957f097a6e8ab190494905c7da261e2a453e73457658a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb5242a0427068a30c0ad8ffd74030ef335d6ac632cd2406ebe4505729eab0dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"250799b829d0f9a939ba341eb1bd52c948809c638eaadeca917c9f92822d2f10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da7915227e733683e6ecc4f534b3065cf91e069adf8dc7491a7e8acd5ddab413"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30398607ae0948e3efe20881783661e1905cb6e8bb3f32ff35873a24ae403cf0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10d7b516afb55ab3e4446289b5fbc0e9fdd35d7358b3409dcf01310d3b910f90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e7ecde57126a02c16c98343c2de27fa447e8f1d638295df14fd85bfb41a45b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8216b50314830e9c474332d0d1b40b2519d919ec82032b2a83254894383b3a8c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43de86a18ce54554a7c31825a7036ee9244332f9db6c95d7bd9c5fc684546865"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41ea6ded4fdb4b673fc90bab5df39de35f7eaaa0e4a793dd7f30e0682e285543"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c936a38726163c972a961c492335143517ce643207ecaccac4a50b89d2aeb62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d97e6fe61f6073f3153f6eeccadd5ef3efb01c1877ad393c7f52c2ffd263b0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abfa1a590275e28b150ee8d348bb581d0d15504acab6df309bc7d088b896fd25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64126a315d3fb16d5c26e62cb2313dde17ca108dd1b63790817b0f1bcc1c3feb"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3c744289a8344f51a1ea9ff9a4c0a177da195c903ec53f263410d75c629b052"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5a457913d11b40b3b5efbbd4b3acb9f921483827ac03a676d4349fd1164d4c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"425c089906a70ebd4e35b0d392ae936552951c8fe801eb656275981386b5656e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"26f2653862c5135ec62517772da389932d562b4c861a3eef368f10d68027a115"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6b749b6b2afec3ad0ce5cb3d9fb03dc568c796273f89106cb092a22460b8261"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"855252901fc43fd7ad015d747f981939601411c7f3e75e80bccaf91bdd7919b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18b5bf63aa3d3aeea9a9c4381e405207a26734de6e6716ae35652502039f4b4e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf848e9669e10d19bb1f3add2ff5f945f6435db0536260cfb238a1fda3410b76"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d3034c0602fba9a8484cbe71863a584f8a02831362a1c15ab858cbd50477c84f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"852a8b7167da3570a8ff6a7d1f08240b7b29930091813c0361811f4a162881d3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fb741439b5e8544255cef435f69b7fd813f4b767461b2cd57b6e8dff3551e82"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9458f5f8c4c333e0c8c0eec07b2ad332f109233a6097689f92da43df90ca94d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17b2b1f27290de21139fd1d45bd828ed2afef31ce31346dc81bf61c6de399fa0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb76e4c9bba7938679cdd6da546c7de94bacc37c70cb4a4ed1fba0022e4d9e21"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2083a8b378bc9ca521b248409e6d9d496733889f8e7c6faa0ef68b38ddc72648"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ec7f7206f708944a60112abd173ec434ad0fe35f206762045d49a2300c66688"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4c992cc2ede809a7a79ed2ad9ed8310c18eeee2c821e76393463fdca44e94ab1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15f1072605fb59e0839970e552bbad1d0055a3665593f8ccda36c7f945722813"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c988baa3cc4615c82cbe9e43c8d4cdade8a5c55354fb56ba17c751f643b2fee7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b05c9ffb1cdd81010398c88c7c6ee3c5b84b26995d4f3e0071e931c988dd9227"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ccc2407bed5d9fa462fd3e24b81a1d563883f6850958f4d3d879a87abb4503cd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de4972cadc5fe4d3343b3d1d5e78b3e08e5a00e80c55f83db26460c7210c2ba4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b2e67485d2b115ecbe50294b928a2cbce102ce9ceac20be8628b6f4821b22ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c70de309336c332978006d3171b4c923377d9cfec313988ce324aaea9bad6a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"184be72ba6c997f617c603b59b2c501a2e0eccffdbfaf6e96bcf17dc4bbcbb14"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2114c410fdad9c7a74ae2cc4495f1eb43746629e1d1a1db86723710828c5849f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93d3528b5c0278ea275bd05e9a9b1b67c913266b4ad668a49c47490578eb5ef2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"898ca52fe0cee4853f58582fc0e6beac75cfd449725211ef5f93c7987741cf13"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58c1dbba1b8fcd4d9ddb1e459ce3c1b38997a1b7ad0f9f227420e5f81fc2b643"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b95abbe8bb15385b98025ddea7e2866706eb80517b1678e86f9589e4381d06d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4befb6f55ab1998786f82a7aa90d181ff59ece5cde2faab7663ad7de218d12c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2287ff12fc6a4c34cc162d5a93e3cedee30cf54140873a9042002c741f606911"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1961c5002cc9ee89113232b00feb0dd374a5a9aa7defe97577174f7d2dad4533"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6daeb187a96040c5addbe0c522b234290abb7e48e8d8cb760682f7c5c00c0e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa10d9868dd0a9be6055a8dcac184b1b8efc8095145dcf375b8e6c686e03a52c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4a4a857b71c3584a50370c9e78d5cb40692e875c92d79c4814192158691e170"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd2c2a57f12f15d881a2021a2686f7fc44e7bbd6e41938dee9788a5c924412e1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"630f181fb20ed998f051f0df3c23adb27d69afec897062e0de7b9c83e44304fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b0fc40ff1fc199fb0d3182cee24f46942d67b6b1de025fce6e751fc09c67a42"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0d62904f3d02b7107ee1c53ea1bc6b3dc82907d478a70e0130b8e0f80d82b1f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9462ce3fd2dd74ebbf8e5e80bc3c7ccd74ffdc384ba44d0ca9cc9efba33cba00"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d834c80b905faf9e0d16efe4a5f7a5ab6c9e07d4b10b3419a7aa30cc097b7a7"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2d990aab9a728402b86acbde3c8560665003daa1785a0b6ce0ac72701024aa8f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bea3afbf8e656069a88992943bcf06a95a640f1fa79d92e1a6173c9aca692851"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13aeedb033ce1b626dc6b65b07c19d1aecd804335dd7f3285c5d331959d8119e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98591747b374cc0090488cd27de27fa3c841ab2a4f6d31835cf934ba31527e0c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2088220d44ff8ca5611262ae9840819c5c29fe7061b1645f85216dc93e1162f"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5931283ebee9c59e5b186ed5c60882a644ece91d48fa7177dde7fbbfad30421"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"077589d6d843c49f603ee4c5e9fc36576ef8920bea74f1b95f0fd446d7c7f7da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9cbe21f995f02c2ab6ccb4202c27afa387c784cd796fe0b5da6ac231a4caf751"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27b11791196cb7ba54fcb41df4a4d273dcdddc3a591a9bf783b9b12363f553c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5dc12d09266ff89421a26064a70c11ab297fa2d2269951f2df83ab1dd95a8c3c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe9ce52343f8ed51c39d47e14e2b5d241ffb5dce4bbae210ea2b151d616e98a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71b1fbaf9b71421be9015f6596f3317bbe595a6d8d20b34460721375332ab357"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f4c2ebe6d435f9b9c53af58ea8665dfb0a7c82ca22eb280e0bcf53f618c2016"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2bac39dd8a49ec8278dc80b3c4b960a1e800221b7243367e3d068d0fde217c2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2da85f489639421258762a8d6089e28e2d107efbd5ac374888262fe8c2145eae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fe961ece359bf8324ef5ee5f39d0c8ce6577936e59cd7ca652cd5f8050ca104"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2eb344a49701fa7410f0731ca80ab41a92f1d46950a23d246bd14991276c5321"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f95ad781dd3964440154c72101cf9741c9422b496b0029129514537b1b6b8337"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0e52b8d1b8d0aeeaf0ec2bfae82566e0b56457a2e2f5d4518a06e2c3e2733b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cce16fc3bce1962c90292ce57ebaf5b3c96e18e00c54e9dbfeec0f9de2fd0d82"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9579d0c70bd6ec9bb2e59b59aac841b18b1ce6ce56ae96b50da1314671e615d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d604e390edc6a94ae921d8f4eeac5c8b6a08e63371557aa180c6118517830663"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"feb07c2d90aa85515e709343d945e0e80327781028173f0e7d4f1b40aeee25d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59a54462d7a273b4be799af7e197eb1c4ce340b4c3b1656b868903c22027b493"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5aca2facf0a3f80cad0ee243590ca42b8d438b9f7cca7ccc2c11ac45d8441a3a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b282153969cbe9e80b85eb82dae66ce85119081c30d5541e8e8a44d03998051"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0868f08cd2c04b3502a119ea250f96a794124571f042484b2141e6e5054a196"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"27e3dc8bab42bcabe6172bd02a9b3137c4e499bd46ee5c92166ad6e354d7a040"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7ea4beca93341654c0a1165bb9915ba8b50c0df8c0297f7ae444ad2674ca965"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ac9b77e6209da8f1ee978109ec40bdef0bffc3c8cbdb0d8b3b87ebf8fbe38b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"beb62bd8bedc3b56893832ad94ed19b4f47e65855810ea70dbef55cf1078135c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e41658d2f7cc01d392f5b37b8b6cd87afa6826f013620b696f211145f88240d4"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0fef9b4f107a63119198dbe2de428b18f11331ac58be5701a20d6eb86dba404d"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83837878c82ae62e7cd35f3480dfc69e4c3bd4ad3981356c3dd8c40e08a2d249"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5db00bea28df654ef3d28c50010d2a025d4fa1e6265c49a499db9c5239019f82"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7dcabf76679445b0f1078f225b79c92457fc7acd659d1e0562c3b5baf6e7e6b9"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7cf8a78c4a993aecafcb4fe2b18ecb6ff3aced137586a07de2812771fcf18756"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85f99189d964cdde824a816d83f2290af0a3f7efe42feb1d6495743a90e33e22"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1498825690ee691422757d83c6c8726aaf69040fa62a3b6b71a03075f0880320"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb569597ed7812393f8b92dfaf5a0ca6afc69fadc46feb536ac6e45218be59a0"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"20df730af89c3fa3c9c96e6ee3dbdd0b97ad077113a7f4355e4fc306fc76ac99"},"properties":{"dependency":{"package":"certifi","version":"2026.7.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"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":"5e177af1cd414402885aee817705302a7eb2e6a234ed4a793be865e553c1f77e"},"properties":{"dependency":{"package":"chromadb","version":"1.5.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-311","PYSEC-2026-3813","PYSEC-2026-3814","PYSEC-2026-3815"],"reachability":{"kind":"unknown"}}}},{"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":"d1bef62a808b990694066b6f847c50ce48974c62c70e1dad8a46985940ea13be"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"reachability":{"kind":"unknown"}}}},{"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":"4da7730d961bc645985664271efae429f4d28e4617a7e9c84cff0d0ee9adedb7"},"properties":{"dependency":{"package":"uv","version":"0.11.33","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4321"],"reachability":{"kind":"unknown"}}}},{"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":"93ad6e5d287d4ae6d415648d4dd75d503d59b8600c173d48fd0a8a12e7100387"},"properties":{"dependency":{"package":"certifi","version":"2026.7.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"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":"0045ba65793d5120bf44041330dddf0593e29298ce59888c12a734d88dbfec02"},"properties":{"dependency":{"package":"certifi","version":"2026.7.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"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":"5dfbeb00aefc290094b88cd50ed1efe27194137c44a258191268f5efe7af960c"},"properties":{"dependency":{"package":"nltk","version":"3.10.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3726","PYSEC-2026-3733","PYSEC-2026-3735","PYSEC-2026-3736","PYSEC-2026-3737","PYSEC-2026-3738","PYSEC-2026-3739","PYSEC-2026-3740","PYSEC-2026-3741","PYSEC-2026-3748","PYSEC-2026-3749","PYSEC-2026-3751","PYSEC-2026-3752","PYSEC-2026-3789","PYSEC-2026-3790","PYSEC-2026-3867","PYSEC-2026-3868","PYSEC-2026-3869","PYSEC-2026-3870","PYSEC-2026-3871"],"reachability":{"kind":"unknown"}}}},{"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":"bcdbb70d3bbf5c5fa260a73dbf2b80df6eaa7c33129a58100dfa466ce5460430"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"reachability":{"kind":"unknown"}}}},{"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":"b480bed4354b1cbbf660580e8e40082e4394ef2fc6d28e3b335bc62d8ae4b52d"},"properties":{"dependency":{"package":"certifi","version":"2026.7.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"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":"d4d8f72d7bd374274b575ac1bbc264f53673114c45c2eaf526159c504db038ed"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"reachability":{"kind":"unknown"}}}},{"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":"ffc3ae158602695f4d065c17b974f000be49b79b1002eac22e26381a065e4421"},"properties":{"dependency":{"package":"certifi","version":"2026.7.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"reachability":{"kind":"not-imported"}}}},{"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":"09eef8b6625b25738f8700358b71be29a093fcfe59905926f2178ad3d178132f"},"properties":{"dependency":{"package":"pillow","version":"12.3.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"reachability":{"kind":"production","file":"fixtures/repros/label-scan-over-image-budget/generate.py","line":15}}}},{"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":"812be990e230138e65f9a9c0c2c57967dbcbe62539cff559a34462c9bd970254"},"properties":{"dependency":{"package":"filelock","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"840fb244cc346f03e959bd0dab73fdb22e673195638f0ace573154f689a352d5"},"properties":{"dependency":{"package":"oauthlib","version":"4.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"1e2dbc942ae064a8bc4e0407a1dfbaffc5db62093f95cf2215b69f31635dbc91"},"properties":{"dependency":{"package":"filelock","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"41773f0212e09e29c79713b6ae908f6a8f2f1b2dc765ee8163fe7950d07775a7"},"properties":{"dependency":{"package":"aiohttp","version":"3.14.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"385062c57963cedf0c314df2ca6a2a3677cd3721a078b388f8a3807d507939b6"},"properties":{"dependency":{"package":"urllib3","version":"2.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"reachability":{"kind":"not-imported"}}}},{"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":"6459c73477cd495311e41cdb269351400f3b117dc5fcca8e6616f2f17824a518"},"properties":{"dependency":{"package":"filelock","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"7ced5515effe5324a7cb95b69fd1d4454e6e331e69cf7b77d2b45f19c50968d1"},"properties":{"dependency":{"package":"nltk","version":"3.10.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3740"],"reachability":{"kind":"unknown"}}}},{"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":"99bb2285ada73444511eee2e54e6032d5824182a51b3d750cbb2faacfe15be5c"},"properties":{"dependency":{"package":"filelock","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"c9d142c5ec438a81c7319cd0548c1e0bb7f9d66d1473149c94c11d98cabb701e"},"properties":{"dependency":{"package":"filelock","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"1cd5edb55bbbb627ab2f3a485a1a65f2b7d9e94a298b940d9d0c04d4a4bc987f"},"properties":{"dependency":{"package":"filelock","version":"3.32.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"c5edc0ec9e0f535342ada95ecc0efcbfe4f1ed6560267b94d06cbf1fa94b95ad"},"properties":{"dependency":{"package":"soupsieve","version":"2.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"28c9cc3f54f0b0fb6b19c9e8527c36facaca7328a384ae3bb3131f883aa49f61"},"properties":{"dependency":{"package":"soupsieve","version":"3.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"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":"e8cb1153d60c28957fc4c5e14a261150e5058bb00c1f1d9b71f79671d45f8a14"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"ea5e5732fded6df5b9e7099f87e05efc3cc5654d3a1abace05909a761f6e863d"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"384ad2f272753e55d5b65239729bde39889c070c9279466746ecb828967b7766"},"properties":{"dependency":{"package":"form-data","version":"4.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"48dd73332069e60fac5dc1e64f8eba2452cc82289d423e1f61d52b750077a505"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"d5e379b5d4438d45645f5320da8efb8f14a249cc3f9dbe94a11b32ef982e8ab3"},"properties":{"dependency":{"package":"lodash","version":"4.17.23","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"2ad92b3e5f283786db53d0c7b08e11012c47fbe68d8c1524ac6d4bc33425e720"},"properties":{"dependency":{"package":"zod","version":"3.25.67","advisory":"[GHSA redacted]","aliases":["[CVE 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":"2541bd51d0a858f4bd3226fe3b4d1512619039c8d6b3da4e7c54b10a3b3553da"},"properties":{"dependency":{"package":"ocipkg","version":"0.2.9","advisory":"RUSTSEC-2026-0449","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af0e8800030c712ae4ecede7daf70c40ac31fc034ebafe152df4e3f4fd3abee8"},"properties":{"dependency":{"package":"ocipkg","version":"0.2.9","advisory":"RUSTSEC-2026-0450","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea1564cf6cbfa717c9a66d629085c75cdc24febf4e362b896cd71cd6a70cf8f3"},"properties":{"dependency":{"package":"mcp","version":"1.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ece1bd93bbad271c3a5327cd92ca484a5290e910a05fee4b079b3f846ca91a55"},"properties":{"dependency":{"package":"opentelemetry-api","version":"1.45.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc43931515bcfa6644d297aedd819cd326f2390e2c837ea6c55601fd823b08f6"},"properties":{"dependency":{"package":"banks","version":"2.4.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4201","PYSEC-2026-4202"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11744c31e68a722691c39facd19c1ef2bdad61b7f63c7d644904274240fb3627"},"properties":{"dependency":{"package":"multidict","version":"6.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"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":"ba90430cf2b95b2642b9d6d008fe90301628db266831cf66481a959f8e8a3585"},"properties":{"dependency":{"package":"tinytag","version":"2.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01256c023bdcf536d6d5c23439bcd60e7f16495c0b50803bc685820b077aa07b"},"properties":{"dependency":{"package":"astro","version":"7.4.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"docs-site/astro.config.mjs","line":4}}}},{"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":"d86075aa493e6f81fd997bb79aa92d109e1958dba4fa20ab8ea23e1f7b9cab9e"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE 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":"6b385ad0ac1d306f8a57748581018f76c42b17ee9fd1d0e771f92a7a5fe77517"},"properties":{"dependency":{"package":"uuid","version":"10.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"074b3c71f7140771b07e7eebcc0b5195ab7da191cc2680f203ee2bd23fe42431"},"properties":{"dependency":{"package":"glob","version":"10.5.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bced2e641d5c1d84001c2f4efb31d48d4735b67bfd163477b746ae8a69052fb9"},"properties":{"dependency":{"package":"glob","version":"13.0.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8b1fc17da312f1727b6999779e44e2e450fb452100cfd8c6a83da087896e8e8"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"613122a2bce59e3293fd4fb84b986624d80e71dc56f0929ac1d54b754293934a"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea7e5354ab7cfc90dd177dde60810f39ea3e10b3fe5c807ca0b2b906b7004ac5"},"properties":{"dependency":{"package":"glob","version":"13.0.6","advisory":"[GHSA redacted]","aliases":["[CVE 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":"c3bac0b956cc7625db5ffaa04443fc36030c2af44043a6f2dfd365abaf694f40"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"ef9e231bcca62362b99af248955d59857152b617d9bbcf0b06fd1e17aed9340e"},"properties":{"dependency":{"package":"esbuild","version":"0.27.7","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"3015ef51a2e26b046ffaa38ac4a00aa51f5332cc39aff896b84d26c4f5c91c68"},"properties":{"dependency":{"package":"esbuild","version":"0.27.7","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"57b907bab944893056891da921f1ff134969edc3dbd32f5e80ae7b3c04bcb169"},"properties":{"dependency":{"package":"astral-tl","version":"0.8.1","advisory":"RUSTSEC-2026-0444","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"c79cd03ea8cf5db8fe95e9dc547d967466d6c67820b1bb6d7bf2f9192b6ee1af"},"properties":{"dependency":{"package":"astral-tl","version":"0.8.1","advisory":"RUSTSEC-2026-0444","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"3e51db200ab2ac876f0a5856e0f845edd071f067b67ed273a79531a5c17f422d"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"1ab991637779e31347da3a0b1d4dcf7c8bf8355ec18d0e847dafdf80ccfe13ab"},"properties":{"dependency":{"package":"astral-tl","version":"0.8.1","advisory":"RUSTSEC-2026-0444","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"52a12899e19c0cc286617304aeb9863f3ae341191ade0b109d1b7a8c9fb3c65a"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","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":"8041a00017aede4899ef5184a62d7ebe241e1c69d09cf948c113340038ef7ad0"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0db742589de964e9f1cb500b66023d29a0fbedd56c054bc616f28e99c9e8f8c"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a70d1c79ff22655e1155c875385065bfc440873d70f79e90c30e3aefd6464b71"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17a508bde9ea2ae2a60d96fcb52ea77688530796f65af4a3e0719d6730276a88"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"263f96a3703250e7a4dae68d6d585636f83675f3e75b767dbc1be8771913feda"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"838d3e9c794b8f8867a3ff06c7696587ac73b573e6e451015d4f52bae5cbe7a3"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4ce686bb79b5fd19eb60305dfa30de14fcdd955c91287e350847404fbfc4fec1"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"173a8526354135b6876ef55dcbf6228358d60093431ac4d5965b62b3754a223f"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f303f11db3c47c78bf4a7c559b3efffa0e1d5c1161912de3ea0b82b84f3292e"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f6bac0144c26c3e7983f451bdc12654e82fbb487306680c7d6a2867a28b31f"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"feaa4fd634f87c4ad90968c369b53f7c743028958baf727d0981b406a3a78bdd"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a28af386796b3e5736c87d6ea0d3df84153248c403c26acd8bb58eb098f60c4f"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28577114f76ef6edddf346ae15ad7c10be2526212d7d335a80db3c599decae56"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b0af1347de3fa576aa8b39bf5a3240f249a98b5c784c3cd1aa0392a4a6edb6c"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7b8642ec6e99f57fdb52479eb2cc826fb71eb241aec9a2ec63cf4ca03dfb845"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"847f79ed601e4bd02fee018ea5e1eddc37d3329860b0be464bd8e414c036e02d"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"102402d6d605cb9105b55e82f2dbc9090ce4170239a1e4e4fed8d5301ab8a386"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b36b23d3b0ec325306f6b595597ea124c4b481c04c1cdd189e1714738a9fdb9"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8361e47071de1fab5451fc5af046dbce6ec7c28f5ca9c3dd31c0c7842cb1a20b"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c18209f93bf707617e61b676970d0dc9489bc86331b541d72d0852e1781d056d"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0acdb06b55b8712b97bbc8dc5e23434e5d179ccdd51b0c5553625645750d375"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3c8b1511dd166878315151280b5ac133fff55889d087c7d8deb6f4f9f55fac74"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1df088d4c356d3a1c6066d618be80979df7a3221180d7a7e789425a89aef3a9"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01676220a4382ed3a2accfc80ae1224225c5828dfbc86d07ee711c5fdec9c530"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fac7425737ce05249b19f145db17ae216610d9161a02609f8154341de5bd8030"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aeb5f8ce1c340b444b05a040726c686764a792a64650a36fec380612d8a1631b"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da68b995ce4c84eb2e338a57c2320beb577b8b533f311674f5a7419682795e20"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"360e40442bc8e75004e24833e000a2061c4b0be25befe51672cbbdc8a4fba6c7"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53a9546b136a5062d3b302721961ce4af42dcc3199a92d5b582023a9147404cd"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"88372a0f0d328cb661c83713b4bacce946ea2ad21bb9753ab2a4057199053941"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3d039f5c2d23eae24dad0c39cd01021b542e460bb3dbef0d317aeab41f0f2c3d"}},{"ruleId":"D31","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":"71150223d65b3e3f5c9eed358d864d19c54a2a0495dc923adb090e4ecf75c57e"}},{"ruleId":"D31","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":"21cba56f828331bbf5e68a080fb1f0d7545efc519c4ad1ded4421a0802774b4b"}},{"ruleId":"D31","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":"181e7ffe5b8c70fd80d511c00211ebc9c6431c7383be53fa43458ed696bd1b3c"}},{"ruleId":"D31","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":"f4a85f9aad84898b7ef469a97d4981a7e40a37cbf0650ca3337bc77e25dddcb0"}},{"ruleId":"D31","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":"586f8a78cc3d65fe3eab61719d5169f6318881278f2c9533faab933f38fbd566"}},{"ruleId":"D31","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":"2c09d92ce9110675c298a5e4c7acf6251c1d3b51e1e9d43ae9eed38afc736bc8"}},{"ruleId":"D31","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":"9e2aa3e602231f17e28e2eab068396fabd3403e2ed8a029048d724d88009a5fe"}},{"ruleId":"D31","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":"f4d673dcc7e8171939e3666b0e123d50fdd46382c24b5dfcf8e8b9f308bdb976"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 3 of 1584 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 1584 of the 1843 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/xberg-gliner/src/candle/heads/count_lstm.rs, crates/xberg/src/transcription/tags.rs, crates/xberg-gliner/src/v2/splitter.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/candle/heads/count_lstm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f58444636bc90f5a48aed4e6a0b8fd04a548c4d5f332f370b7bbeb0ecaa669"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/transcription/tags.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe79a6044e37abae10f89a43094e1e84f7365f2fe10912dbebac88da178553f7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-gliner/src/v2/splitter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda2a38f615d878795bbb8214416174fad39c59e12b0599d97804b97d8371352"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: papx.rs \u2194 doc.rs: \u0060crates/xberg/src/extraction/doc/papx.rs\u0060 and \u0060crates/xberg/src/extractors/doc.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00602c1c828c\u0060 fix(doc): count every numbered .doc paragraph for restarts; \u00600d9cff57\u0060 fix(doc): continue legacy .doc numbering across headings; \u0060110d864f\u0060 fix(doc): enforce cell budgets before assembling tables \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/papx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e48a270540bb4376095dfc711c49c7ea6c566a2431b52e0570911d5e3762a7a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: piece_table.rs \u2194 doc.rs: \u0060crates/xberg/src/extraction/doc/piece_table.rs\u0060 and \u0060crates/xberg/src/extractors/doc.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00601e93c0ce\u0060 fix(doc): preserve script annotations in subdocuments; \u006007bf3ed8\u0060 fix(doc): enforce ambiguous story filters; \u0060df1e1d78\u0060 Revert \u0022fix(doc): preserve typed subdocument content\u0022 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/piece_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43c7c8e425da8a88908b927b7c7fb9fbc79ff5e351198f0bf3adbd049df77aa"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: output.rs \u2194 runner.rs: \u0060tools/benchmark-harness/src/output.rs\u0060 and \u0060tools/benchmark-harness/src/runner.rs\u0060 change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060e5919905\u0060 fix(bench): publish failed cells, segment rankings, and fix quality s\u2026; \u00605830dedd\u0060 fix(bench): enforce numeric quality artifact contract; \u0060a4e6b203\u0060 fix(bench): enforce complete benchmark runs \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"def6f892f5ab6279c6a38a77968ce80b9ca449b0d4e7cb223fb04f98dcd49a27"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: subprocess.rs \u2192 consolidate.rs, mod.rs, output.rs: \u0060tools/benchmark-harness/src/adapters/subprocess.rs\u0060 changes together with 3 other files \u2014 \u0060tools/benchmark-harness/src/consolidate.rs\u0060, \u0060tools/benchmark-harness/src/monitoring/mod.rs\u0060, \u0060tools/benchmark-harness/src/output.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/adapters/subprocess.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d99442f0d7b49d2e119408795dea1ea0a3b2b45a7bf1ca5c1eac925365aed9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: consolidate.rs \u2194 runner.rs: \u0060tools/benchmark-harness/src/consolidate.rs\u0060 and \u0060tools/benchmark-harness/src/runner.rs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060e5919905\u0060 fix(bench): publish failed cells, segment rankings, and fix quality s\u2026; \u00600bcc6d29\u0060 feat(bench): add Tier A comparative perf metrics; \u00609bcbca20\u0060 fix(bench): measure subprocess RSS directly \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/src/consolidate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a800b4f66652ef6c7fe12b17b164e0457ce0e21d4a283db6c37fc31487847f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: rst.rs \u2192 bibtex.rs, orgmode.rs, mod.rs: \u0060crates/xberg/src/extractors/rst.rs\u0060 changes together with 3 other files \u2014 \u0060crates/xberg/src/extractors/bibtex.rs\u0060, \u0060crates/xberg/src/extractors/orgmode.rs\u0060, \u0060crates/xberg/src/extractors/rtf/mod.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rst.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e13d3354e99fa5fe01169d9aefbb9b619f64716ecc525671776dfc29dccebc0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: docbook.rs \u2194 mod.rs: \u0060crates/xberg/src/extractors/docbook.rs\u0060 and \u0060crates/xberg/src/extractors/jats/mod.rs\u0060 change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060d26e4b42\u0060 fix(stopwords): stop panicking on a multi-byte language hint; \u0060edf2a92e\u0060 feat(diagnostics): warn on lossy decode and empty OPML structure (#171); \u0060e903ac53\u0060 fix(markup): recover content dropped by catch-alls in eight markup ex\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc0441d3edf6e091534cf3c37c35bead913006aede8402a791b79108c6c12c4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: extractor.rs \u2194 mdx.rs: \u0060crates/xberg/src/extractors/djot_format/extractor.rs\u0060 and \u0060crates/xberg/src/extractors/mdx.rs\u0060 change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00609f85daef\u0060 fix(markup): accept UTF-8 BOMs in text documents; \u006027a4119c\u0060 fix(frontmatter): keep unknown keys, plural authors, and warn on malf\u2026; \u006059d5b81e\u0060 fix(extractors): link extracted tables and images to document elements \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16223ca9e9824d93776c859a4cfaf3bc5774545e7c0d3fa99a57e542ffce28b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: odt.rs \u2194 mod.rs: \u0060crates/xberg/src/extractors/odt.rs\u0060 and \u0060crates/xberg/src/extractors/rtf/mod.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060854ad904\u0060 fix: RTF bold offset alignment, EPUB/PPTX/ODT extraction improvements (at that commit the files were still \u0060crates/kreuzberg/src/extractors/odt.rs\u0060 and \u0060crates/kreuzberg/src/extractors/rtf/mod.rs\u0060); \u0060356451f4\u0060 fix: standardize metadata mapping across PPTX, Excel, ODT, RST, OrgMo\u2026 (at that commit the files were still \u0060crates/kreuzberg/src/extractors/odt.rs\u0060 and \u0060crates/kreuzberg/src/extractors/rtf/mod.rs\u0060); \u0060d5d66217\u0060 refactor: move image OCR to unified pipeline stage (at that commit the files were still \u0060crates/kreuzberg/src/extractors/odt.rs\u0060 and \u0060crates/kreuzberg/src/extractors/rtf/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/odt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2aca985fddcb5ba890c1390839b9c565659da217929c1bafb89260f0e6da3de"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 trocr.rs: \u0060crates/xberg-candle-ocr/src/models/glm_ocr/mod.rs\u0060 and \u0060crates/xberg-candle-ocr/src/models/trocr.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006090d5c568\u0060 fix(candle-ocr): repair three splits that broke the build and the docs; \u006012d1e336\u0060 refactor(candle-ocr): split long inference-engine functions into stages; \u006021025dcd\u0060 fix: cap hf-hub model downloads with a wall-clock watchdog (#1228) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-candle-ocr/src/models/glm_ocr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f499f289b0b566cfd84b2b0688c1ff178af97d290f2243a2488605748dde9c3a"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"047a3a32ce7bff71dda45796aa8601aec26f9fa1aa94aa21f316dc5b42d48205"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D40","level":"note","message":{"text":"No network policy: No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"295828650a2aaa1b03ae9b32ae6843a0c38011e5a70b1926442c4fa7187de5f0"}},{"ruleId":"C1","level":"warning","message":{"text":"No data-protection/encryption: No data-protection or encryption usage (ASP.NET Data Protection, AES, column encryption, PBKDF2) was found \u2014 sensitive data at rest may be unprotected. If TDE/KMS/vault is delegated to infrastructure, ignore."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3674448ef29fbd006d82bb49ec9615cf1ee508105aa1d952555aabaf3e10a9f9"}},{"ruleId":"C4","level":"note","message":{"text":"Partial data-retention evidence: A retention mechanism is present, but the data-lifecycle is not yet complete \u2014 missing: a scheduled purge / cleanup job (PurgeOlderThan / CleanupJob), a documented retention period / data-expiry."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6c843eccaff7ffcfe5241125b74768c2364055ab6678b12b10d47f44086afa4"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.AnnotationKindJsonConverter\u0060 (packages/csharp/src/Xberg/AnnotationKind.cs:101) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/AnnotationKind.cs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f4bd915a9ebd55d3e59b25ce49908e871c486941a1c096f5dccc013476b4d8"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.AuthConfigJsonConverter\u0060 (packages/csharp/src/Xberg/AuthConfig.cs:54) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/AuthConfig.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a9e9aca106715a82741786e90630909dbd3f461c6b5e3b3d30c945727b92b1"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.ByteArrayJsonConverter\u0060 (packages/csharp/src/Xberg/ByteArrayJsonConverter.cs:24) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/ByteArrayJsonConverter.cs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd767da13d9917c7300f88efbcd810bc3a99fc6f475dceea5fe78cfb06f950ac"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.ChunkSizingJsonConverter\u0060 (packages/csharp/src/Xberg/ChunkSizing.cs:55) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/ChunkSizing.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da3a87669171b5eed6b04b0f3941a8f0044c12d25e205a8caf6e7a24620275c"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.ChunkingReasonJsonConverter\u0060 (packages/csharp/src/Xberg/ChunkingReason.cs:63) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/ChunkingReason.cs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3659481b26985ad31b163da5fa6ffe9cb91a95be2c00a2204c46ed394e56678a"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.CredentialProviderConfigJsonConverter\u0060 (packages/csharp/src/Xberg/CredentialProviderConfig.cs:79) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/CredentialProviderConfig.cs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad30648187dee893225cb4a99b1c9cd902b7eb84c68938dd192595840ea007b5"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.DiffLineJsonConverter\u0060 (packages/csharp/src/Xberg/DiffLine.cs:65) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/DiffLine.cs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"148bf181ad1cc90d7b4dde6f0aae002824576b5b4e7f915528158d22e270058f"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.EmbeddingModelTypeJsonConverter\u0060 (packages/csharp/src/Xberg/EmbeddingModelType.cs:81) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/EmbeddingModelType.cs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dac28f83a0817d364b8f4915bb1bcef3f5298e95c653ed3e92c0be728a4dae"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.EntityCategoryJsonConverter\u0060 (packages/csharp/src/Xberg/EntityCategory.cs:91) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/EntityCategory.cs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b975020c966620c378ecb97f1e715a191090e9533c35c78cb7c808a4a00ea7fa"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.FormatMetadataJsonConverter\u0060 (packages/csharp/src/Xberg/FormatMetadata.cs:254) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/FormatMetadata.cs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae6b3d44dc90cf2dbd51055d10ca521df751f48ea6256926b42a8a7a4732a9f"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.HostMatcherJsonConverter\u0060 (packages/csharp/src/Xberg/HostMatcher.cs:66) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/HostMatcher.cs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b3a1200daafa5588402bc2dc2fd2d646630c7aaa1e460a527a062a6c1c1bb0"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.ImageOutputFormatJsonConverter\u0060 (packages/csharp/src/Xberg/ImageOutputFormat.cs:105) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/ImageOutputFormat.cs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a669d8e80a5142a517fabaa2f0edf2d3c2975050cc64ddfd04177ff8ef2907"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.LateInteractionModelTypeJsonConverter\u0060 (packages/csharp/src/Xberg/LateInteractionModelType.cs:55) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/LateInteractionModelType.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cac6fa40ea6dd8eb01643c2b9aa589fc315e7d3d759abfa19eb022a57ce3a3"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.NoChunkingReasonJsonConverter\u0060 (packages/csharp/src/Xberg/NoChunkingReason.cs:72) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/NoChunkingReason.cs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2d8a1efc957b9b2c74aa9d36f0c273a46c503490f203e25d25dbc54886a0b4"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.NodeContentJsonConverter\u0060 (packages/csharp/src/Xberg/NodeContent.cs:198) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/NodeContent.cs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e457ed9941e00728004e5195c2879a5181fff942522a06117611a2867895cfe4"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.OcrBoundingGeometryJsonConverter\u0060 (packages/csharp/src/Xberg/OcrBoundingGeometry.cs:54) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/OcrBoundingGeometry.cs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a20a1abecfd4aaea2cf9d773dc99ca6a79e166c7f89cab53739682d0df6b597"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.OcrStrategyJsonConverter\u0060 (packages/csharp/src/Xberg/OcrStrategy.cs:55) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/OcrStrategy.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6e28307228b99c386b5a2910a3f0544ee6ad9950a3c7ac52a21f7ad375b0b6"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.OutputFormatJsonConverter\u0060 (packages/csharp/src/Xberg/OutputFormat.cs:73) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/OutputFormat.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2546aac518b513b2484604ecbcd86b46b20a385cd3f30dee164679f13a900dd4"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.PiiCategoryJsonConverter\u0060 (packages/csharp/src/Xberg/PiiCategory.cs:106) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/PiiCategory.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aed7b072d74b0b0cd857f6c5f1b22a72befb6c7fedab15572cc8a691a3fcc93"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.RerankerModelTypeJsonConverter\u0060 (packages/csharp/src/Xberg/RerankerModelType.cs:78) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/RerankerModelType.cs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"83879ef5d339f80ab7850ccfcae4489321f4c14667273a206a239834fd3d041b"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.RevisionAnchorJsonConverter\u0060 (packages/csharp/src/Xberg/RevisionAnchor.cs:69) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/RevisionAnchor.cs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"100402722cbb15b701341c5d74b34da0e9819fb2e6c7eab19ea1ff40156d8b61"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.SparseEmbeddingModelTypeJsonConverter\u0060 (packages/csharp/src/Xberg/SparseEmbeddingModelType.cs:55) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/SparseEmbeddingModelType.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e96a3bcea4ee23c0fc39d36a15b71f0421d807f84e5920446899fd34f362e2"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.OcrBackendRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:1026) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"7165769caa1bb029fc76f2fceb74a89188d4e929cf66dd00473c64af198d8dc5"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.PostProcessorRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:1646) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63641204d00d94e94811e6ba59fdfe2bfd4183e4fa025625d785139e20605bc"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.ValidatorRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:2165) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a106cfb7641f15a1b49d33e4b285f1b2f49395efb26ad2383aa06af8b3adb1"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.DocumentExtractorBridge\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:2286) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaab8d8694bca8f042646ee7ec369faaaf2bc295bf62273bdcf7a47e7bed5ac"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.DocumentExtractorRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:2770) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4b085f4d90109e62f14a0787e7153c64bfcb813c4cf98a10cd964e4f7888d9"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.EmbeddingBackendRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:3271) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":3271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6103abbe8b8ddf0bfc1815f4ab377654a72d0da1da085520800643c4e891e572"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.RendererBridge\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:3383) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe30e01594bd5a4d933b5946b5d0d5d66c5a143edc15489aa5eebd1f6c726a3"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.RendererRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:3735) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":3735}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18edb9069a8a3666858ffbdc6850dbdb5b94afd40c78de11580e84c758c8034"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.RerankerBackendRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:4200) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":4200}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadef1e7dec6ace5a13e02f53f46b45ab3fa6b350080e719e55c6b56925bdaf5"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.TokenizerBackendRegistry\u0060 (packages/csharp/src/Xberg/TraitBridges.cs:4638) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/TraitBridges.cs"},"region":{"startLine":4638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7703cb2984648eb6c76e918507e3f147cc651ab406a13e7ffdbbffafc9ca0301"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Xberg.VlmFallbackPolicyJsonConverter\u0060 (packages/csharp/src/Xberg/VlmFallbackPolicy.cs:73) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Smoke\u0060, \u0060Xberg.E2eTests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/VlmFallbackPolicy.cs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb87c6b7485192c223351d4cacb748c96c793c14412f60bb11319961839c682"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060e2e/csharp/Xberg.E2eTests.csproj\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":"e2e/csharp/Xberg.E2eTests.csproj"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f878dc311851d94c3336f36798e1a6b7ad04e9b4260518922791363aa9aa2a9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): Only 0/8 awaits in library code use ConfigureAwait(false). A library that captures the caller\u0027s context can stall or deadlock its host \u2014 the classic way a dependency drags an app down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9409e0163ea155fbf96ac6090b9aebd32c62808d0aee4aa2a31f3d049418befc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.ClassifyChunksOwned( result...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e902810cd591430afb49b66140299a75bc6a75a364a06b91c059060c86ba20"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.Extract( inputHandle, confi...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7eb4d5f4356b22f8f68f8d79141fa67e9695a091b25c9b91f0a10a924ccee0f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.ExtractBatch( inputsHandle,...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b40ba141f2f8a18db17456a32065f63f5dd96181e65ddc63646c0374c708f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.ExtractBatchWithInputOption...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac17fe5301f702e18deb874ff96e5eddca9bb1a0f67bf40b081827fd34fd4d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.ExtractWithExternalRedactio...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d46091d9f3ced67ee301b1367693feb35b29dda8a0616ee091935abdd7b5276"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.ExtractWithLayoutPages( inp...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39771b609fd2760accd7756a01f5bd28bd4020b6a25aa455d327b1c368cf9ec"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.MapUrl( uri, configHandle )...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"f222186b43ffdc1a28bba48db3e0c7cf125bf2f752d002a57ee9d55d49584e8b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await Task.Run(() =\u003E { var nativeResult = NativeMethods.RedactExternal( documentHan...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/csharp/src/Xberg/XbergConverter.cs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cf040dda7c5e737d15d3d9bff4151c348008f3dd274719846b9c77f125bb62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): cli-proxy/npm/install.js:209 \u00B7 cli-proxy/npm/install.js:244 \u2014 the two spans are one implementation copied and then locally edited \u2014 158 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli-proxy/npm/install.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd6eb68fd8d63de0f1b94e385074c0a1cc7aff7d1dc516539a852cad713a4c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): integrations/node/llamaindex-xberg/src/nodeParser.ts:84 \u00B7 integrations/node/llamaindex-xberg/src/nodeParser.ts:111 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/nodeParser.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"636719627d7c542d93c57ac9a7905e128dc3f81b1c680e68e6d776fbc0fdc42c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): integrations/node/llamaindex-xberg/src/readerMapping.ts:479 \u00B7 integrations/node/llamaindex-xberg/src/readerMapping.ts:499 \u2014 the two spans are one implementation copied and then locally edited \u2014 87 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/readerMapping.ts"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8687575febb41b66dfdef0647092e4fcf7d3f751560ab87b67e38787af2964be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): integrations/node/langchain-xberg/src/mapping.ts:130 \u00B7 integrations/node/llamaindex-xberg/src/readerMapping.ts:373 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/langchain-xberg/src/mapping.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e7192f069d40eb768999178a21aa32e006038340a917969cbd7faa4bf596ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts:208 \u00B7 integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts:320 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0008864e68b6f391a8c06964adb9706252ec25510c00667a8a374a347118ba2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): integrations/node/langchain-xberg/src/mapping.ts:159 \u00B7 integrations/node/langchain-xberg/src/mapping.ts:189 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/langchain-xberg/src/mapping.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b317bb60e55db32af2552e33b0ca9cac86009cce47b46b0baded1aa15bcfa8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMetadata (cyclomatic 18, cognitive 17): buildMetadata has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/readerMapping.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"72067ce64d6c5834787df4754567e223cf6dbbedf23ed6ea848f4760233273b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function documentToJson (cyclomatic 12, cognitive 11): documentToJson has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ed56eb5fcad81d71548ddb705c4c765690416403f07751c0bfc80d99645771"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runExtractBatch (cyclomatic 11, cognitive 17): runExtractBatch has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"88327b662bf664b82a843536dc513ebd585d35f3d6cdf2afe4a39c3a0bb31950"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resultsToDocuments (cyclomatic 11, cognitive 15): resultsToDocuments has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/readerMapping.ts"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"050db426ea7359ab3658424ea75a5ed1c40b30f56ff7f13865bb0e7abc6f62a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildMetadata (cyclomatic 11, cognitive 10): buildMetadata has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/langchain-xberg/src/mapping.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"49da70f80989e4f9291b72b8fd5b05e259a91710822c938ee1a75a98cf61fb07"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/node/llamaindex-xberg/src/readerMapping.ts: 466 lines of code: integrations/node/llamaindex-xberg/src/readerMapping.ts has 466 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/readerMapping.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f45349606b2dd65ad63855cd2f0439855eb13e169f8991238d46e7d76886a25"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd4d4f70998a6da25ec1782affd899b047d9e021ee719c4b13131d628ab08af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.properties.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2dc327e26e0742bbc1d4f755a13276d5c1967c595e59fa7ee7fa42ba5afe4d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/langchain-xberg/src/loader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfb2c9b0fc7397dd0270a77fa1405349415db2251e52e1e21f2f94beeb68248"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/llamaindex-xberg/src/reader.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4fafd927043cb015a26c0461de4d0c68a369f0d49c75094dcbf1cf7e51a36a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7cf405b8ef93fa8191cdf346cbeff6895e3377b3ba420ba20f627396883a312"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~389 LoC): no import path from any entry point (5 application, 9 tooling, 49 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab1ace0557000aaab3fe3d8559a39c5f7deea84bae1e74d0c14872412ea91be"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~333 LoC): no import path from any entry point (5 application, 9 tooling, 49 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.properties.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c278b6a2b576f1784f993a67b6d48d63c6181705af4664cf19d40a684ad8f8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~66 LoC): no import path from any entry point (5 application, 9 tooling, 49 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish/node/smoke-glibc-2-28.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd0d78fdd8891f37a2000c2041ebc09d164c91b9f56d4a42e03677498f3bb57"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (5 application, 9 tooling, 49 test roots considered), but 2 in-repo import(s) from 2 other file(s) do name it (integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.properties.ts, integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.ts) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/node/n8n-nodes-xberg/nodes/Xberg/Xberg.node.constants.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"707f32127f9bfe112b4d9814c2b72de61a3602d8db2367ee29f20dbaabaa4303"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@emnapi/core\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"48b1da16e9a429e956a30b081876a9e8673049e59d04d628910725d1c95d5e92"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@emnapi/runtime\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c95b500015afa818e7b3c512bc0418842cddcc5cfc83d6516979c70c48eeb903"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@textlint-rule/textlint-rule-no-invalid-control-character\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecfe62c7faa42884c8a64672b5521e8b30b7558bd1705a7cb7f3dbd55941811"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-filter-rule-comments\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"078c9c586f94b13c679f10b6e33098ef3dded2ed63728aacae77d5ed16adacba"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-filter-rule-node-types\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"34371bf21ea583882ce690222564a21a924834f0d98f82da8ecc7a2c81d517f2"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-common-misspellings\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"94696e60fdb8ef2347c4a2f94430a97d6d5e6243b1a1476b10b6e1218cbdadbb"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-en-capitalization\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9395adde553e113cee4f9fa2a129f26deffa9303464fb9a89d0f5f05e020ea5d"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-no-empty-section\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4b2e7f8c9ac20aa5d27fa381426804cb18eb35588d60321573e256be81bf9b5b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-no-start-duplicated-conjunction\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7c2fa91ba7190c16c6e2b04fa93acaa3fd5e2f900e50592a6d53eebf793e4f94"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-no-surrogate-pair\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f8d035735225c5beea3cc75a11826b55be629dd30ba2b075dc08a46572d23586"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-no-zero-width-spaces\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"94200534f287f355a8168165682c8ab5feca4f80c8f59d9959090f3d59fdffe8"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-stop-words\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c11bf4c88b37b1b879de7e8dbef0f0964f3c849ef154522a8f4c7cf49dc5971a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-terminology\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a4c40c96ee64172f1df8917041b6e84fea51d03bf230a848b6eb981333cfb054"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027textlint-rule-write-good\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1f0bf02d63dd45d3f4b4db4b0c89a9feedf88bdc43431dd694ef4fda5ef74e5b"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027sharp\u0027: Declared in docs-site/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"958cbc3e1301f7cff0c76b98c782910cbd272652052a73c794c98dc9aa7a715a"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdn.tailwindcss.com\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs-site/public/demo.html"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b725ebe43b5f24b4dc5f6ff01e89bdea599fa2bab36ac37d9650887968ccecc"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.extractedKeywords \u0026\u0026 document.extractedKeywords.length \u003E 0\u0060 appears character-identically in 2 files \u2014 integrations/node/langchain-xberg/src/mapping.ts, integrations/node/llamaindex-xberg/src/readerMapping.ts. 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":"integrations/node/langchain-xberg/src/mapping.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0800ce6f0cba908dfdfd1aa9d199c70ae38aa96c4b4d6e5f54d14bea70e399"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.processingWarnings \u0026\u0026 document.processingWarnings.length \u003E 0\u0060 appears character-identically in 2 files \u2014 integrations/node/langchain-xberg/src/mapping.ts, integrations/node/llamaindex-xberg/src/readerMapping.ts. 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":"integrations/node/langchain-xberg/src/mapping.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4428631b0fb964bee03db68e08efc772777ea0a30a5dc4936948ed438fc69f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filePath === undefined \u0026\u0026 data === undefined\u0060 appears character-identically in 2 files \u2014 integrations/node/langchain-xberg/src/loader.ts, integrations/node/llamaindex-xberg/src/readerMapping.ts. 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":"integrations/node/langchain-xberg/src/loader.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f396ad83b9ab9752f471892416ba3d562b5be5050fa7c6943db3657e28c5094"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not str(cache_dir) or not cache_dir.is_dir()\u0060 appears character-identically in 2 files \u2014 tools/benchmark-harness/scripts/build_language_sidecar.py, tools/benchmark-harness/scripts/plausibility_calibrate.py. 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":"tools/benchmark-harness/scripts/build_language_sidecar.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c087f1244db478c1d53836ab2a7a720bcd445e1a882068212fcdc98f2c40800a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.is_file() and not path.is_symlink()\u0060 appears character-identically in 3 files \u2014 scripts/ci/verify_v3_capture.py, tools/benchmark-harness/caption_export/src/caption_export/first_divergence_plan.py, tools/benchmark-harness/caption_export/src/caption_export/subblock_plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/verify_v3_capture.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0407a211d735738a428462fe5850c955a622fcc2ac0901c37286e0113c722a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_plain_tex \u0026\u0026 trimmed.contains(\u0022\\\\begin{document}\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/latex/mod.rs, crates/xberg/src/extractors/latex/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"70eaf5afb0ab76400aad11c898a2222db7024a04fb0a52d864d4eb55373f4b0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_plain_tex \u0026\u0026 trimmed.contains(\u0022\\\\end{document}\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/latex/mod.rs, crates/xberg/src/extractors/latex/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e5a8ef2a5b6bdec27c48c76bf31b4d7e402d39f1e4223b28c29d9b623943af5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_standalone(name) \u0026\u0026 !is_paired(name)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/doctags.rs, crates/xberg/src/rendering/doctags.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doctags.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dca2758e77e9b81ecd3172ca8e6d0c6169e58dbf81e0e8305ee968fffcc3472"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!s.starts_with(\u0027{\u0027) || !s.ends_with(\u0027}\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/functions/mod.rs, crates/xberg/src/extraction/mathml/render.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/functions/mod.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c8cb6335599bf2f386198791934e4d41e0495426101fccdce5bbde9211ddaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!span.char_widths.is_empty() \u0026\u0026 span.char_widths.len() \u003C char_count\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/spans_text.rs, crates/xberg-native-pdf/src/structure/table_extractor.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a4ca3e6ebd6222730d7e16e099909166fefffcb53f64b29ae8f18527ce4707"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text.is_empty() \u0026\u0026 !text.ends_with(\u0027 \u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/epub/content.rs, crates/xberg/src/extractors/fictionbook.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/content.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a52111455b2770237c1c5c682aa7177c17a62ce6a16e6d539c280871911ab4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text.is_empty() \u0026\u0026 !text.ends_with(\u0027 \u0027) \u0026\u0026 !text.ends_with(\u0027\\n\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/reading_order.rs, crates/xberg/src/extractors/docbook.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/reading_order.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"8463ac6d7960058b97cd464468391c168007dc3249bc894283981fd2f9049e3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text.is_empty() \u0026\u0026 !text.ends_with(\u0027\\n\u0027)\u0060 appears character-identically in 5 files \u2014 crates/xberg-native-pdf/src/document/annotations.rs, crates/xberg-native-pdf/src/document/text_assembly.rs, crates/xberg/src/extractors/asciidoc.rs, crates/xberg/src/extractors/fictionbook.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5919e186bdb139bac811e0266023ab11f0c20316b588adad847db1d631a51d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!valid_start || !content[pos].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/mod.rs, crates/xberg-native-pdf/src/document/objects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ef922a4c7fc7e6fad1dfdbcbbcce906c9c901b5dbc2d6aeb54c047a8d8b8e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(start - 700.0).abs() \u003C 1e-3 \u0026\u0026 (end - 740.0).abs() \u003C 1e-3\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/pdf/hierarchy/types.rs, crates/xberg/src/pdf/native/span_geometry.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/hierarchy/types.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c0e6cd62e894220d755710033bc658a3d83c8924cb3fc23336615962bd46ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u00600.0 \u003C= bbox.x0 \u0026\u0026 bbox.x0 \u003C bbox.x1 \u0026\u0026 bbox.x1 \u003C= f64::from(width) \u0026\u0026 0.0 \u003C= bbox.y0 \u0026\u0026 bbox.y0 \u003C bbox.y1 \u0026\u0026 bbox.y1 \u003C= f64::from(height)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs, crates/xberg/src/extractors/pdf/ocr/pipeline/detached_mixed_frame.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"498b97c90313265c4d3537484f3e379663db255844bca3baceebd25c23cb18d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ann.start \u003C ann.end \u0026\u0026 end \u003C= text.len()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/epub/mod.rs, crates/xberg/src/extractors/html.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44d79de72e26ed10835242aa03a0b48881ed24ebe7e1bf54c9409475cc07571"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060boundary.byte_start \u003E boundary.byte_end || !native_text.is_char_boundary(boundary.byte_start) || !native_text.is_char_boundary(boundary.byte\u2026\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/pdf/ocr/plausibility.rs, crates/xberg/src/extractors/pdf/ocr/scoring.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/plausibility.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"878ee39626782c932eb06c33db47bce360d399b0ee80c690a8829ae4697c146a"}},{"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 7 files \u2014 crates/xberg-native-pdf/src/document/annotations.rs, crates/xberg-native-pdf/src/extractors/forms.rs, crates/xberg-native-pdf/src/extractors/page_labels.rs, crates/xberg-native-pdf/src/optional_content.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92797f95b062193ba12b7f7ed5973c0e20894788e7f90749517347e820b97aa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() \u003E= 2 \u0026\u0026 bytes[0] == 0xFF \u0026\u0026 bytes[1] == 0xFE\u0060 appears character-identically in 3 files \u2014 crates/xberg-native-pdf/src/document/annotations.rs, crates/xberg-native-pdf/src/optional_content.rs, crates/xberg-native-pdf/src/structure/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f70a159f2766295928d08a861f13ba56318fb52e3847192e31f9629ba803e36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060categories.is_empty() \u0026\u0026 custom_labels.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/text/ner/gline.rs, crates/xberg/src/text/ner/llm.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/ner/gline.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"003b1f056dfd4b71a8c11d1380fb4452099ec317e669a6d26c0bc5d9e79e10f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch \u003E= \u0027\\x20\u0027 || ch == \u0027\\t\u0027 || ch == \u0027\\n\u0027 || ch == \u0027\\r\u0027\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/extractors/text/advance.rs, crates/xberg-native-pdf/src/extractors/text/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bad3d8eebe4739c854c2e37a4bac22d536298475f8339158c78e4e968fc629"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060character.is_alphanumeric() || character == \u0027_\u0027\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/text/ner/offsets.rs, crates/xberg/src/text/redaction/engine.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/text/ner/offsets.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3585d2c7430ecd811cd9311ab6a7eba05bc39487d544dbe31ca2088bdaa4a77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chars.len() == buffer.char_widths.len() \u0026\u0026 !buffer.char_widths.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/extractors/text/advance.rs, crates/xberg-native-pdf/src/extractors/text/tj_arrays.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a71fae52f25c8c9d80772a144f929e3591e48f830ce7bf018b20f2dbbce5b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.force_ocr \u0026\u0026 config.effective_disable_ocr()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/core/extractor/bytes.rs, crates/xberg/src/doctor/config_lint.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/extractor/bytes.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"de37b5c3398f8d47a5469ae6f8d0e11e8ac3f7736edaec0b53ca722806dad016"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.redaction.is_some() || crate::text::redaction::external::external_redaction_is_scoped()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/core/pipeline/mod.rs, crates/xberg/src/plugins/processor/builtin/redaction.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c76890eefb10a7eb20faecaf43b8bfc1822e4382cdc1b57e367e5dc822e822f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.runs_ocr_on_embedded_images() \u0026\u0026 !doc.images.is_empty()\u0060 appears character-identically in 4 files \u2014 crates/xberg/src/core/pipeline/mod.rs, crates/xberg/src/extractors/epub/mod.rs, crates/xberg/src/extractors/fictionbook.rs, crates/xberg/src/extractors/html.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/pipeline/mod.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7941dfb8386cae61c2c3b6bf331e24fc2ae4604b169a328a8912dde76e9846"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content_width.is_finite() \u0026\u0026 content_width \u003E 0.0\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/columns.rs, crates/xberg/src/pdf/structure/pipeline.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"693a8fdfc78d47eccf601862961cb073758d6acc568429704ec1cb366a3e2d6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.metadata.title.is_some() || data.metadata.authors.is_some()\u0060 appears character-identically in 3 files \u2014 crates/xberg/src/extractors/iwork/keynote.rs, crates/xberg/src/extractors/iwork/numbers.rs, crates/xberg/src/extractors/iwork/pages.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/keynote.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb708d45592ef506b725488ed8c42cdfdcc6faf7864b47c83f62c0305a4b6f08"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060decoded_width != width || decoded_height != height\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/core/image_encode.rs, crates/xberg/src/extraction/heif.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/core/image_encode.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1f03ad222d970e2293bebeeeafc61b6b6a22081f64038b1958e4ac3efc4840"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060digit_end \u003E 0 \u0026\u0026 digit_end \u003C bytes.len()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/pdf/structure/assembly.rs, crates/xberg/src/pdf/structure/classify.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5624943c89efc0e22c18dd7f0211f1d7d6a268fd08bed9f6aa35286a3bdd23d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.pre_rendered_content.is_some() \u0026\u0026 doc.metadata.output_format.as_deref() == Some(\u0022markdown\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/derive/mod.rs, crates/xberg/src/extraction/derive/surfaces/capture.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/derive/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ce47b8e76940800e42c7bb700171e433342ba1035d26b672ccfd460daf5768"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entries.is_empty() \u0026\u0026 !elem.text.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/rendering/djot.rs, crates/xberg/src/rendering/json.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/djot.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19f5762a8f0b40facf69b582b4729a7b3145b1ab18dab995ce4a9813b1579ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.to_string().to_lowercase().contains(\u0022ratio\u0022) || err.to_string().contains(\u0022ZIP bomb\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/excel.rs, crates/xberg/src/extractors/pptx.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/excel.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfccb10ba27537eb001bd18edd431050f543acf39c160c6f5fd5d2c93818c28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fb != \u0022\\u{FFFD}\u0022 || preserve_unmapped_glyphs()\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/extractors/text/advance.rs, crates/xberg-native-pdf/src/extractors/text/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec88051ab80d4035128ec57deb7971d8c84e3c50fb38d741bbbf215b2d105fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060font.subtype == \u0022Type3\u0022 \u0026\u0026 self.font_provenance_cache.resolve(font) == crate::fonts::MappingProvenance::Fallback\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/extractors/text/advance.rs, crates/xberg-native-pdf/src/extractors/text/clustering.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"010ca893c7cb89a159e6329940d6a309dd0f07ecc8fc2dc7700bd1d26bd1d4be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060header.len() \u003C 4 || body.len() \u003C 3 || rows.len().checked_mul(header.len())\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/ocr/processor/execution/full_scan_table.rs, crates/xberg/src/ocr/processor/execution/full_scan_table/leader_rows.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution/full_scan_table.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a317f0248e56817339527b222640a08a5ba2c140475a682816870581e52468"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C data.len() \u0026\u0026 data[i].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/content/parser.rs, crates/xberg-native-pdf/src/objstm.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/content/parser.rs"},"region":{"startLine":3537}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f5bae5cbceafc1f4335646ee015e1ba145827b9870a9eb725b36a02dc30c4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C len \u0026\u0026 bytes[i].is_ascii_alphabetic()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/email/rtf.rs, crates/xberg/src/keywords/yake/preprocessor.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/rtf.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93ad4924e03fca66826ca0a75b32e0fe5164b0cc1483733358aab7aa2ef4bb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inline_stack.last() \u0026\u0026 open_depth == depth\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/docbook.rs, crates/xberg/src/extractors/jats/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/docbook.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f473021bc4022099f91723f0b1979ec50fdcc5de8c64ec9fa3c17319408c149"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inter_left \u003E= inter_right || inter_bottom \u003E= inter_top\u0060 appears character-identically in 3 files \u2014 crates/xberg/src/pdf/structure/assembly.rs, crates/xberg/src/pdf/structure/pipeline.rs, crates/xberg/src/pdf/structure/pipeline/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/assembly.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b411628f9e204a2e597f4e37faffc0dfa94ccf3380912aaa1f4b159410ea4a1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060intro_pos \u003C table_pos \u0026\u0026 table_pos \u003C outro_pos\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/djot_format/extractor.rs, crates/xberg/src/extractors/fictionbook.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b1b4c439b01488d15ebbac6d59376bae75f83d287c864a11947f20b9139e93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_plain_tex \u0026\u0026 trimmed.contains(\u0022\\\\bye\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/latex/mod.rs, crates/xberg/src/extractors/latex/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd43a04a9a2aae205b17dc269d2c0e839e6db074e13221715eec3e779d9efd5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key == \u0022xlink:href\u0022 || key.ends_with(\u0022:href\u0022) || key == \u0022href\u0022\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/jats/mod.rs, crates/xberg/src/extractors/jats/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/jats/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47b7f0150394edbc9803512eebbd9432415ae7553863c2790e8ad052e85ffed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len == 0 || offset \u002B 8 \u002B len * 2 \u003E data.len()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/doc/metadata.rs, crates/xberg/src/extraction/ppt/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/metadata.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"242fa029e8b46d7f9e985b4a60c116da2d3d459823053bc5d8680ee02c195a59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len == 0 || offset \u002B 8 \u002B len \u003E data.len()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/doc/metadata.rs, crates/xberg/src/extraction/ppt/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/doc/metadata.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2224627e451961f12484967b2f03337cae5473ff94fc35ff68eefae69b590d56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.starts_with(\u0027 \u0027) || line.starts_with(\u0027\\t\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/chunking/boundary_detection.rs, crates/xberg/src/extraction/email/eml.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/boundary_detection.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2542be3b35677a7018b58262b2bf470de74a935ca0b8666ee1967c3233375c13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lines.is_empty() || (anchor_y - y).abs() \u003E LINE_Y_TOLERANCE_PTS\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/columns.rs, crates/xberg/src/pdf/native/text.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/columns.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5232b91e150869799ea940a4c8328a51d77c3c8cd5bb82c76eaf91b44ab4aceb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manager.is_rtdetr_cached() \u0026\u0026 manager.is_tatr_cached()\u0060 appears character-identically in 2 files \u2014 crates/xberg-cli/src/commands/cache.rs, crates/xberg/src/api/handlers.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/cache.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbba9dfb28d82e2e978046659f2d2d950f972c58518efd38f71827a45ba041a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest_path.is_absolute() || manifest_path.exists()\u0060 appears character-identically in 3 files \u2014 tools/benchmark-harness/src/commands/pipeline_benchmark.rs, tools/benchmark-harness/src/ocr_preflight.rs, tools/benchmark-harness/src/runner/helpers.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":"tools/benchmark-harness/src/commands/pipeline_benchmark.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"565f77fc3b02c36de4db3bd0fe854636fe827a525b7595704b213fb09e19a36c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches.next().is_some() \u0026\u0026 matches.next().is_none()\u0060 appears character-identically in 3 files \u2014 crates/xberg/src/extractors/image.rs, crates/xberg/src/extractors/pdf/ocr/layer_token_recovery/latin_rows.rs, crates/xberg/src/extractors/pdf/ocr/pipeline/sparse_glyph_read.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30f9715447795e854a5f1ee8db355b0af033e5cbaee5f5c49ff4c8a8794335d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.contains(\u0022too many pages\u0022) || message.contains(\u0022max_pages\u0022)\u0060 appears character-identically in 5 files \u2014 crates/xberg/src/extractors/image.rs, crates/xberg/src/extractors/iwork/keynote.rs, crates/xberg/src/extractors/odp.rs, crates/xberg/src/extractors/pdf/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image.rs"},"region":{"startLine":7554}}}],"partialFingerprints":{"codehealthFindingId/v1":"8011e08ff7c909292ba9e067ddc7ad6a19d98c2ed9c59508a277226a659c4a3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.file_type().is_dir() \u0026\u0026 !metadata.file_type().is_symlink()\u0060 appears character-identically in 2 files \u2014 crates/xberg-tesseract/build_support/source_archive.rs, crates/xberg-tesseract/build_support/source_cache.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/build_support/source_archive.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfd0f38c15a920a8d8069984073db8f5237f5607196d66b946989f02076c319"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.is_none() || metadata.as_ref().unwrap().is_empty()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/html/converter.rs, crates/xberg/src/extractors/html.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/html/converter.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb980a2826593f07c601fb7c996d14799c4e22565a379e96dbc7a3567d09dbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == \u0022c\u0022 \u0026\u0026 kind == ElementKind::DefinitionDescription \u0026\u0026 text == \u0022definition\u0022\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/djot_format/extractor.rs, crates/xberg/src/extractors/markdown.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/djot_format/extractor.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d628b3c5fabcb797e1e0dc8aad71ef41a2d178c1aab7121efc71b7baf02b2c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next \u003C bytes.len() \u0026\u0026 bytes[next].is_ascii_whitespace()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/typst.rs, crates/xberg/src/keywords/yake/preprocessor.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a65faf1ef1a15a87f6e27645164fea312f7fb8453649bfae79d3363074cadd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized.len() \u003C 100 \u0026\u0026 !normalized.trim().is_empty()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/pptx/elements.rs, crates/xberg/src/extraction/pptx/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/elements.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7665850d1c8acace4e8c2a6aad17f91056e4a97ac4a3a12571f20d8bb467a3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outer.x0 \u003C= inner.x0 \u0026\u0026 inner.x1 \u003C= outer.x1 \u0026\u0026 outer.y0 \u003C= inner.y0 \u0026\u0026 inner.y1 \u003C= outer.y1\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/pdf/ocr/orientation_retry/two_tables.rs, crates/xberg/src/extractors/pdf/ocr/pipeline/mixed_plain.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/orientation_retry/two_tables.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1561eec68bda62cde18d7520055d8278e4f1ae6a6ead055a8903e154cdaaed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060para.heading_level.is_some() || para.is_list_item || para.is_code_block || para.is_formula || para.is_page_furniture\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/pdf/structure/classify.rs, crates/xberg/src/pdf/structure/pipeline.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/classify.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb277f2d0d59faf53cce22778fe2942404134ca5f48c257f71d9e989e85990cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paragraph.heading_level.is_some() || paragraph.is_list_item || paragraph.is_code_block || paragraph.is_formula || paragraph.is_page_furnitur\u2026\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/pdf/structure/adapters.rs, crates/xberg/src/pdf/structure/pipeline.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"17407aa8778d1e64fb856857fda1cbed090cb75679d1e27d2a88c4d9bb843ab1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.starts_with(\u0022//\u0022) || (bytes.len() \u003E= 2 \u0026\u0026 bytes[0].is_ascii_alphabetic() \u0026\u0026 bytes[1] == b\u0027:\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/archive/mod.rs, crates/xberg/src/extractors/security.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/archive/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"17410902d929dec4cd952624e78daf111b3ec5e290f9a16524efa29409e16cbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pos \u003C content.len() \u0026\u0026 content[pos].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/mod.rs, crates/xberg-native-pdf/src/document/objects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc088d32b797032b51b966e477524a4db0669de7f4102c3094321bc55c87a0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pos \u003E= content.len() || content[pos] != b\u0027 \u0027\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/mod.rs, crates/xberg-native-pdf/src/document/objects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/mod.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a5eb5fa8d8155611e2118b42b507ddce501aa4c36bb013e52645e33f452fbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefix.ends_with(\u0027.\u0027) || prefix.ends_with(\u0027)\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/orgmode.rs, crates/xberg/src/extractors/rst.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"a190721be99fc1ca3a5b4689ff0147dca06fb86e2b567a86d28ee2726e4a5a9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060produced_text \u0026\u0026 self.scope.skip_depth == 0\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/rtf/parser/formatting_extract.rs, crates/xberg/src/extractors/rtf/parser/text_extract.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff21adeb4ca401602aa9693d0b44b018d1e6e32882ecc1b9cb90a61b11d7ada6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rest.starts_with(\u0027{\u0027) || rest.starts_with(\u0027[\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/latex/mod.rs, crates/xberg/src/extractors/latex/parser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/mod.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cedd512267dd85dfe6872b5570692a705789b2103ff848ad444fd8548ce5ea4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_end \u003C sorted.len() \u0026\u0026 sorted[row_end].0.abs_diff(row_yc) \u003C= row_tolerance\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/pdf/structure/regions/table_recognition.rs, crates/xberg/src/pdf/structure/regions/tables.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/regions/table_recognition.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"707bf06d5a4d8a8a48de38e9e3162ad60613beb9b7566375fe544fab8520388a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row_start \u003E= row_end || col_start \u003E= col_end || row_end \u003E dense.len() || col_end \u003E cols\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/ocr/layout_assembly.rs, crates/xberg/src/pdf/structure/regions/table_recognition/structure.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/layout_assembly.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"504dfc7edf3efa3934ed4071c4523cf1f3b0e05e5cdc614c62dac1447af2ac47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s != \u0022\\u{FFFD}\u0022 || preserve_unmapped_glyphs()\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/extractors/text/advance.rs, crates/xberg-native-pdf/src/extractors/text/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/extractors/text/advance.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a464d297c720bbc3fbaab2bc7c2c81b67c61e4f95d24d80fce6eacad3b042012"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060script.font_size \u003E= base.font_size * 0.8 \u0026\u0026 script.text_rise.abs() \u003C 0.10\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/spans_text.rs, crates/xberg/src/pdf/native/text.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0255706110931400e4783f5fd4053510af52f205b115d5b7cefd4e9d1fc711"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment.x.is_finite() \u0026\u0026 segment.width.is_finite() \u0026\u0026 segment.width \u003E= 0.0 \u0026\u0026 segment.font_size.is_finite() \u0026\u0026 segment.font_size \u003E 0.0 \u0026\u0026 se\u2026\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/pdf/structure/adapters.rs, crates/xberg/src/pdf/structure/pipeline.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/structure/adapters.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6e4b3923142175bb2135ee5c22b751b19188cf3bcf9df631d660e52ff33c2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.left \u003C other.right \u0026\u0026 other.left \u003C self.right \u0026\u0026 self.top \u003C other.bottom \u0026\u0026 other.top \u003C self.bottom\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/image_photo_title.rs, crates/xberg/src/ocr/caption_grid_proof.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/image_photo_title.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a189980c6c415f7c7860acc0e0735f6ee2ac229c592f858a38263cf5dd302e87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.schema_version == 1 \u0026\u0026 !self.qualified\u0060 appears character-identically in 2 files \u2014 tools/benchmark-harness/nli_qualification/src/plan.rs, tools/benchmark-harness/nli_qualification/src/report.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":"tools/benchmark-harness/nli_qualification/src/plan.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"656a93a32fb8a613de981216f81c3ca1a658411c30c0cbc38d0a3042058d9422"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.scope.expect_destination || self.scope.ignorable_pending\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/rtf/parser/formatting_extract.rs, crates/xberg/src/extractors/rtf/parser/text_extract.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fb888a615dd798a7b6db547b2e5d280bebf9dd36c9812031e503cca43914f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.scope.skip_depth \u003E 0 \u0026\u0026 self.scope.group_depth \u003C self.scope.skip_depth\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/rtf/parser/formatting_extract.rs, crates/xberg/src/extractors/rtf/parser/text_extract.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/rtf/parser/formatting_extract.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efc7cfe67cb25d727b5bf029cb57e3ce22552c809ca9e703e328dacc0a2f940"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.x0 \u003C= other.x0 \u0026\u0026 self.y0 \u003C= other.y0 \u0026\u0026 self.x1 \u003E= other.x1 \u0026\u0026 self.y1 \u003E= other.y1\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extraction/diagram/mod.rs, crates/xberg/src/extraction/image_ocr/pdf_gap/occurrences.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ae4046313ea62fdb01d850199045e6cae832ed09daad5d0967af1ea4a049d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060span.font_size \u003E 0.0 \u0026\u0026 gap \u003E span.font_size * 1.0\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/document/spans_text.rs, crates/xberg-native-pdf/src/structure/table_extractor.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/spans_text.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67c7274076f86d8708534c5e7ad69168a1b3c2a88408d51f546f4007243635e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stage.paddle_ocr_config.is_some() || stage.paddle_ocr_settings.is_some()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/doctor/ocr.rs, crates/xberg/src/extractors/pdf/ocr/pipeline.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/doctor/ocr.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0961717d15c257464a0dfc6dcc2b528598ff4957b6d2bae1da733257ef3832"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start == 0 \u0026\u0026 data.len() == element_count\u0060 appears character-identically in 2 files \u2014 crates/xberg-paddle-ocr/src/inference/ort_backend.rs, crates/xberg-paddle-ocr/src/inference/tract_backend.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-paddle-ocr/src/inference/ort_backend.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae711a0afaefadbb8c305e8d67bb69783ed2f313d6642d16723aeb34e5fb44c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::env::var(\u0022XBERG_LLM_API_KEY\u0022) \u0026\u0026 !value.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/xberg-cli/src/commands/overrides/llm.rs, crates/xberg/src/core/config/extraction/env.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/overrides/llm.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf8e28857b0ccbca0ab178e2217eee98ab4c3fd43443c623af0f6a944c0cd6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tatr_result.rows.is_empty() || tatr_result.columns.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/ocr/layout_assembly.rs, crates/xberg/src/pdf/structure/regions/table_recognition.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/layout_assembly.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1eec99b627982e39f2c95d8d54155f8b38b08447f6ffbb23abb82fcf8a0827"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.is_char_boundary(start) \u0026\u0026 text.is_char_boundary(end)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/epub/mod.rs, crates/xberg/src/extractors/html.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/epub/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abbdf7771e25b2900696a3e25023b5f546a1cb96559c8e21c23371ee32fd45b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.contains(\u0022\\\\begin{\u0022) || trimmed.contains(\u0022\\\\begin {\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/latex/environments.rs, crates/xberg/src/extractors/latex/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/latex/environments.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0464f234f56de67bba84c5060d21503ac56bd2ad4e65270c1491fb38dd010baa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.is_empty() || trimmed.starts_with(\u0027%\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg-native-pdf/src/xref.rs, crates/xberg/src/extractors/latex/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/xref.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"273ddfa35e487b55dc5017aced91d39c0b14e1ae789740b36554c3763dc13f9a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0022\u0060\u0060\u0060\u0022) || trimmed.starts_with(\u0022~~~\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/pdf/ocr/scoring.rs, tools/benchmark-harness/src/noise_detection/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/ocr/scoring.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3dbd4ce3c0297a34b883d1dacf10e9f27bf876faa837f2ad515f636adc4d7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0027{\u0027) || trimmed.starts_with(\u0027[\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/chunking/yaml_section.rs, crates/xberg/src/core/mime.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/yaml_section.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9dee4960fa43564979c2ba7d0a070c7161aa9b4d695e7a56784fcdc315ac22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0027|\u0027) \u0026\u0026 trimmed.ends_with(\u0027|\u0027)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/orgmode.rs, crates/xberg/src/text/token_reduction/filters/markdown.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/orgmode.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a985580b3532136594111cc0f4f007889e7399938105a370aea6fff69e18f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uri.starts_with(\u0022http://\u0022) || uri.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 3 files \u2014 crates/xberg-cli/src/commands/extract/mod.rs, crates/xberg-cli/src/input.rs, crates/xberg/src/api/handlers.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-cli/src/commands/extract/mod.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b60adf8bfcd1b4c4ba4f70c6bd300490383421242288377faa943261ba51e57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usage.source.is_empty() || usage.source == \u0022vlm_ocr\u0022\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/enrich.rs, crates/xberg/src/plugins/processor/builtin/captioning.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/enrich.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f534b656d177ad300dab51f82bbfcd8dacaab33e6f031de87f9995641d68920d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060warnings[0].contains(\u0022not valid UTF-8\u0022) \u0026\u0026 warnings[0].contains(\u0022replacement character\u0022)\u0060 appears character-identically in 2 files \u2014 crates/xberg/src/extractors/code.rs, crates/xberg/src/extractors/text.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/code.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"317e8eaa7d67ed9e1bbd1e305f290218cc01239362690ea3e2e7eae758d48651"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions override nullable warnings: ~1.5 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 201 suppression(s) across the 136402 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4ae9a4afaefbfeb512a0b9a87d1bd44cd285ab1e804e4b89c8cf80f255687dfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_language_sidecar\u0060 returns \u0060{}\u0060 when \u0060(json.JSONDecodeError, OSError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/benchmark-harness/scripts/build_corpus.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"713aa94c5fdeba56e6170c832d763eb2f102bc91f5e77aa40a0f28eb5270be06"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sans_code\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/pdf/font.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd5f4ff57cb4a9f79cc745351b542862299a60b7241af1475fa13fa5ac89017"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060openapi_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/api/openapi.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"735199785762812304959e4d17bf0e84e6e1d46c4f491bf241ddca7ba33eec3b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060flatten_json\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/yaml_section.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13a11e013c828a6ba10cb2837c240e722649ccee4c29e91b801ea56270fa0e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060flatten_yaml\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/chunking/yaml_section.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25d79e6766c0944984447b8f6b4d56cffafab242a36f92f7fb4c51450783211"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060unknown_dirs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/doctor/cache.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1c0a2eccaeb09a3b039005500c07ef7230a3b23bca083a1c2405b316d93a85"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060input_cache_dependency\u0060 turns every \u0060Err\u0060 into \u0060CacheDependency::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d74254a4c2aec91e6ab88700a43f5753e03be2cd2dc4549a1ce915c5b9f060b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060normalized_content_type\u0060 turns every \u0060Err\u0060 into \u0060\u0022text/html\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/engine/extract_impl.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d27f3abc3ab75b89444651d3d5b745e8b59263baf5fa078a20c403172623d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060length_value\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":"crates/xberg/src/extraction/diagram/odf.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd39185db0c0060fa7453bba7afd47ca07248ace59af5fb663a3855422972a1d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060recover\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/diagram/pdf.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc0fd80aa221d6ae9e7c8b9fa800447e247af981e9e5f549440f598872ceeea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060direct_child_storage_paths\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/msg.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7363fae1086f3497ca27c6ca5f38a055d2c74a2e41edc8ba93a797274d7e1895"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_msg_recip_type\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/email/msg_props.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec9a99157f05c48ec56c2e42b4c4c69d4eb48d82003f017d8e47bb3bc3f82d6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060convert_mathml_str_to_latex\u0060 turns every \u0060Err\u0060 into \u0060Ok(String::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/mathml.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e9784e8bf7b47d02917ebdc26fd25db6ca350187856ed05e48983f34e62d50"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_slide_images\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f66dde3bf30ce9104f0b559bc88a1e5770be314b7121c09f2d00a3b0c2f8a2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_section_names\u0060 turns every \u0060Err\u0060 into \u0060Ok(HashMap::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extraction/pptx/metadata.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a7fdd11dd49f94396db63cd6e066dec4909d3790830946e8bce3fd19d66cf6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_metadata_from_zip\u0060 turns every \u0060Err\u0060 into \u0060crate::types::metadata::Metadata::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/iwork/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ed62375fdb6eb3f7c87b233f804f260152c48bdb4795c2cdcb49607bf3b5e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060native_script_pages\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/extractors/pdf/unreadable_script.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed490337b017dc77fef5c8ac83a934b4530ffd221e1932c26c2d2cd3b85fb50"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060build_content_with_inline_tables\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/ocr/processor/execution.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9091bd2e3b78dcc18f380a24d0d0e058cb83353a5fbcb6d1d4ce03ca01c85c5e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060page_ocr_fallback_image_bytes_with_limits\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/native/images.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8cddff5db042a3823d0a25d186b8d28e6b50feae98c28623447b6bd9089ffe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060fabricated_provenance_page_indices\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/pdf/scan_detect.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea92f0b8bf4a49113a2fb128718a094a06d3b3e2106cbcb22df3b6fed016331f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_annotations\u0060 turns every \u0060Err\u0060 into \u0060AHashMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/table_math.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17cfc64bc336c16f745e3931626703bb364f2fdf94b221525d3d33dafc0d669"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_annotations\u0060 turns every \u0060Err\u0060 into \u0060AHashMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg/src/rendering/table_scripts.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"036fb42fe62263ef3179c1526301dcc797489dbbd27078cb7e1c2bfdbdcd4f82"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_widget_spans\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"492829b6390d37870644176d2ed6445cfd4794a2eedfe312aca98acc6f7a5241"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060annotation_content_spans\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/annotations.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6d9457de1ea0b63f36efe7c967e910c57351526ed0f6b7c20b42b0be45cadf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060page_image_handles\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eb1e257d0ae2707b2eff8ce2e15eff0035f5e8b8b7e8ecfecb42b02ac0837a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_images_filtered\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/document/images.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f443044717053aa2942e45bba8e1a352bd56f944ceca38ee378cd4789d0f86e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cbom_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/crypto/cbom.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f55aa50101fe16b1ceb48b25df3c9b6f2ea85c1d8f7bff80d1160fd9de44cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_article_threads\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/structure/article_threads.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ef5ecee685427245e76fbb398b52a4750ed583c1ad4c50f7603b3b538ea54e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060register_engine\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-tesseract/src/api.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"d431afd7ccefb5f26a859205930d3f7267398836e9eaa037712c10c123aa0beb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060key_values\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":9851}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f92e558b463b0ed804b80e3ea10e3bda13e1bf5ba33fe76ed64afccbdb9f9c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060page_spans\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":10609}}}],"partialFingerprints":{"codehealthFindingId/v1":"809c7402617a0c01ebe9a75704647a71524492d985da45eed23e95e586425c27"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060classifications\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":10616}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27130adc46d1a26e1f9169e1796f62c4005dd09c40f722080565fa65fcbc55d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sizing\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":10695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76dc975a59eacf198e51cc1a844f8f8f0892b1a6a02d313f4a42c150a8a09d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060attributes\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":10882}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7cf1ffe86949b8662537755a963f4972e48a80022f5640ea970594de514575"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060children\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":10889}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf28467432bb5de494702d9bb2d78ba82fc1325c6ef14919a0a4db9fd0e716a4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060chunks\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":10922}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaad3a8a46efa94b0285fc2b5f3fe1bbfcf26a59baff3a2a143492203709897a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060auth\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":11993}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57230caea5078d0ebbc216e04aa9f32ed84e2f0e4adab32f15547548abf8f94"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060fields\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b870eb7392dc01936f287a95d4ff6be30873da50a2fb12349887abcbb6211f5f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detections\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ee69b01684985ac35b7bbba1b987b0367ee3626fef20f35062db0c867b216"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060lines\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12371}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4be1a35b42288128253231bf1ffa470f210b034d0346ab374b0d230be1853e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060checks\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8279da668438a4e72d995caf47ada5b1affa1059638aabe4925b71d5f84c82"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060content\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12627}}}],"partialFingerprints":{"codehealthFindingId/v1":"596673a59a956d2cfc9d1863e2a6267b46860fa66321555ed216d7494d3617fb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060annotations\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a75c418f479fff1f721d383b28c7d5116738f32f9c878bed4b3517e9f047a43"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060anchor\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12711}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0ca9e815332f56f87ba777bf96171d57c9b6a4692a5c4aaf4dada026cbf7f5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060nodes\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12743}}}],"partialFingerprints":{"codehealthFindingId/v1":"131709d8b5d09fae8334e38a32545f43dde76ca2053497ee97e830565887480a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060relationships\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":12753}}}],"partialFingerprints":{"codehealthFindingId/v1":"2892d40b35763c24ece1de4b8849545f2b1c3ab0529049f0f2b1918693e77f24"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060model\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":13269}}}],"partialFingerprints":{"codehealthFindingId/v1":"54af8b7c9ce4b60d4fa2ba4a5057697b067f55b9448d9d18e3cb13f7ae62235c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060category\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":13314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ac28a28f65dfa2d45f527526f7ecc116fa28ce9c4ab815c0f61353279d6179"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sheets\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":13452}}}],"partialFingerprints":{"codehealthFindingId/v1":"110ad0ba51be5b879910757393e66852579f00604183b2150bfd85126937cb8a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ocr_strategy\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":13853}}}],"partialFingerprints":{"codehealthFindingId/v1":"e273c004605aa605b4f0fd12bea9884c91e6fde423e5e19d3abdbb2845803039"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060output_format\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":13946}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f2217fb3beae71d139d1d76bf9fa7378eea931af240eea985e6094ebb29a20"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ocr_strategy\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":14367}}}],"partialFingerprints":{"codehealthFindingId/v1":"81de291ff422079be3da07368027bbaea04237dc9d225c70556e6012e852b15e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060output_format\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":14419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2c428a839695ed8e10b88c5c755a1f09de1a2ac09b087ff5e60a291f6d8429"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060content\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":14496}}}],"partialFingerprints":{"codehealthFindingId/v1":"1618f103cac02d252bbb35e34bab6c1201d8c45656425d91ccb0d22d5cebe077"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060inline_content\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":14576}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b870071e394cb18023a20f8817e034dde11b4ec9026952a2b09868119ee3808"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060children\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":14592}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c93fb70142fd325f5cbe41ab75866e93eb47f22120e5aed82df1012762688"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060headings\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":14771}}}],"partialFingerprints":{"codehealthFindingId/v1":"483f107923c548be792fd3ea6351b09c694891c3d877942a84d8f83c1debd1d0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060headers\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15033}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bf90b65c1ecb7bdadef53af7ae5dfd26f09600eca4713c9167a89dbda4a633"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060links\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15040}}}],"partialFingerprints":{"codehealthFindingId/v1":"de75b0645ea3c0c7ef0f5ebc5005f051d6961478118625969e4c647049033237"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060images\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f14c15355dd5a6b8fbda4489e70d3fe8ead1c5d885efc4df59ea5cd4036695d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060structured_data\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15054}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874a4da5cf34f0cb8542284253fdc8667dec9c43a3cccea529b2b587e788828"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060output_format\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15277}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c252a7c742b9a8d0d9dda1f60650ca406aa12c9bfef9242782fdbec499ff2e1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060attributes\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff36a4d91d7229d8cc95c2abecc8705cb36e694a8263c6c495226d46aedbdd6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060contributor_roles\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15501}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6336a804fa40ca2a4262615c741a260e3fe1f0eb6d031e3688c3954381ec60b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060model\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15697}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ccd20725dbb591676611e43f534f5ea90eef07d7d970b0106a381c809914a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060attributes\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":15977}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4bc0f799cdefac91c1f825cfdbbed4336756fcb560f92dafedae47ed70b90f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060credential_provider\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd802a4a277ae87d0970bc9d4280a67c13a2c01f502f16162fe83d112470112f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060urls\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b88f5d89c5bb4d5e68718402607bba59541b6ccf1eb6561d309e44aaec0a598"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be42efd013a39e80d52160e7db5812965ef6d592de1cdc67c08def56bbdcee4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pages\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2829e54d8567c8500183ecb0febe967ef4bd2f8edb15a98687f32d5316e90bc2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060categories\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16593}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8265e5e58257c180036bbf56394f98509efdee14951fda2eb9c1ee222d1a9c7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060output_format\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16698}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f09301ea6f8b316f0ac5b582ef46434ff10ec5ae6951d0b0268183250ccbc4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060vlm_fallback\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16732}}}],"partialFingerprints":{"codehealthFindingId/v1":"72add5ed00748907c460d168abf1645fabfbaec9ba4c2c6422b4869f9d27dde2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060geometry\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e4dc4648cd740c7cc9557919eb41e1437283462459f73e530c15342963860b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060tables\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":16845}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db519ada62828767d3efcd3dab881c8805adde3e3aa721a5c654a4aa22f2a84"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060labels\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":17652}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fa32e0271ba657244b252a43f7219bb59977b8bb9ef47f5019a9d7d45e6795"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060tables\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":17732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acfb26faa793ce87e521c9a288e8d92094ae07876e9e0d7d44e7a93c7e331fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060blocks\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":17810}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07e475dd60d31875b0d3559415db5506be796969dd54eaeeb148c8035fe86b9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060category\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":18006}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7165e3c1c704f70f44772834fffec18b1e0ddfe2c9c399aa332d9ce36955177"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060categories\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":18893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea83411f5483b0445c583b0a78e4a4ea40abef81915130a5fe5882d4ff1e88e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060category\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":18967}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c4a2b01006c46105c1839f9de907b9e05459cfc8209663db2206ce7f904009"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060findings\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":18999}}}],"partialFingerprints":{"codehealthFindingId/v1":"376884569ba4449927867084dc1720032bcea5fb9d8d868c85f8fd41196bb290"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060model\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19121}}}],"partialFingerprints":{"codehealthFindingId/v1":"507b18106003e87843acd5a63e4f6072c3446ce1fd24352fccaf6c8f0d65b92d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060content\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1edc7845b373db94412cbdc3968616dfd3f871a968aa0d3346e52ca7039e91b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060table_changes\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e86a7ece81aeb40c63d3e324f6ac254e5667eb4d898485af32bf8d41f7cadcb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060property_changes\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19227}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6db956572f5afdf7e1b745d6ef05f654eeeb417087ed2d6bf068f80856a21bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060model\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19506}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f7aaa287568b439c5b4a685f7c872bce8726d912e2191f1b0cd727b20ced36"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060allowlist\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c9c41344c497acb2f009e31c7aac75136183a537148d6d1c21c5d1392caa74"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060denylist\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d214685935f4e267ae295011a200ade491316cde0527c5426a91f00df0cbbee1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cell_styles\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19789}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fb357d2934590e4cb3a587a7d1c4f373ccae65ef93b059a0486d0d44d976ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cell_changes\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19886}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3397a20da22501332d79a0998e0c280b7ca9c7a9b66b03f26ac0992c5e5a8e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cells\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":19916}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c707fa88a5f7f5681ea3686a62383ed1aa20b7d715d6df84815dd4a5b14309"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060kind\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\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":"packages/swift/rust/src/lib.rs"},"region":{"startLine":20108}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f256b505e29216d2ff1b8b3c0ec977155a31e1f8fd420f495760ba190ed34b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060warnings.contains(\u0022knockout\u0022)\u0060 can never decide this \u0060\u0026\u0026\u0060 \u2014 every value satisfying \u0060warnings.contains(\u0022non-knockout\u0022)\u0060 also satisfies \u0060warnings.contains(\u0022knockout\u0022)\u0060, so the \u0060\u0026\u0026\u0060 chain is already decided by the former. The expression is equivalent to the chain without it, which means it is narrower than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/xberg-native-pdf/src/rendering/knockout_work_tests.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62d30bbfb3d1a65fc079c6de495a8f0dfb3ddb6dd460579c34ff1deeeeeb14a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name.contains(\u0022KSCms\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name.contains(\u0022KSCms\u0022)\u0060 also satisfies \u0060name.contains(\u0022KSC\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":"crates/xberg-native-pdf/src/fonts/unicode_decode.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d1b40ff60ff3794bed06e7f0055b11e4b228062f6ee8b23376a6a5b215eb8c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060stdout.contains(\u0022text/plain\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060stdout.contains(\u0022text/plain\u0022)\u0060 also satisfies \u0060stdout.contains(\u0022text\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":"crates/xberg-cli/tests/commands_test.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"992a21c31991c203866d5a0382898378c2078c99af739095fe5688e86bb3b24d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060stderr.contains(\u0022Invalid chunk size\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060stderr.contains(\u0022Invalid chunk size\u0022)\u0060 also satisfies \u0060stderr.contains(\u0022chunk size\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":"crates/xberg-cli/tests/commands_test.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af31f6cff316affef14dfc76a025e29d4c908dcd0ca4213382599a76b15fea4"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060stderr.contains(\u0022Invalid chunk overlap\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060stderr.contains(\u0022Invalid chunk overlap\u0022)\u0060 also satisfies \u0060stderr.contains(\u0022overlap\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":"crates/xberg-cli/tests/commands_test.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"81441721e2218ec6765c5288dccea5f749c9e53403c735c1c883a63dcb3e7045"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060stderr.contains(\u0022Output directory not found\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060stderr.contains(\u0022Output directory not found\u0022)\u0060 also satisfies \u0060stderr.contains(\u0022not found\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":"crates/xberg-cli/tests/commands_test/part2.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"626ad3f32c511e9fba0a5f15624a7c523801e53afe5a69fdc7fd26077e0b79a3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022\u6D4B\u8BD5\u6587\u4EF6.txt\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022\u6D4B\u8BD5\u6587\u4EF6.txt\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022txt\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":"crates/xberg/tests/archive_integration.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71e7e36c373b2b142489061fc822165adc1f3ac0b4d9385265a2f0b762d4e46"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022**\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022**\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022*\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":"crates/xberg/tests/config_behavioral.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"912d38280cc529cb095638244a308d20d04ab797ebd1905add0827481beac091"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060extraction.content.contains(\u0022dataclasses\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060extraction.content.contains(\u0022dataclasses\u0022)\u0060 also satisfies \u0060extraction.content.contains(\u0022dataclass\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":"crates/xberg/tests/jupyter_extractor_tests.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5eb2268a130311cf7b9e020e45d85bed71756d8d7c3b6b9ecef76f78ec1bc4e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022mc\u00B2\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022mc\u00B2\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022mc\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":"crates/xberg/tests/latex_extractor_tests.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc6fba83dcd5277e8238c7dda1d615b280f2087362f3e1d561e6ee017fa6e11"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022Additional markdown reader tests\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022Additional markdown reader tests\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022markdown\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":"crates/xberg/tests/markdown_extractor_tests.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78d699609b93e4ea8fae7bdcbf4975896a2715074359555bc128c239fe632bd"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060message.contains(\u0022language\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060message.contains(\u0022language\u0022)\u0060 also satisfies \u0060message.contains(\u0022lang\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":"crates/xberg/tests/ocr_errors.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"633d45d306ded4ed2ef50df34c2d193afbcb62537e16b053a3b89e30634fc86d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022**bold**\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022**bold**\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022bold\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":"crates/xberg/tests/odt_extractor_tests.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5890200cfb738e8c9260c669dcc264332291ebbf2233b2422ab4566e510f720"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022*italic*\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022*italic*\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022italic\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":"crates/xberg/tests/odt_extractor_tests.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1d3c82c02229a1571568be592b10543e94731b5b58fc9ed5f101b667a6f7e6"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060content.contains(\u0022striken\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060content.contains(\u0022striken\u0022)\u0060 also satisfies \u0060content.contains(\u0022strike\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":"crates/xberg/tests/odt_extractor_tests.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cebff4bde7b394b049ff697d847c8a92a7b4cec7864b1419da2fe7c51a0fe7b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022First Section\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022First Section\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022First\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":"crates/xberg/tests/odt_extractor_tests.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff57587b14830224b7738eccd6d550f1fdae8c5615d98cf4a08f93372f1615e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022Second Section\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022Second Section\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022Second\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":"crates/xberg/tests/odt_extractor_tests.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3f5f338bf32958dbfa61f576933530f5c8d60e61fae3632cee3f40fa3eeb7d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022Third Section\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022Third Section\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022Third\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":"crates/xberg/tests/odt_extractor_tests.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"333614cec67559ec1c7f206e2dbe74766b101f20f0f63aa6ee3f7f0c70e33405"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022123\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022123\u0022)\u0060 also satisfies \u0060result.content.contains(\u002212\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":"crates/xberg/tests/orgmode_extractor_tests.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"98784c7a4a6590de39723aedba64b194b0de2cba7a128e904326724477c19a06"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022Caf\u00E9\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022Caf\u00E9\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022Caf\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":"crates/xberg/tests/orgmode_extractor_tests.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"316a21aa575a75bf90a0ec1dffeca0159e80d6ddc4c05e1f82e7f20baad8a31f"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060content.contains(\u0022native page one\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060content.contains(\u0022native page one\u0022)\u0060 also satisfies \u0060content.contains(\u0022native\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":"crates/xberg/tests/pdf_ocr_error_not_silence.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad5f93bceeb4bd5bde2348c3d8ff34b356f47be76ce81bbd1fc63b17e3b372d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060content.contains(\u0022PDF backends\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060content.contains(\u0022PDF backends\u0022)\u0060 also satisfies \u0060content.contains(\u0022PDF backend\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":"crates/xberg/tests/pdf_output_quality.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"1974eba99c728281c5fa21b45bd7adb0e567b697860db5d4a4322f7695be1e0c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022Level one header\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022Level one header\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022header\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":"crates/xberg/tests/rst_extractor_tests.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd61e92419d62c5bc8e5bdd80bf7e0bc43dd6807d04da1496bb6f5a173788c9"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022data Tree\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022data Tree\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022Tree\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":"crates/xberg/tests/rst_extractor_tests.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e74d3703ef2360c7a271ef499bbe050202977d8e8548d60d37d973a6a5b5854"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022link1\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022link1\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022link\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":"crates/xberg/tests/rst_extractor_tests.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5284767791d0edf5f1ef829801a6f43691f0535571c342481e3836d5a19b72"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022link2\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022link2\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022link\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":"crates/xberg/tests/rst_extractor_tests.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3516d97c338c6d824dd4d575465d34ecc08b16fe3ecdd45f06b4d9cc8c8d4dbf"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022First paragraph\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022First paragraph\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022paragraph\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":"crates/xberg/tests/rst_extractor_tests.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffc248dbc385e4d32a7b27ee09b55eabd59a636570c61ee3fe9bc4b0c06f105"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022entire bee\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022entire bee\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022bee\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":"crates/xberg/tests/rst_extractor_tests.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"667c9971c33733ff5f50711d4a89a991e0f713cbf29223f31e320ec6e17b0c43"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060extraction.content.contains(\u0022__\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060extraction.content.contains(\u0022__\u0022)\u0060 also satisfies \u0060extraction.content.contains(\u0022_\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":"crates/xberg/tests/rtf_extractor_tests.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58aed7895574089977d0a19c0ea1029770c5ef6de7d55aadb194e82d652d93d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060extraction.content.contains(\u0022~~\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060extraction.content.contains(\u0022~~\u0022)\u0060 also satisfies \u0060extraction.content.contains(\u0022~\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":"crates/xberg/tests/rtf_extractor_tests.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb5a1ceef8a1af21b783c479b98722c834e1f9c28507a160b3cc13d44dda268"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060content.contains(\u0022out of list\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060content.contains(\u0022out of list\u0022)\u0060 also satisfies \u0060content.contains(\u0022out\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":"crates/xberg/tests/rtf_extractor_tests.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cfeaa5f387d73cfebeb7da71894ac01b63259a2aa9dc31f26766b572f2073f"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022This is a blockquote\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022This is a blockquote\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022blockquote\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":"crates/xberg/tests/typst_behavioral_tests.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c75cff82a2dcdd1383af819083d3288281da315f32524de47b5895f6fad147"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022*bold*\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022*bold*\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022bold\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":"crates/xberg/tests/typst_behavioral_tests/regression_and_stress.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"36784b6811abd0434963558a73da0338c8d79e4e86527874e57f7a597e72fecc"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022example.com\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022example.com\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022example\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":"crates/xberg/tests/typst_behavioral_tests/regression_and_stress.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea6b7c4d2ea1f4bde815f798bc15fcf29baf459784fe4d46fce126c608832ea"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060result.content.contains(\u0022TABLE\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060result.content.contains(\u0022TABLE\u0022)\u0060 also satisfies \u0060result.content.contains(\u0022A\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":"crates/xberg/tests/typst_behavioral_tests/regression_and_stress.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf65fd795e2ef66add966870fc3773a501d3674ba49573f62e8b34305151d8db"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060name.starts_with(\u0022libonnxruntime.so\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060name.starts_with(\u0022libonnxruntime.so\u0022)\u0060 also satisfies \u0060name.starts_with(\u0022libonnxruntime.\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":"crates/xberg/src/layout/models/pp_doclayout_v3/production_parity.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"17eef8d2f8c5a83b45b50394c1356ca9142ae2e51100d7417ceab80a8b374974"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060output.contains(\u0022*bold*\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060output.contains(\u0022*bold*\u0022)\u0060 also satisfies \u0060output.contains(\u0022bold\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":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad08daebecf81a5fc87b0db4eb0614410e430d89de73451961d03b404579ff60"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060output.contains(\u0022_italic_\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060output.contains(\u0022_italic_\u0022)\u0060 also satisfies \u0060output.contains(\u0022italic\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":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1539a46797ed128b215dcb80c5a17e84c6403ba810f5b887effd9c2532c8c43"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060output.contains(\u0022\u0060code\u0060\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060output.contains(\u0022\u0060code\u0060\u0022)\u0060 also satisfies \u0060output.contains(\u0022code\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":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b676bf543d2cc570d9a2e30327324808fbe17d61020fd7b0d031fa252314b3fc"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060output.contains(\u0022[example site](https://example.com)\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060output.contains(\u0022[example site](https://example.com)\u0022)\u0060 also satisfies \u0060output.contains(\u0022example site\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":"crates/xberg/src/extractors/typst.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f5c71caecd01509788fd11fb7bc70019e31f62e18f1d30f9e57cdbe9ea8e5d"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":1014,"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."]}]}