{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"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":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"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":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::project_to_grid (cyclomatic 180): liteparse::projection::project_to_grid has cyclomatic complexity 180 (threshold 15). To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b892abf821a71d0a17ea8baab7c9a84a2997a31089c2a58d2303a772555e260d"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::xy_find_column_cut (cyclomatic 101): liteparse::projection::xy_find_column_cut 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaf284344fd4e0ebb73577347a7fe7978dbcb9d65cbd2211d49bce0e8267e32"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::xy_cut_rec (cyclomatic 79): liteparse::projection::xy_cut_rec has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb98ac817c44d413ba795264e895c8bd024bec21a71b63932a9e5e6e8cc561a2"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::form_lines (cyclomatic 78): liteparse::projection::form_lines has cyclomatic complexity 78 (threshold 15). Of this number, 55 points are the body\u0027s own statements and 23 belong to 4 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc0fd1f17f0aceb08efa9abd295a9cc4e0d37fe4aec1de719c8da4c6fb94f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::extract::extract_page_text_items (cyclomatic 76): liteparse::extract::extract_page_text_items has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f160e290241d46391eb7f7d8ae8a4a5246b6eb6a343279ac755a6467fe6fc67"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::assign_cells (cyclomatic 49): liteparse::markdown_layout::tables::assign_cells 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"20477df5b46bd41d938223664bdf336ae9167387460d05c31099ce63a41bb63a"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::classify::classify_region (cyclomatic 48): liteparse::markdown_layout::classify::classify_region has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe4aa0a085bf670515674b082041dc884f2acb145fddbef64cb2f7487c6044c"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::handle_rotation_reading_order (cyclomatic 46): liteparse::projection::handle_rotation_reading_order 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"74336c8ee88ca82faebdaa2a156d791216e795370bad15797680f484c9156b82"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::classify::classify_page_with_filters (cyclomatic 43): liteparse::markdown_layout::classify::classify_page_with_filters 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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1fe1d1e590cf58116d431b7c700b24743f2845c2cc5898a6a8ccb97f34a398"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::union_header_from_above (cyclomatic 43): liteparse::markdown_layout::tables::union_header_from_above 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"e481ac3b959ccf7084fccb2cc7513d5aecbd8420f0533b05fbe634575bb0141b"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_detect_table_inferred (cyclomatic 42): liteparse::markdown_layout::tables::try_detect_table_inferred 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baedd2a4b6e0cb521210d1407ac72bd3ba16c212c613eedba3df19acfd8a105"}},{"ruleId":"D1","level":"warning","message":{"text":"LiteParseConfig::into_core (cyclomatic 42): LiteParseConfig::into_core has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse-wasm/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"18590125fcf01568c64369e12a09d84ad307314eb8aded6e87e28ff497863f44"}},{"ruleId":"D1","level":"warning","message":{"text":"LiteParse.__init__ (cyclomatic 42): LiteParse.__init__ has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/python/liteparse/parser.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"740f50494e7c7ef71370619db8fdc3a8035ccf775407091fbcd5717890860a10"}},{"ruleId":"D1","level":"warning","message":{"text":"JsLiteParseConfig::into_rust (cyclomatic 41): JsLiteParseConfig::into_rust 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/liteparse-napi/src/types.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf65fdf01b6db97fe4e05f6b6296cc54f0b183ef38805e4f638978699ad26ea"}},{"ruleId":"D1","level":"warning","message":{"text":"LiteParse::new (cyclomatic 41): LiteParse::new 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/liteparse-python/src/lib.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a407d6c58fcf4537102b1c36524af79fdfc625fb04a0b61a30740fa096e344"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::cross_region::find_cross_region_table_merge (cyclomatic 38): liteparse::markdown_layout::cross_region::find_cross_region_table_merge 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/liteparse/src/markdown_layout/cross_region.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"820b97f73ab5930c54dab3f3e25d0e04ca638187147f724fd08ea840d853958c"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::build_one_line (cyclomatic 37): liteparse::projection::build_one_line 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19a6e1a572a4698d2c78044335a5fcc9ee24a995cef584e2b6f6b78c9a47e34"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.program.command(\u0022batch-parse\u0022).description(\u0022Parse multiple documents in batch mode\u0022).argument(\u0022\u003Cinput-dir\u003E\u0022,\u0022Input direc (cyclomatic 37): cli.program.command(\u0022batch-parse\u0022).description(\u0022Parse multiple documents in batch mode\u0022).argument(\u0022\u003Cinput-dir\u003E\u0022,\u0022Input direc 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":"packages/node/src/cli.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd2c54a36c084b74c512693a34d5c105c86854953ca512c277f9efc55ae2a16"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.program.command(\u0022parse\u0022).description(\u0022Parse a document and extract text\u0022).argument(\u0022\u003Cfile\u003E\u0022,\u0022Path to the document file\u0022) (cyclomatic 36): cli.program.command(\u0022parse\u0022).description(\u0022Parse a document and extract text\u0022).argument(\u0022\u003Cfile\u003E\u0022,\u0022Path to the document file\u0022) has cyclomatic complexity 36 (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":"packages/node/src/cli.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24f57bc7a547f60ed91912c45514090fcf825e5e3228ba5574a14a94a9dd9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::main (cyclomatic 33): liteparse::main 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/liteparse/src/main.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"84685d268128983f2191ad9bd2448e17902f4cf79864735c8e152dd9b670c915"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_detect_table (cyclomatic 33): liteparse::markdown_layout::tables::try_detect_table 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"96534a258348fb8f8cfb1efcc7378abea0b409ac6ba0b636a7ecd45b8b30eb44"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse_python::cli::run_cli (cyclomatic 32): liteparse_python::cli::run_cli 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/liteparse-python/src/cli.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b7bc8b0a0c47177b2e87cf5bb0de885d7e572da36d113f335b23271d412c5d"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::ocr_merge::merge_ocr_results (cyclomatic 31): liteparse::ocr_merge::merge_ocr_results 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/liteparse/src/ocr_merge.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d13a69568a239ed4b849f5bc0f0880cf3053d9dc5feeca2a7cea94d6f61505"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::detect_and_render_flowing_lines (cyclomatic 31): liteparse::projection::detect_and_render_flowing_lines 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"276930112eb28030b3cfd6d8eb98ab2257228e6391026496f71ba64ac484d21d"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::font_cmap::reverse_cmap (cyclomatic 30): liteparse::font_cmap::reverse_cmap has cyclomatic complexity 30 (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/liteparse/src/font_cmap.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e6c9ec48f05a2ab9f4e7396de9804bb769f95e46e1f2eb4ec616abd1f35f80"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_merge_pair (cyclomatic 30): liteparse::markdown_layout::tables::try_merge_pair 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"563983f131cd05ac21db3b59326cf1ae63bca02dac39f34564beeaccbd13502c"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::build_ruled_table_from (cyclomatic 27): liteparse::markdown_layout::tables::build_ruled_table_from 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf0eb660090c06dbd0643e87c844483b9956aba7ec0cc086a7ddebfd6d49c09"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_detect_description_list (cyclomatic 26): liteparse::markdown_layout::tables::try_detect_description_list 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f38d36ba4d3f516fc993e8fc83a3e431022d439d1f58bccdd817ead41f2eb"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::absorb_header_lines (cyclomatic 25): liteparse::markdown_layout::tables::absorb_header_lines 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd641b4c883121503bddd7e165a59883cbb00a75b20d6e9af3529135c850bf8d"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::render::find_solid_rects_rgba (cyclomatic 24): liteparse::render::find_solid_rects_rgba 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/liteparse/src/render.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4733e95cd947d7b5ca43cd0d2d686e2c6b78bb406e4b89d1a8ecbaff2847ea9"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmark.run_benchmark (cyclomatic 24): benchmark.run_benchmark 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":"dataset_eval_utils/src/liteparse_eval/benchmark.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56586622f4b84b1f231ff0292aeb61574a0c9674457db772da7f08ade9c8884"}},{"ruleId":"D1","level":"warning","message":{"text":"LiteParse::parse_resolved (cyclomatic 23): LiteParse::parse_resolved 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/liteparse/src/parser.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e41e44cb2c46c8003372f3331797958e6533318c2e7598e1a4c2fc487882911"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::extract::merge_axis_lines (cyclomatic 23): liteparse::extract::merge_axis_lines 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/liteparse/src/extract.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8649bc062398023b42f09725923904438cb3c6d2d62df7218e166bf8603fd366"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::blocks::render_blocks (cyclomatic 23): liteparse::markdown_layout::blocks::render_blocks 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/liteparse/src/markdown_layout/blocks.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c00e1682a42b48ad2dca00d54ee6b8898eaeac0062d05de8d62454dd403398"}},{"ruleId":"D1","level":"warning","message":{"text":"Benchmark.run_full_benchmark (cyclomatic 23): Benchmark.run_full_benchmark 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":"dataset_eval_utils/src/liteparse_eval/evaluation.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00adab8df9a63010e2dcc8ce2bc54e66887cc1c374f856178d8d0f4e8672201"}},{"ruleId":"D1","level":"warning","message":{"text":"GlyphDecoder::decode (cyclomatic 22): GlyphDecoder::decode has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2ad528d14e1406a972380886f0b8eaa1d09ab54ad884c5ce8e219d2c2f9a69"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::headings::looks_like_bold_heading (cyclomatic 22): liteparse::markdown_layout::headings::looks_like_bold_heading has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf38080de7c7f0e7fed234048959fba7b7e1a45f8b8963b536aaf58e9d5b68b"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::repetition::matches_chrome_pattern (cyclomatic 22): liteparse::markdown_layout::repetition::matches_chrome_pattern 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/liteparse/src/markdown_layout/repetition.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed7a44452af8b15176d01841c8a7fc0cd5da891afbef19531b97a7e348ea12d"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::repetition::has_digit_range (cyclomatic 22): liteparse::markdown_layout::repetition::has_digit_range 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/liteparse/src/markdown_layout/repetition.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c72191dbec00dc1a71193fd2c2d93e5756a85f5ae0c55034dd61395eb27e1"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::xy_find_best_cut (cyclomatic 22): liteparse::projection::xy_find_best_cut 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":3281}}}],"partialFingerprints":{"codehealthFindingId/v1":"84dac38950ce8175ef32ac1527b765e8c6b6ef60e3a8d25e59b593f99f92d252"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::extract::dedup_overlapping_items (cyclomatic 21): liteparse::extract::dedup_overlapping_items 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/liteparse/src/extract.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ee378413189951c17b7075c37a2cb7bc42c5eb9c84149de0bbf09c7bc30421"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::cross_region::try_two_col_direct (cyclomatic 21): liteparse::markdown_layout::cross_region::try_two_col_direct 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/liteparse/src/markdown_layout/cross_region.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06a717b3b3d8763107995c057d32d889c30c0c40dc3675da7aede3008424c1d"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::xy_find_banner_cut (cyclomatic 21): liteparse::projection::xy_find_banner_cut 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3377fb2fea97d39ae1a1237f1841de938223fe697a54a4f76f85eae7a4324843"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse_pdfium::page::collect_filled_paths (cyclomatic 21): liteparse_pdfium::page::collect_filled_paths 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/pdfium/src/page.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b601b455088ebc643de8460def87df6dbd19ff435cc346b43fba220a00cf910"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::ocr_merge::render_pages_for_ocr_capped (cyclomatic 20): liteparse::ocr_merge::render_pages_for_ocr_capped 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/liteparse/src/ocr_merge.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfb559b808dc326ef194ea0db3e939e4106005e9a8ad93295c05b998ac89be8"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::raw_text::glyph_outline_support (cyclomatic 20): liteparse::raw_text::glyph_outline_support 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/liteparse/src/raw_text.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72dab42626b869c3e705ffb7fc8633a6d6be5889392513ed16a3af7b44f752c"}},{"ruleId":"D1","level":"warning","message":{"text":"benchmark.format_table (cyclomatic 20): benchmark.format_table 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":"dataset_eval_utils/src/liteparse_eval/benchmark.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"397100e7b16e26f3d8df2ee3e6aa259eb0f7d745f189b86b43bb676daa8311ab"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::headings::build_heading_map (cyclomatic 19): liteparse::markdown_layout::headings::build_heading_map 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/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8399fabbdcf878bdfc90482f819650368d5562a1a5179d573536e0c9711bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::conversion::read_image_dpi (cyclomatic 18): liteparse::conversion::read_image_dpi 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/liteparse/src/conversion.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ede6215935e5c1888832c0fd8e56d25b62354024702b8d859658bc715839fa9"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::raw_text::build_item (cyclomatic 18): liteparse::raw_text::build_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/liteparse/src/raw_text.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e1f96e29e678f546784b6185965da87cb8f369444a51fecf298adf466c8761"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::text_clip::rectangle (cyclomatic 18): liteparse::text_clip::rectangle 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/liteparse/src/text_clip.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bbef1321c165169a351922dfeba44210aa1ae06012c77e103dbdc420a65069"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::extract::build_vector_graphics (cyclomatic 17): liteparse::extract::build_vector_graphics 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/liteparse/src/extract.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"057dfdddbeef838c30e7b21bc43f4d38e362cb2555e880b052a88eafc4fa5803"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::extract::prescan_page_batched (cyclomatic 17): liteparse::extract::prescan_page_batched 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/liteparse/src/extract.rs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac12cd0edc0db06aae5f4602568187b8536b45d2c64723fa1351433e2fca103"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::figure_cluster::detect_figure_rects_with_clusterer (cyclomatic 17): liteparse::figure_cluster::detect_figure_rects_with_clusterer 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/liteparse/src/figure_cluster.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8c09e13b3fe61574bcdfe4b16a25165ee13fb1429230ae47d1a195e030c481"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::headings::looks_like_numbered_bold_heading (cyclomatic 17): liteparse::markdown_layout::headings::looks_like_numbered_bold_heading 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/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7d65963150d8d91bf95d4713b5411f7db62a756a7fc6c9beeec730cd7088ee"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::cells_from_pieces (cyclomatic 17): liteparse::markdown_layout::tables::cells_from_pieces 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e89744bf448abc9ded17f9062b012964662fad46430c2f34e8b82e380b1f54d"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::build_union_table (cyclomatic 17): liteparse::markdown_layout::tables::build_union_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"df124172a63848a72ac8b4ff111ac507d8eba84e975b3678d0cea0483d0a498b"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::passes_density_gate (cyclomatic 17): liteparse::markdown_layout::tables::passes_density_gate 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"32877afc0640e9eb139348dde725ca59e76b6a55e5f639007c7cc97c4d324274"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::projection::try_align_floating (cyclomatic 17): liteparse::projection::try_align_floating 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 10 of the 62 functions over the threshold \u2014 including the worst \u2014 and 462 of the 1118 points over it (41%), 2.9\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 162). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9491a10821057cef0a8176d8610c6af3ccbf42fd6d8febf0a26555a20f440"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::markdown_layout::tables::should_stop_at_running_prose (cyclomatic 16): liteparse::markdown_layout::tables::should_stop_at_running_prose 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4119}}}],"partialFingerprints":{"codehealthFindingId/v1":"474b025ded73998079119a4a95708cc562bba2b9b00d5460a3862fa815702866"}},{"ruleId":"D1","level":"warning","message":{"text":"liteparse::ocr_merge::calculate_native_page_complexity (cyclomatic 16): liteparse::ocr_merge::calculate_native_page_complexity 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/liteparse/src/ocr_merge.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a77cb573a899108c86cf86564de60ea5c3eb5a34858d279f93a3ef850fe6b8"}},{"ruleId":"D1","level":"warning","message":{"text":"cli-json.textItemToCliJson (cyclomatic 16): cli-json.textItemToCliJson 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":"packages/node/src/cli-json.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a2b289ccb5a92ff22ab6e1842dcdcf662e7e233c6c5acb38a39c2764c7a81b"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::project_to_grid (cognitive 522): liteparse::projection::project_to_grid has cognitive complexity 522 (threshold 15). Drivers by points: if/else 97 (359 pts), loops 41 (105 pts), boolean chains 33, match/switch 9 (25 pts) (nesting depth added 342). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57fd8c3ea055bf38c020db65225177ece715eb412bddd2a25273e1c29f7dbcf"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::xy_find_column_cut (cognitive 193): liteparse::projection::xy_find_column_cut has cognitive complexity 193 (threshold 15). Drivers by points: if/else 70 (142 pts), loops 17 (29 pts), boolean chains 21, match/switch 1 (nesting depth added 84). 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 file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58b2bf9e93558e37c665adb786786422030ba9dac4b1eb38b9a05c28eea162f"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::xy_cut_rec (cognitive 179): liteparse::projection::xy_cut_rec has cognitive complexity 179 (threshold 15). Drivers by points: if/else 51 (116 pts), loops 9 (31 pts), boolean chains 27, match/switch 2 (5 pts) (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12d1748fcf7a8cbe27ea036c7f9a19f54f99667fc8422eda81b87da7f4e82fb"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::extract_page_text_items (cognitive 154): liteparse::extract::extract_page_text_items has cognitive complexity 154 (threshold 15). Drivers by points: if/else 47 (119 pts), boolean chains 26, match/switch 3 (8 pts), loops 1 (nesting depth added 77). 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/liteparse/src/extract.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b253b2876838eb88f5d6f35951df5e51cdf7f1ed283596a95178ef72392e24"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::form_lines (cognitive 149): liteparse::projection::form_lines has cognitive complexity 149 (threshold 15). Drivers by points: if/else 50 (105 pts), boolean chains 23, loops 13 (21 pts) (nesting depth added 63). Of this number, 114 points are the body\u0027s own statements and 35 belong to 4 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3173965ee0fa81a3c5b556a4c8ab9fd14e7adc7f6daf105fc0c379f6fbd450e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::handle_rotation_reading_order (cognitive 115): liteparse::projection::handle_rotation_reading_order has cognitive complexity 115 (threshold 15). Drivers by points: if/else 25 (66 pts), loops 15 (39 pts), boolean chains 10 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"839501953b91a233c695c531f6d2904bef1cba000276a787298f84d9ec40a62f"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::assign_cells (cognitive 114): liteparse::markdown_layout::tables::assign_cells has cognitive complexity 114 (threshold 15). Drivers by points: if/else 34 (85 pts), loops 7 (18 pts), boolean chains 7, match/switch 2 (4 pts) (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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce103f697021156a98d56f58d14d2c87c2cd286a909032f746710b6bc44d86d8"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::cross_region::find_cross_region_table_merge (cognitive 104): liteparse::markdown_layout::cross_region::find_cross_region_table_merge has cognitive complexity 104 (threshold 15). Drivers by points: if/else 27 (76 pts), loops 8 (23 pts), boolean chains 5 (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/liteparse/src/markdown_layout/cross_region.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd63deed7e23210538913b6e1ddb6c570a790c69384e0737d8cb4f71cf552f9"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::classify::classify_region (cognitive 95): liteparse::markdown_layout::classify::classify_region has cognitive complexity 95 (threshold 15). Drivers by points: if/else 32 (72 pts), boolean chains 17, loops 2 (4 pts), match/switch 1 (2 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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f81ec5e2c5720ba7061def323395f0359e9265bdc9a706e265b45b5533ae0a"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::union_header_from_above (cognitive 78): liteparse::markdown_layout::tables::union_header_from_above has cognitive complexity 78 (threshold 15). Drivers by points: if/else 30 (58 pts), boolean chains 13, loops 4 (7 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb4fa4323c3fa911729543e727afa79ae7b91c1805a8b1798d15262e5eb58ee"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_detect_table (cognitive 72): liteparse::markdown_layout::tables::try_detect_table has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (53 pts), loops 3 (10 pts), boolean chains 9 (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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80314fb0d8721c8b8302ca96a1fd24a0d45d8d41029067932a8c6e999f0a458"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::classify::classify_page_with_filters (cognitive 69): liteparse::markdown_layout::classify::classify_page_with_filters has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (40 pts), loops 13 (19 pts), boolean chains 10 (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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"510d2203bdc211f88cbc6efea82011b63a406a3e35aee04d3b99eaf3b9e009d3"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::ocr_merge::merge_ocr_results (cognitive 66): liteparse::ocr_merge::merge_ocr_results has cognitive complexity 66 (threshold 15). Drivers by points: if/else 22 (52 pts), boolean chains 6, match/switch 2 (5 pts), loops 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/liteparse/src/ocr_merge.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cdc041a35e096905344ece56e748d15eb9a1505279acad315c28c8f0f7dfc3"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse_python::cli::run_cli (cognitive 65): liteparse_python::cli::run_cli has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (44 pts), match/switch 7 (15 pts), loops 3 (6 pts) (nesting depth added 34). 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/liteparse-python/src/cli.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51759d16e2f2f82e31fbf752d546bd09d3d42bcd950d5e155e64a5e2d702e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::main (cognitive 63): liteparse::main has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (44 pts), match/switch 7 (15 pts), loops 2 (4 pts) (nesting depth added 33). 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/liteparse/src/main.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"82aa15b7d34ccec9233aea001e3d6881ed19f599f9ea627f9a0b2bbb88158965"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_detect_table_inferred (cognitive 62): liteparse::markdown_layout::tables::try_detect_table_inferred has cognitive complexity 62 (threshold 15). Drivers by points: if/else 36 (54 pts), boolean chains 6, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb4c69077fafa0b667801536301942a0b5867851fe9098180055b0dcd9dec8b"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::dedup_overlapping_items (cognitive 56): liteparse::extract::dedup_overlapping_items has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 9 (25 pts), boolean chains 1 (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/liteparse/src/extract.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fda91e59165827633467bd599a276686faed91a6d8d0bacfcf3c08ded822a7"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::absorb_header_lines (cognitive 52): liteparse::markdown_layout::tables::absorb_header_lines has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 4 (7 pts), boolean chains 4, match/switch 1 (4 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59fb4692497f2e3e352383f644d90b63209be4615545e95161cf321397e07ea"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::detect_and_render_flowing_lines (cognitive 52): liteparse::projection::detect_and_render_flowing_lines has cognitive complexity 52 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 3 (12 pts), loops 8 (11 pts), boolean chains 5 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46f03ebddae6850b4a8288e631ed80dc171c9b5cb16dd7576ea4ef608ad36c9"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::font_cmap::reverse_cmap (cognitive 50): liteparse::font_cmap::reverse_cmap has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 7 (15 pts), boolean chains 7, match/switch 3 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/font_cmap.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd36db23aad0a1351a4e7a16a9b3df8bcbd1c63d4a64d7ec0c7ba930fb0b95fd"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::render::find_solid_rects_rgba (cognitive 48): liteparse::render::find_solid_rects_rgba has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 6 (17 pts), boolean chains 8 (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/liteparse/src/render.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"078181bf46e8bb27078f3f045fb2303c980eb47e70af50101ac26c25aad79ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark.run_benchmark (cognitive 48): benchmark.run_benchmark has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (12 pts), ternaries 4 (10 pts), error handling 3 (9 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":"dataset_eval_utils/src/liteparse_eval/benchmark.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a27c42e475da82649fded11c94c594143b5ad4c5ce6f5cfea8bba394828ff47"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::build_one_line (cognitive 47): liteparse::projection::build_one_line has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (32 pts), boolean chains 10, match/switch 2 (3 pts), loops 2 (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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84ce9b364f7caf9d8e5870d401fc87dcce2154abb63fb5d0562380e76970e51"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_merge_pair (cognitive 46): liteparse::markdown_layout::tables::try_merge_pair has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 4 (8 pts), boolean chains 7, match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc7a7c2798571416ee44d5572f9adc563fcecef367e965ac925c959e3b3bb47"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::try_align_floating (cognitive 46): liteparse::projection::try_align_floating has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e78b987abd52bb2d7858cdd99c67407507b65f7056e59329720aa9cb450046"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.program.command(\u0022batch-parse\u0022).description(\u0022Parse multiple documents in batch mode\u0022).argument(\u0022\u003Cinput-dir\u003E\u0022,\u0022Input direc (cognitive 46): cli.program.command(\u0022batch-parse\u0022).description(\u0022Parse multiple documents in batch mode\u0022).argument(\u0022\u003Cinput-dir\u003E\u0022,\u0022Input direc has cognitive complexity 46 (threshold 15). Drivers by points: if/else 25 (26 pts), ternaries 8 (16 pts), error handling 2 (3 pts), loops 1 (nesting depth added 10). 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":"packages/node/src/cli.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"160a9701a7698c78218b760ab030c85858f0d9762a9a470756d7d89561af7834"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::merge_axis_lines (cognitive 45): liteparse::extract::merge_axis_lines has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 11, 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/liteparse/src/extract.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7fb711775014512217169ac8c3a368088d6bc7e83e5d602b8ab1542e37dadd"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::blocks::render_blocks (cognitive 45): liteparse::markdown_layout::blocks::render_blocks has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 4 (13 pts), loops 3 (7 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/liteparse/src/markdown_layout/blocks.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad2c88d0b694646734f51d0dff5ce6a9bc2bd618d309e013fdda82c269077c1"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::repetition::has_digit_range (cognitive 43): liteparse::markdown_layout::repetition::has_digit_range has cognitive complexity 43 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 5 (15 pts), boolean chains 12 (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/liteparse/src/markdown_layout/repetition.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fc4bfbfdc22da53ab5194f8b709170901e58bd54875db7ed83161da1843c78"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::cross_region::try_two_col_direct (cognitive 41): liteparse::markdown_layout::cross_region::try_two_col_direct has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 4, match/switch 1 (3 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/liteparse/src/markdown_layout/cross_region.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e731a75bdc50eea22f1d0ae8de79fac46c059ebdf9312f1759487bc5221c0cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::headings::build_heading_map (cognitive 41): liteparse::markdown_layout::headings::build_heading_map has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72cbe7e6807c734277815c02a48c47781d9e2733b8897078589812d348c7843"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteParse.__init__ (cognitive 41): LiteParse.__init__ has cognitive complexity 41 (threshold 15). Drivers by points: if/else 40, boolean chains 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":"packages/python/liteparse/parser.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec91e1f01a229ce850d3589710793fa8eae09ecbd52365fb767b6ba74cf25aca"}},{"ruleId":"D2","level":"warning","message":{"text":"JsLiteParseConfig::into_rust (cognitive 40): JsLiteParseConfig::into_rust has cognitive complexity 40 (threshold 15). Drivers by points: if/else 38, match/switch 1 (2 pts) (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/liteparse-napi/src/types.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ae873129e2449737060b15671a7a1db4b908c92c9bcc2ab33dc60d3def8029"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteParse::new (cognitive 40): LiteParse::new has cognitive complexity 40 (threshold 15). Drivers by points: if/else 38, match/switch 1 (2 pts) (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/liteparse-python/src/lib.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74903e48e2673ad2a3edd9ed4df7688917a5574a7cd13e8d723096f85f3bbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteParseConfig::into_core (cognitive 40): LiteParseConfig::into_core has cognitive complexity 40 (threshold 15). Drivers by points: if/else 36, match/switch 2 (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/liteparse-wasm/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e070679b97a57e531666298a8bdd1c76a153f94d8f2807a23c6018bd4e236126"}},{"ruleId":"D2","level":"warning","message":{"text":"Benchmark.run_full_benchmark (cognitive 40): Benchmark.run_full_benchmark has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 4 (8 pts), error handling 3 (7 pts), loops 4 (6 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":"dataset_eval_utils/src/liteparse_eval/evaluation.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a402d93fbbd63b32edf7ad15dedb08ae7628d6283125f3072dc3c041c1663463"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::try_detect_description_list (cognitive 39): liteparse::markdown_layout::tables::try_detect_description_list has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb47fade6e00e1b4a4d839b36580a5612c4906dd29e321ef4e6c2eebd9ee244"}},{"ruleId":"D2","level":"warning","message":{"text":"benchmark.format_table (cognitive 39): benchmark.format_table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 8 (13 pts), ternaries 2 (5 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":"dataset_eval_utils/src/liteparse_eval/benchmark.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfb0ee2443d9dfce6f74a174888504170db75025bb834992ee0cfab6bfa9f76"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.program.command(\u0022parse\u0022).description(\u0022Parse a document and extract text\u0022).argument(\u0022\u003Cfile\u003E\u0022,\u0022Path to the document file\u0022) (cognitive 38): cli.program.command(\u0022parse\u0022).description(\u0022Parse a document and extract text\u0022).argument(\u0022\u003Cfile\u003E\u0022,\u0022Path to the document file\u0022) has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31, ternaries 3 (5 pts), error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/cli.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b19a9a280b1511024b0fcdbbe84ba7f3a67e253c018a0f9dbfadb58281bdd3"}},{"ruleId":"D2","level":"warning","message":{"text":"LiteParse::parse_resolved (cognitive 36): LiteParse::parse_resolved has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 4 (8 pts), boolean chains 5, 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/liteparse/src/parser.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"852a217739fe3438a0f79004714a11d645fd532c5a9bac4aa2b3cb4817dd8434"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::xy_find_banner_cut (cognitive 36): liteparse::projection::xy_find_banner_cut has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (27 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d1a5a0ef80a7febcf7340a58208bf3894aea9da5f5b0c3b34e6bd7df93e2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::ocr_merge::render_pages_for_ocr_capped (cognitive 35): liteparse::ocr_merge::render_pages_for_ocr_capped has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/ocr_merge.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77c487e1e82c4b291c5220f18a6beacf9dede569a8d9276d85e3beb856a8ef2"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::build_ruled_table_from (cognitive 34): liteparse::markdown_layout::tables::build_ruled_table_from has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 9, 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d520fc4bdc2fc2debe5023049621b440dacbceeb9a772a585f9e5fcc7727efb"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::intercept_filter (cognitive 33): liteparse::projection::intercept_filter has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (8 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"20742d3cd894b6c369377670fef2ab0881cacbeca757e50252aa405baeefb071"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::xy_find_best_cut (cognitive 33): liteparse::projection::xy_find_best_cut has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (10 pts), match/switch 4, 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":3281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5c21c600ec31a6029857b8e9519a0ec63b26a8f3efceedccd053a808c56da4"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::prescan_page_batched (cognitive 32): liteparse::extract::prescan_page_batched has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c0377cac6c329dc4f69eae3a240ec881ad7f9a2e3d07c602289c262812e944"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::xy_peak_fill_stats (cognitive 32): liteparse::projection::xy_peak_fill_stats has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (11 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca6792cf3c12c66c3e1fb29cf458cf4388f91e2b54afb4af96f2aff0b4af728"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::search::search_items (cognitive 32): liteparse::search::search_items has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 4 (8 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/liteparse/src/search.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"607eb993f67e4cae197049ee4b45d6a37ed913a5ff058899fff57b474d596f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::build_vector_graphics (cognitive 31): liteparse::extract::build_vector_graphics has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"33379d6c55834ec35b082cd70e1e37c1976eb5f8850ab916b4985596d4c8c3ee"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::conversion::read_image_dpi (cognitive 30): liteparse::conversion::read_image_dpi has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/conversion.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce20e98ad6ff185413e1d71a9ecff3d4b84964292e3e8f1139d2d9cc0f94ca33"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::repetition::matches_chrome_pattern (cognitive 29): liteparse::markdown_layout::repetition::matches_chrome_pattern has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8, 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/liteparse/src/markdown_layout/repetition.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a103950d4b832d41ed65341d2a1943b3b510e0f7801514b6e17b16f5012906d0"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::cells_from_pieces (cognitive 29): liteparse::markdown_layout::tables::cells_from_pieces has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (5 pts), boolean chains 3, 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"56903f0643d0adcbd7cf3aebe788706e7bfad5be7cd6f4fc99ba88d25894570f"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::raw_text::build_item (cognitive 29): liteparse::raw_text::build_item has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, 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/liteparse/src/raw_text.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dbb8ee071194bd7c03d72a8a3fcfe53673c238d3162203f99e6749ba38f3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Page::annotations (cognitive 29): Page::annotations has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"9180b63ecacc3fc4bb6320cd6e9b8b3df0c3eb56eaa2e071516b1af577bfa4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::build_projected_lines (cognitive 28): liteparse::projection::build_projected_lines has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"2851c52d7d65fce93e213cc8e50e803fb2af946df67446f3a3e8e5709f80a58a"}},{"ruleId":"D2","level":"warning","message":{"text":"Page::image_objects (cognitive 28): Page::image_objects has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c76f397826e337a31022477dc1ce54b7fc141aa3e9a02af54b0dbe39178144"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::repetition::compute_header_footer_set (cognitive 27): liteparse::markdown_layout::repetition::compute_header_footer_set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 6 (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/liteparse/src/markdown_layout/repetition.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"421b740fa5b5e8a757c871aeb9b6adfc7cdd45e9f5b3ab350b27282c21d1c30e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::build_union_table (cognitive 26): liteparse::markdown_layout::tables::build_union_table has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2920}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb7d82f004f6db342b45ff2db99a8948372d3fb7043dbf5106f21bc1784945c"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse_pdfium::page::collect_filled_paths (cognitive 26): liteparse_pdfium::page::collect_filled_paths has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 2 (4 pts), boolean chains 3, 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/pdfium/src/page.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd02e991da9193cd5bc80e6b46646bea0ffb044a9ed8ce28e019da2229594c2"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::assign_strikethrough (cognitive 25): liteparse::extract::assign_strikethrough has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 3 (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/liteparse/src/extract.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"7135c04bd13f41f36370f78df5d5d994fdb0d6f6a2b04ff2b6f951a8e9eefc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::figure_cluster::detect_figure_rects_with_clusterer (cognitive 25): liteparse::figure_cluster::detect_figure_rects_with_clusterer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 3, 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/liteparse/src/figure_cluster.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32b681cfdf6e39ad189b43690fd9d8742dadf81f1cb6fcbe78243283171352"}},{"ruleId":"D2","level":"warning","message":{"text":"GlyphDecoder::decode (cognitive 24): GlyphDecoder::decode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 9, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d514b84300fc2602dc778062e4e3f187ddff6ca3ea775e41092a733e29ef7b8"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::headings::looks_like_bold_heading (cognitive 24): liteparse::markdown_layout::headings::looks_like_bold_heading has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c509c205350beb9e7bb4e847913f7d536b55718b313abba71dc073b11c6574"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::recover_merged_cell (cognitive 24): liteparse::markdown_layout::tables::recover_merged_cell has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (7 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9786d0804f59f71345b026f92ec75219906b79266b3c8be25e944ba9d93cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::passes_density_gate (cognitive 24): liteparse::markdown_layout::tables::passes_density_gate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a57283f855a6901c613ad899030a83c5690d7e89b52eeaeba4d01c7d6cf1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::raw_text::glyph_outline_support (cognitive 24): liteparse::raw_text::glyph_outline_support has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, match/switch 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/raw_text.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"f748ef036734ea90143d41ffaee9b008f2ceb4a6330c02edd683358a23e60287"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::merge_stacked_header (cognitive 23): liteparse::markdown_layout::tables::merge_stacked_header 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71d5821101716853177e638025a6c58c19c943ff6053c0cd1be01c05d804352"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentBuilder::start (cognitive 22): SegmentBuilder::start has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":3213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54346c42c8a72e06ec1a0231222c828ca50d5f3630688ea6ffb1946f1d1bccb"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::acroform_repair::collect_orphaned_fields (cognitive 22): liteparse::acroform_repair::collect_orphaned_fields has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/acroform_repair.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf83d21f03603e66cccb53d86c1899e19fec483eee6c064e4d638851644d059"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::inline::render_line_inline (cognitive 22): liteparse::markdown_layout::inline::render_line_inline has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/inline.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c01047ca43550f0e993ef2fe7a770b31f6743b191ee690acab89e36e3d2367"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::lists::parse_list_marker (cognitive 22): liteparse::markdown_layout::lists::parse_list_marker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, 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/liteparse/src/markdown_layout/lists.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"deba6d54d34282624372e261008eedd36d2d0d521f4061a4b903cc4685ce56d5"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::merge_table_runs (cognitive 22): liteparse::markdown_layout::tables::merge_table_runs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":5631}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed42720dca58ed72b467aa8f7e42cef8731abb3db376ac5e4526480851c6250"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::merge_continuation_rows (cognitive 22): liteparse::markdown_layout::tables::merge_continuation_rows has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":5706}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e56e07986a02d4f29252958812b9a77cc2a67dd0a9b48a654110c202fff17d9"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::text_clip::rectangle (cognitive 22): liteparse::text_clip::rectangle has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/text_clip.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e6a1c145114c4adc031b4a16ac901f079f0466de757dd7e783df97c8867de2"}},{"ruleId":"D2","level":"warning","message":{"text":"Page::form_fields (cognitive 22): Page::form_fields has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 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/pdfium/src/page.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd81c8e2fbe18960d4fd34f3afba3b8fc216c838dfe266508d3c1daca34d32c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextClip::walk (cognitive 21): TextClip::walk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), match/switch 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/liteparse/src/text_clip.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6240691631a2480ec11b15c6dee9b6e43b1e1571bae841749075815780ce04be"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::document_metadata::trailer_id_pair_differs (cognitive 21): liteparse::document_metadata::trailer_id_pair_differs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/document_metadata.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea05297222195ab71937ffa76926428d939ee3aa56034c810d8d1abd899eadd"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::figure_cluster::cluster_bboxes_spatial (cognitive 21): liteparse::figure_cluster::cluster_bboxes_spatial has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/figure_cluster.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"20694b34c327615f19ab022c6967e94b222e1dd0f94b0d55d459418e7f0412c8"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::headings::looks_like_numbered_bold_heading (cognitive 21): liteparse::markdown_layout::headings::looks_like_numbered_bold_heading has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efca38dfe267de94a3f0ab493b276bec4bf7d6efec52d65f2b4f34d013f33ef"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::headings::outline_heading_level (cognitive 21): liteparse::markdown_layout::headings::outline_heading_level has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, match/switch 1 (2 pts), 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/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1c8c0a97276a4d71b35385b89c62a1b9ea5554c266df581a8c905e5542cad1"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::merge_nearby_anchor_groups (cognitive 21): liteparse::projection::merge_nearby_anchor_groups has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (16 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"77440eb083337de7f4b08ab040f687a45a2d3a28e297224f93796024fcce2a95"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse_pdfium::struct_tree::read_attributes (cognitive 21): liteparse_pdfium::struct_tree::read_attributes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/struct_tree.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"815ff5b76fca430192ef59b17a43ee19f52dc64a6e93262227a1ef6e2e5f0e10"}},{"ruleId":"D2","level":"warning","message":{"text":"parser._convert_native_result (cognitive 21): parser._convert_native_result has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 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":"packages/python/liteparse/parser.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa35acaffec949490d33597fe7e5561e3635ac36ad2de28698b5036b6211d17"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.program.command(\u0022screenshot\u0022).description(\u0022Generate screenshots of document pages\u0022).argument(\u0022\u003Cfile\u003E\u0022,\u0022Path to the docum (cognitive 21): cli.program.command(\u0022screenshot\u0022).description(\u0022Generate screenshots of document pages\u0022).argument(\u0022\u003Cfile\u003E\u0022,\u0022Path to the docum has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (7 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/cli.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf854bf0ed39456d3336d7b56827a0b927f53d51a0f3f23506485bfbf17363b7"}},{"ruleId":"D2","level":"warning","message":{"text":"FontDbResolver::load_shard (cognitive 20): FontDbResolver::load_shard has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 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/liteparse/src/font_db_resolver.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e408f5b7a74de4c363f6dcae1a8d898890a63a58bfb9f21fdf68691a321023d"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::repetition::detect_single_page_chrome (cognitive 20): liteparse::markdown_layout::repetition::detect_single_page_chrome 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/liteparse/src/markdown_layout/repetition.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d2a87b35513e1a8684ec0374fa6cbcc9c7484b6030112f6bb4c820c69a5bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::cross_region_header_tracks (cognitive 20): liteparse::markdown_layout::tables::cross_region_header_tracks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (8 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9dffdecc5b1eae8cf1a6a6c21c95fbe410304b45f86038a808230b325f9a4e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::ocr_merge::calculate_native_page_complexity (cognitive 20): liteparse::ocr_merge::calculate_native_page_complexity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 4 (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/liteparse/src/ocr_merge.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"90927ab02ea6d8d5b54f864c8cca2bd3cf458bda3cbe2369d5417c2554bcf291"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse_pdfium::page::collect_path_objects (cognitive 20): liteparse_pdfium::page::collect_path_objects has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts), 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/pdfium/src/page.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3f510a70d10f531c9a85734f9122daeadf94aa31b8e5c72b7572558e28a534"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::extract_layout_graphics (cognitive 19): liteparse::extract::extract_layout_graphics has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8fdaf96a4d53edb6a18efabcd7ef7b1d25bd636b753e1a79851eb1375fd325"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::classify::stitch_regions (cognitive 19): liteparse::markdown_layout::classify::stitch_regions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7917fef25b26d811c90c78c9235e7bc177caeb8490d5b23cfe289cfccf269efc"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::cross_region::validate_via_detectors (cognitive 19): liteparse::markdown_layout::cross_region::validate_via_detectors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/cross_region.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b403bde5605ff4cacbba25b246febaaed9f2d14b0fecb369eb3f85d18eb87c7"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::should_stop_at_running_prose (cognitive 19): liteparse::markdown_layout::tables::should_stop_at_running_prose has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4119}}}],"partialFingerprints":{"codehealthFindingId/v1":"62579fdb9ac45cc6804466c02100b46280938100b4789cc2ce040d04d0d17a9c"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::ocr_merge::calculate_page_complexity (cognitive 19): liteparse::ocr_merge::calculate_page_complexity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/ocr_merge.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c77ac7453fd261506780ce8741923505e4859a3bbaf49c6e7c50c9bb11b4413"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::conversion::read_png_dpi (cognitive 18): liteparse::conversion::read_png_dpi has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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/liteparse/src/conversion.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"327b5ff334ffa5a0fd8cfaa85a77d8256e5115e566dd934d823a1c65357164f6"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::render_page_images (cognitive 18): liteparse::extract::render_page_images has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 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/liteparse/src/extract.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"81226e71d3d52f4fa737557c9098fcc87c0f62c39d78c9f53088678b76e4932b"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::compute_white_fill_flags (cognitive 18): liteparse::extract::compute_white_fill_flags has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ad30cbb1d1dd9a8eb9b3507dd0d7f7e6829908bc47091dab46346ab52c0877"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::detect_garbage_unicode_fonts (cognitive 18): liteparse::extract::detect_garbage_unicode_fonts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":2537}}}],"partialFingerprints":{"codehealthFindingId/v1":"87de8e38c61272d2440b4c1bc21b4eb38c881f75ea89a78be32489182490005e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::lists::detect_ordered_list_lines (cognitive 18): liteparse::markdown_layout::lists::detect_ordered_list_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 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/liteparse/src/markdown_layout/lists.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf259fddd16ba99c9f3b8830809b19be64f027ee71f66d57ac80a904083ac0f"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::extract_h_v_segments (cognitive 18): liteparse::markdown_layout::tables::extract_h_v_segments 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b043ca59352267e1b7c5efb865b3afd1542cada1f5604f28d2b3028fdddcd1d"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::find_grid_components (cognitive 18): liteparse::markdown_layout::tables::find_grid_components has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 5, loops 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aceed4e1b27d8aabc820f0a6ea75c01e7b32de9fb8605151d06fdfd6402e00a"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::clean_projected_items (cognitive 18): liteparse::projection::clean_projected_items has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0cfd1c986b2df17dbb27c6e43fee81d7ac6e6221e5a68ac09972d4201188e4"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::raw_text::grounding_bounds (cognitive 18): liteparse::raw_text::grounding_bounds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 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/liteparse/src/raw_text.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc4c698a39deb491516bb9a122e6a191f169abba2c573794966affadd5559da"}},{"ruleId":"D2","level":"warning","message":{"text":"Page::links (cognitive 18): Page::links has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"2210aa02b5f2aca1b0d9ccbdfcb9762f62dddf05c27656a5b337dc70b59c4bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"PageObject::clip_paths (cognitive 18): PageObject::clip_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page_object.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9886995e6ff2a0970ba3a302310b8c492f6665689d749312eb59edf3ffec0c6"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.collectFilesInner (cognitive 18): cli.collectFilesInner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 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":"packages/node/src/cli.ts"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bdfb8f9342dc9e52dca735ce157cea7db38ce9a78e84b0962acd29cae7918e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::conversion::read_jpeg_dimensions (cognitive 17): liteparse::conversion::read_jpeg_dimensions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/conversion.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f298d866a65411e965b01fa839963feb04e146ab05fbad48916ab58256ccdc14"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::extract::extract_single_page (cognitive 17): liteparse::extract::extract_single_page has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 4). 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/liteparse/src/extract.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01ffe6c44f1443336e3016f4939a158b2f9888ad755a8fc3a7c6871b456ae9c"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::absorb_cross_region_headers (cognitive 17): liteparse::markdown_layout::tables::absorb_cross_region_headers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acd882e183d0039684888b23b61193d571f8d6f5fa11bb33915d70031f7750e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::segment_blocks (cognitive 17): liteparse::projection::segment_blocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d60094ebd088602502cfc42182e9158688420d486d40b457ceb1fc6775487f"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::delta_min_filter (cognitive 17): liteparse::projection::delta_min_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d80a436d89d8b7475f4a29ef91e18a7290ea3a318a86090de512ce8f3a0758e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::config::parse_target_pages (cognitive 16): liteparse::config::parse_target_pages 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/liteparse/src/config.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3309964cb900e129ad076b7a141308bfcf712b87319307bb26c2e94df5ea9d5"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::headings::is_section_number_prefix (cognitive 16): liteparse::markdown_layout::headings::is_section_number_prefix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6926ea7963062ec4d1f3c4e007f3d221586a7a6fc5ce40db70886c813b5bd156"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::lists::marker_interpretations (cognitive 16): liteparse::markdown_layout::lists::marker_interpretations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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/liteparse/src/markdown_layout/lists.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2feb766b1a170bde8fe60175a917c191dfaf3fdc0974ba6a17e62a051b1868c"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::cluster_adjacent (cognitive 16): liteparse::markdown_layout::tables::cluster_adjacent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2558}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb1ad584a2cb00b186692d0feceafbc8c185a61e1af7190889bd00247634dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::markdown_layout::tables::prose_boundary_crossing (cognitive 16): liteparse::markdown_layout::tables::prose_boundary_crossing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde84c45f0d404a3ae5e62d4b4d7b8ec70167d66671565e31aea44d6f8e9527e"}},{"ruleId":"D2","level":"warning","message":{"text":"liteparse::projection::compress_wide_spaces (cognitive 16): liteparse::projection::compress_wide_spaces has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 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. This file is where this pass\u0027s cognitive complexity CONCENTRATES: crates/liteparse/src/projection.rs holds 18 of the 117 functions over the threshold \u2014 including the worst \u2014 and 1284 of the 3133 points over it (41%), 2.8\u00D7 the next-largest file (crates/liteparse/src/markdown_layout/tables.rs at 461). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d2af22c8139c1b1344813c025408d3addf1b73fa5c8f774003152a8e01ddde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::projection::project_to_grid: FunctionTooLong \u2014 liteparse::projection::project_to_grid runs 721 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 621 over it, 7.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"7612c5bfaf03b3ad933c1b965d9d106b398d23ac7bae1338e0c155f7cbfacf5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: markdown_layout/tables.rs: FileTooLong \u2014 3419 significant 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 2919 over it, 6.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"523eb1475637d26a20c0b21b56d368654fddea19cebd8a0e340e222ba4870317"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/projection.rs: FileTooLong \u2014 3251 significant 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 55 free functions. The bar is 500 significant lines; this is 2751 over it, 6.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/liteparse/src/projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19853c58eed737d30c400507b664265250fb24d2d5707b8943f4561b97341ed9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PdfiumBindings: TooManyFields \u2014 192 stored fields beside 1 method. The bar is 30 stored fields; this is 162 over it, 6.40\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/pdfium-sys/src/dynamic.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed27a250e08a01d22334e861b9dd27fcdc6f973a0bf08348a06262bbe40c0282"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extract.rs: FileTooLong \u2014 2214 significant 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 1714 over it, 4.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/liteparse/src/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdce18c8314b851e31a193b831089c4454b0d5e0339dd4911c244735fbc0437"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::projection::xy_find_column_cut: FunctionTooLong \u2014 liteparse::projection::xy_find_column_cut runs 352 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 252 over it, 3.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7acefa793fdce2707ef6dab4e7600d6473825de36457f1e52e05a7b49c7d0a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::projection::form_lines: FunctionTooLong \u2014 liteparse::projection::form_lines runs 347 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 247 over it, 3.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/liteparse/src/projection.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"357935c76c10699b488a2afc9da05889a9f47d6456942cee0722d00e31c80318"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1512 significant 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 1012 over it, 3.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse-python/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c88c2b3a6f3d9c0d35abf4f8c4caf41b4c7c8ff6bfbe02929160bbd5f7d733a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/page.rs: FileTooLong \u2014 1391 significant 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 891 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7e0787b82660e13a0edbc98639620bf5220a867d9f1265530c96fcfc624d65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::extract::extract_page_text_items: FunctionTooLong \u2014 liteparse::extract::extract_page_text_items runs 276 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 176 over it, 2.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/liteparse/src/extract.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45b3b3074f791c848f5f87f10776e313d264b0f837b20e70b901be82600ac8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::projection::xy_cut_rec: FunctionTooLong \u2014 liteparse::projection::xy_cut_rec runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4315}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a2eb5faab218e754943d3b3a83d2527844803b2e96b0ff211e70e7d06b0211"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1200 significant 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 700 over it, 2.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/liteparse-wasm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7b5b36b3e4aac9aa8919e987b88b34e8990b1bd94abdc7faebaf87388d3a75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PdfiumBindings.load: MethodTooLong \u2014 load runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.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/pdfium-sys/src/dynamic.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bfe92947fb5262820c61549c1c0f75c459b37f4feaafdd0f925a2a8160a9a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::main: FunctionTooLong \u2014 liteparse::main 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/liteparse/src/main.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dfe183cfc1e05aceb67d976ce4a8ea29cc93b1f27ac9acef1722f038ec6352"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LiteParse.parse_resolved: MethodTooLong \u2014 parse_resolved runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.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/liteparse/src/parser.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9477183353f717924752359867cdfe51bfa84185af696c2928fcb22e91d199fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse_python::cli::run_cli: FunctionTooLong \u2014 liteparse_python::cli::run_cli runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/liteparse-python/src/cli.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13c84d4d3cebb6d7d6afce42311721b1cec98c66789bdc788f20047e5b7982f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ocr_merge.rs: FileTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 490 over it, 1.98\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/liteparse/src/ocr_merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c17e27e44ea0a11022edab35c94bde205e3c5c5e41c8d078de053be0bd7870"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 976 significant 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 476 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse-napi/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59770acd705011b4903ba635acd294dc99ae2e420871b7bbee312e2f53648ec5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PdfiumBindings: ClassTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 2 blocks, lines 38-833. The bar is 400 significant lines; this is 337 over it, 1.84\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/pdfium-sys/src/dynamic.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce501d4d7ac522c26a6f474d8a1a5f86338ea34faeef05f2e9a752abf2e8965"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Page: ClassTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 36 methods, 4 blocks, lines 243-2148. The bar is 400 significant lines; this is 324 over it, 1.81\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/pdfium/src/page.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79a47d08163ca28abef8ea93e50da6266c2bc8cc5cb98db8ee189691df5f56f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse_wasm::to_js_result: FunctionTooLong \u2014 liteparse_wasm::to_js_result 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/liteparse-wasm/src/lib.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee370db93904bf5f41d08b7553c3da76bc50f7d0788d13b8424a16964ccc71df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::markdown_layout::tables::build_ruled_table_from: FunctionTooLong \u2014 liteparse::markdown_layout::tables::build_ruled_table_from runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":5024}}}],"partialFingerprints":{"codehealthFindingId/v1":"4994aed02bad07856d6bb333acb96cf87ee3ac60a8cca3e9e073fa8fd884418c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dynamic.rs: FileTooLong \u2014 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: PdfiumBindings (2 blocks, 38-833). The bar is 500 significant lines; this is 362 over it, 1.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium-sys/src/dynamic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4387595f4e5c685e18e1f1303b7c2f30aae8144cc053061805ca07918740363b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::markdown_layout::tables::try_detect_table: FunctionTooLong \u2014 liteparse::markdown_layout::tables::try_detect_table 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"139ff9b506bf456612faf972342166e3653bfe6e6d34e9f3f6dd21b6cf1a43cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::projection::handle_rotation_reading_order: FunctionTooLong \u2014 liteparse::projection::handle_rotation_reading_order 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/liteparse/src/projection.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"607b74b886f0a6398c8c3d0b26cd65d4244ee88b96017249692154d5b772d1f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::projection::build_one_line: FunctionTooLong \u2014 liteparse::projection::build_one_line runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f685ac4e592ad0d7e9922a22a9ac2c51c319e792d366f8cd402a9e309b64858a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::markdown_layout::tables::union_header_from_above: FunctionTooLong \u2014 liteparse::markdown_layout::tables::union_header_from_above runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4c6442bfdc857093c69217079877d7b928b1f41f60130db29531a86b86d69a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::markdown_layout::tables::assign_cells: FunctionTooLong \u2014 liteparse::markdown_layout::tables::assign_cells runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f03d8fcb68e4e2a7f3bb39de72c09e4c089c9cb4df18426043c98b03e0677ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::ocr_merge::merge_ocr_results: FunctionTooLong \u2014 liteparse::ocr_merge::merge_ocr_results runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/ocr_merge.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d7b888188bb4e1c14f1cdb572ead2d5542e132bc6e77ab33e196687c8522a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::markdown_layout::cross_region::find_cross_region_table_merge: FunctionTooLong \u2014 liteparse::markdown_layout::cross_region::find_cross_region_table_merge 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/liteparse/src/markdown_layout/cross_region.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4f8ff3b583d826430a08073b871ee98153d8f98f4bc12204fc3753a10deb9d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::conversion::convert_image_to_pdf: FunctionTooLong \u2014 liteparse::conversion::convert_image_to_pdf runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/liteparse/src/conversion.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"8221b598df981373af381f6abf9589f74fe409ec42cf92807edfd3cc1a84d1c1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LiteParse: ClassTooLong \u2014 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), 24 methods, 2 blocks, lines 182-1169. The bar is 400 significant lines; this is 176 over it, 1.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/parser.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"731f0f8c2b54b2826d7bc8439de305c5191cdd215d17b67221e9cd5b4f4a5413"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: LiteParse (2 blocks, 182-1169). The bar is 500 significant lines; this is 216 over it, 1.43\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/liteparse/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1778c64d5913e4495143a5e7924adb2bbc22cf746db4af87dfcc9e3a61063e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::extract::extract_single_page: FunctionTooLong \u2014 liteparse::extract::extract_single_page 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/liteparse/src/extract.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a920d4cbbaa76d412246a2f88b3f844c728b32b510c7397633719c01b6c2db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: markdown_layout/classify.rs: FileTooLong \u2014 710 significant 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 210 over it, 1.42\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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6389220bfb3294df1a7dbcc9e2706c6463d0800132f3f9a23ab8ab1b8f940b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SegmentBuilder: TooManyFields \u2014 42 stored fields beside 15 methods. The bar is 30 stored fields; this is 12 over it, 1.40\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/liteparse/src/extract.rs"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"f227310e76510d86674d28873c90d7c307480de5b6b06589c9d3912eda22f938"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::markdown_layout::tables::try_detect_table_inferred: FunctionTooLong \u2014 liteparse::markdown_layout::tables::try_detect_table_inferred runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6519242b531b5cf28bdf53e71749367bc93ef7fd8b34f1a58e8de05099e753"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: liteparse/parser.py: FileTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 184 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":"packages/python/liteparse/parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c1ed16577bab22a3cd8890dcc15eed9012316de7f28a546cff22a97ffd5b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LiteParse.new: MethodTooLong \u2014 new 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/liteparse-python/src/lib.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"699a5d353a73b0ab0c0bf6bf319a0511cc522331852dd9213848291b7ff6e35d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: JsLiteParseConfig: TooManyFields \u2014 38 stored fields beside 2 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/liteparse-napi/src/types.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0ce8e0885edcc7f07a337ee160c334138646e2a72ac123a545ea1003af7f92"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PyLiteParseConfig: TooManyFields \u2014 38 stored fields beside 2 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/liteparse-python/src/lib.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"423934843c97c2652d77b176136b7b32b2a0d630a69b75721c31460d6cba5172"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.ts: FileTooLong \u2014 633 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 133 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/lib.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f97a1468b59f0f9488b3eb683068dd3f79c79dcbb40be31546be5e3a5ff304"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/conversion.rs: FileTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/conversion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01db1ca12d2b03c76f2de42d050268ba2e25a52953847b9f945dcac47be901ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LiteParseConfig: TooManyFields \u2014 37 stored fields beside 2 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/liteparse-wasm/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ff63bc4c8f10c0d09a1a9925f4b33d58352a05b5f7eaa16d74a401b23e18c2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Page: TooManyMethods \u2014 36 methods, declared across 3 files: src/page.rs (31), src/struct_tree.rs (3), src/page_object.rs (2). The bar is 30 methods; this is 6 over it, 1.20\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/pdfium/src/page.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c95e6d3e6a99b86abe33ca1635e6ef8bb57d2136f38ac9d05ce9c2484224d6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Page.form_fields: MethodTooLong \u2014 form_fields 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/pdfium/src/page.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b94080c22a31ef55849e66fed36fe51fdc3ef6b2baf8778ef6fed29116dd7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlyphDecoder.decode: MethodTooLong \u2014 decode 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/liteparse/src/extract.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7351aad0c670e6c0c17d1001ddbc583f7376db1b8fbbbc7b9e97060cc869ef80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Page.image_objects: MethodTooLong \u2014 image_objects 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/pdfium/src/page.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7878291b9a07611c4ad7518acd1b7db480451804fa4e9e89bbcc9c4d73cce61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::markdown_layout::tables::try_merge_pair: FunctionTooLong \u2014 liteparse::markdown_layout::tables::try_merge_pair 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec777b16f88f5b3d3feca7bf0c1babec22bcb1b0b17a3b81b00cbed356eaa5f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::ocr_merge::render_pages_for_ocr_capped: FunctionTooLong \u2014 liteparse::ocr_merge::render_pages_for_ocr_capped 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/liteparse/src/ocr_merge.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f7e99144aee1e7a768ec8cd57c94dea54176654c48b0e73cf6ab4a06216908"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/raw_text.rs: FileTooLong \u2014 511 significant 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 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/raw_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"239a3c0661894d161a5ce1ff19a79eb4f0b174af5a24977d372003344b8afda3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse::raw_text::build_item: FunctionTooLong \u2014 liteparse::raw_text::build_item runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/raw_text.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7b24452032fa60c3e51df167341b4c7c268ad26cc76b453cd611cc93c9934d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liteparse_pdfium::page::collect_filled_paths: FunctionTooLong \u2014 liteparse_pdfium::page::collect_filled_paths 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/pdfium/src/page.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"27675c43baee08b7bda3c94c01de284495e13c9636782ff73d722a59a445f608"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (224 shared lines): crates/liteparse-python/src/cli.rs:271-547 | crates/liteparse/src/main.rs:413-715 \u2014 These two members are variants of one another: 224 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/liteparse-python/src/cli.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e13e2a5cc717bb0097a6f940bed1cf2588c97483bb7d3b7bf13faa76faa511"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/pdfium/src/bitmap.rs:154-173 | crates/pdfium/src/bitmap.rs:177-195 \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/pdfium/src/bitmap.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db6174439cc88bbf768d213fec25b60438ca2fad32bd6db7a0b6e660784836f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201347 lines \u00D7 2): crates/liteparse-python/src/cli.rs:393-437 | crates/liteparse/src/main.rs:534-580 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7736ead9949b599b12c5a5ce20c2f0f657d27df81225411bc2dfbcedd063ab39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (44\u201345 lines \u00D7 2): crates/liteparse-python/src/cli.rs:449-492 | crates/liteparse/src/main.rs:594-638 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4e3f9ec3a01acf9a4101235c8d049a779e4d9efe54808b3fc062c127484fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201341 lines \u00D7 2): crates/liteparse-python/src/cli.rs:275-313 | crates/liteparse/src/main.rs:416-456 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e761cb3593bcc32360ec346ffd4d5afd98784d397afab6ea9df175b63316e4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201338 lines \u00D7 2): crates/liteparse/src/ocr_merge.rs:461-498 | crates/liteparse/src/ocr_merge.rs:609-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/ocr_merge.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e2ef2f1ead79dec73a964f02209ffa74ea8c6bdf866c714a03e52a6c46592d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201335 lines \u00D7 2): crates/liteparse/src/projection.rs:3547-3564 | crates/liteparse/src/projection.rs:3930-3964 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":3547}}}],"partialFingerprints":{"codehealthFindingId/v1":"5062aa761487aadedfb919702bfd32409606c9bf2fc56c2779c9c382ea1e4628"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): crates/liteparse-python/src/cli.rs:364-392 | crates/liteparse/src/main.rs:503-532 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a5ba2e4886ff04f58c07e46dc9b459fd22e46a0c9f2fe3e616cacfb0962bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201328 lines \u00D7 2): crates/liteparse/src/markdown_layout/paragraphs.rs:139-156 | crates/liteparse/src/markdown_layout/paragraphs.rs:183-210 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/markdown_layout/paragraphs.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e7c3d9239b5897530cc71734719e1c12bbf6688f5ed3a56d06e591266a7169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/liteparse/src/projection.rs:2306-2332 | crates/liteparse/src/projection.rs:2565-2590 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"7381518fd100fa684016037abbe09d0a47ed27e47f22daf42227dda58b2ddf4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): crates/liteparse-python/src/cli.rs:582-602 | crates/liteparse/src/main.rs:751-775 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe24c71ece422786eb2668782b984755f7e0bb365c021731c9619e701bfbc35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/liteparse-python/src/cli.rs:509-529 | crates/liteparse/src/main.rs:664-684 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a6412663aff6dc3c12c8ee6b9eea9178ea497f0ec980e4d8d3de5e0fd45e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/liteparse-python/src/lib.rs:1201-1221 | crates/liteparse-wasm/src/lib.rs:1545-1562 \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/liteparse-python/src/lib.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"a004cd07bf10da1d6e0f8f645056262cfd39bc56665c96b2d97e7a3085c52a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): crates/liteparse/src/projection.rs:1645-1663 | crates/liteparse/src/projection.rs:1678-1695 | crates/liteparse/src/projection.rs:1710-1727 \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/liteparse/src/projection.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbd4054f07a079c5152f8f597a26aec41ad85cfd26fc9be0a368eb82fc35166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/pdfium/src/text_page.rs:321-339 | crates/pdfium/src/text_page.rs:349-367 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/text_page.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"424a0f2b60196f238eaa26defa6a3c07ff26398178f8bad43dcf962b7f46aa93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/liteparse-python/src/cli.rs:344-361 | crates/liteparse/src/main.rs:483-500 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"626f168a64ceea017a8106626f690a75535f3be0377bbf485e0be7927a7fe2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/liteparse/src/markdown_layout/classify.rs:908-923 | crates/liteparse/src/markdown_layout/classify.rs:1041-1058 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab08d93a4e26206cc9f819986552888ba4fbca82d7a2a465df77fb592836935"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/liteparse-napi/src/types.rs:987-1003 | crates/liteparse-wasm/src/lib.rs:644-660 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eb62c70b712257c09fed0081b36584de2f0d96532b3006d084f03b4758f153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/liteparse-napi/src/types.rs:1125-1141 | crates/liteparse-wasm/src/lib.rs:918-934 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de06ff7c2eb5dbc429fb64d5225cd47d0265f4c14856e54cf2bac5fabcb47c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/liteparse/src/conversion.rs:507-523 | crates/liteparse/src/conversion.rs:606-622 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/conversion.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdec27028a4d8e5f348031068afcddafdd55ed9097cd2abb17f5d9955846c219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/pdfium/src/text_page.rs:153-168 | crates/pdfium/src/text_page.rs:183-194 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/text_page.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03122112e1690cf0c3dff3698ce2955d1383315f771726f86b3dcafdf80d408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/liteparse-napi/src/types.rs:227-241 | crates/liteparse-wasm/src/lib.rs:215-229 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"57891ca02cb5140d5dfa3e23c47040e6cdb80b0737d4d9e30c9db0b623186be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/liteparse-napi/src/types.rs:884-898 | crates/liteparse-wasm/src/lib.rs:692-706 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"e653b925e6b6eb0af3330ea0ae658455db5a1968c1e5a6c4fb04aba41f8672e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/liteparse-python/src/cli.rs:326-339 | crates/liteparse/src/main.rs:462-476 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"de65d362266470425d30092e94fbcc5072c574f1127bddcfcefa9fd3fb29dccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/liteparse-python/src/lib.rs:1127-1141 | crates/liteparse-wasm/src/lib.rs:1494-1508 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse-python/src/lib.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"254d28f0fee49f54feed21ffa94db27f796e5c99cfacf81b66d82e45474d53dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/liteparse/src/markdown_layout/tables.rs:1199-1209 | crates/liteparse/src/markdown_layout/tables.rs:1359-1373 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6e3be0968a5f18245b5ffa90018ae8bd0c9c544f6ed70beca3cb322079f9e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/pdfium/src/page.rs:554-567 | crates/pdfium/src/page.rs:633-646 | crates/pdfium/src/page.rs:2033-2046 \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/pdfium/src/page.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04484068af219e930453da894ddd337816fc44339c18213045027624ae10e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/liteparse-python/src/cli.rs:493-506 | crates/liteparse/src/main.rs:648-661 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79329167b48a52e57a57587d16cd6e7bcca5c5c2ed76e41afb2da56d06b220d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/liteparse/src/markdown_layout/headings.rs:219-232 | crates/liteparse/src/markdown_layout/headings.rs:281-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/headings.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"404773f1976ff448e3d51697a5692bfd8c3160a33b785d251c5408ccd7572ff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pdfium/src/font.rs:203-216 | crates/pdfium/src/font.rs:239-252 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/font.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c03d9e8d9bf44d44a45ae4854e39b45a1526a1f23e66292f29dfc32e4c2d49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/pdfium/src/page.rs:1798-1811 | crates/pdfium/src/struct_tree.rs:334-347 \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/pdfium/src/page.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b67e4c6ec9d4f53d7109bd83708a817f1a61645305a89b93750ed528213334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/liteparse-python/src/lib.rs:1572-1584 | crates/liteparse-python/src/lib.rs:1590-1602 | crates/liteparse-python/src/lib.rs:1609-1621 \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/liteparse-python/src/lib.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"31da8ac0d1a75cd481b730bc21eeff3bd8f1ad3e309ef91c56cd36ecdb84576d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/liteparse/src/markdown_layout/tables.rs:669-681 | crates/liteparse/src/markdown_layout/tables.rs:2653-2665 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f29061d00644f61ab477cd975107e20bab47e1dbb22c0c5709a3f44523b6af5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/liteparse/src/markdown_layout/tables.rs:3933-3945 | crates/liteparse/src/markdown_layout/tables.rs:3969-3981 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":3933}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3efc3b1a21c587af2ab97724ecce607773f0fb121b391536d4cfc06faa8e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/liteparse/src/projection.rs:3524-3536 | crates/liteparse/src/projection.rs:3903-3915 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":3524}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3eafb05293bd766ccb64dbbe638a96d3dd78370e8914c4ec888ff2e2cf79e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pdfium/src/bitmap.rs:155-167 | crates/pdfium/src/bitmap.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/pdfium/src/bitmap.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a27471e294b09713253b217667a152ae6da85a1edfbbdae1ad5a8375c808911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/pdfium/src/document.rs:370-382 | crates/pdfium/src/document.rs:419-431 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/document.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dce98457a9e8fe03b21b71236645fba927533cce9c2658b9a95a5094e409c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/liteparse/src/extract.rs:1786-1797 | crates/liteparse/src/extract.rs:1801-1812 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/extract.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e717f13e826506e77751640a606c0a945e54e722ce256d4db167ea0eeda687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/liteparse/src/extract.rs:2575-2586 | crates/liteparse/src/extract.rs:2971-2982 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/extract.rs"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"f969045c5e1e5ae93f956cd191ec5633a62df542e76adc07124689292f70cef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/pdfium/src/page.rs:618-629 | crates/pdfium/src/page.rs:788-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8477bff494e32e4235f98a61eb305e94184c7f1449882de2d67cec8ec66300c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/liteparse-python/src/cli.rs:258-268 | crates/liteparse/src/main.rs:358-368 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfba28c17f4cad1d7a833e44ddb98255d9a9938cad7ab31705131865b117c330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/liteparse/src/projection.rs:1865-1875 | crates/liteparse/src/projection.rs:1878-1888 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd2665e88f10a993bdbe5b170cbf60e87a201c21e952efc42abda12ba6e2ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/liteparse/src/projection.rs:1853-1862 | crates/liteparse/src/projection.rs:1865-1875 | crates/liteparse/src/projection.rs:1878-1888 \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/liteparse/src/projection.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e91a3910b25cca3a1f94152fc4fcbb041b373fe2ef8006d1f04f42955cdd85a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/liteparse-napi/src/types.rs:202-211 | crates/liteparse-wasm/src/lib.rs:196-205 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"da65c5dbff3add6f2036cb6dce6d0c30540c2c36e8d978fbb737605ade70046d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/liteparse-napi/src/types.rs:290-299 | crates/liteparse-wasm/src/lib.rs:291-300 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b095b3779e1281718863c392f6e997a07131671630226cf4d1a4a0a01bccae28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/liteparse-napi/src/types.rs:711-720 | crates/liteparse-wasm/src/lib.rs:770-779 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad0a41c10d736b6c64e3717e563948ad85d27a387c77fbab40f5f1131ae5bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/liteparse-napi/src/types.rs:215-223 | crates/liteparse-wasm/src/lib.rs:206-214 \u2014 before extracting anything, compare \u0060crates/liteparse-napi/src/types.rs\u0060 and \u0060crates/liteparse-wasm/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 103 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/liteparse-napi/src/types.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"139bdbc8a7b88cd7570aaf886c11ce98da3a4a25325f736c925691b02e93a844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/liteparse-python/src/cli.rs:221-229 | crates/liteparse/src/main.rs:371-379 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7ba5bdff4e5f7350560be98ee7ebcbc53038f46033bb61053a4f5caa0d4bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/liteparse-python/src/cli.rs:566-574 | crates/liteparse/src/main.rs:735-743 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"552d522e9da89c0b1d9af8e70d31c46d05a8dfb0c5f0dbf200efe8e649699b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/liteparse-python/src/lib.rs:451-459 | crates/liteparse-python/src/lib.rs:1885-1893 \u2014 both copies are in the same file, so extract the block 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/liteparse-python/src/lib.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9f6b1c747e84823922466eabfeb48156ef0d347cacec88232fa15f35523f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/liteparse/src/projection.rs:1583-1591 | crates/liteparse/src/projection.rs:1619-1627 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"130da3cffd9e016c4b8bfb0bde593ef70330dff6f1b6439f18970680f1d5efb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/liteparse/src/projection.rs:297-304 | crates/liteparse/src/projection.rs:316-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"704820828d80ca7b9c9a4a38af7809251036083c8743dda4a4c6ae0b3e12bd6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/liteparse/src/projection.rs:2540-2547 | crates/liteparse/src/projection.rs:2552-2559 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"debc9c9deee0ca03777f6c7365edae301effa4b8086c30c2610dd5f1e2f096ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/liteparse-python/src/lib.rs:1702-1708 | crates/liteparse-python/src/lib.rs:1744-1750 \u2014 both copies are in the same file, so extract the block 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/liteparse-python/src/lib.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b528775bdb052495391228cd6de724517447adf19e3e27b8d552617bcc659276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/liteparse/src/extract.rs:1542-1548 | crates/liteparse/src/raw_text.rs:185-191 \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/liteparse/src/extract.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc972023df7ecad3b2282a8ab7943fc85cf82329359da09bd9b653643b478640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pdfium/src/page.rs:1031-1037 | crates/pdfium/src/page.rs:1182-1188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"3784ac1f22d9d3403438aeb8a8b1fa8e35a15d5519b5e6f2ba55c600a5a914de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/pdfium/src/page.rs:1079-1085 | crates/pdfium/src/page.rs:1181-1187 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/page.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb05d1ec15d5664f9af13c32a8b754aeb42d6e22546a4d449893a548055db17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/liteparse-napi/src/types.rs:508-513 | crates/liteparse-python/src/lib.rs:486-491 \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/liteparse-napi/src/types.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad97bff80fc5c3a70174b77c74f8044d568d307ce40285a91e23706c9ca5a2d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/liteparse/src/markdown_layout/tables.rs:657-667 | crates/liteparse/src/markdown_layout/tables.rs:2642-2647 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"38852d16be9bfbecbcdb6a088c3afe6b0fc1a71ee4b249a869e7e75c5f766936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/liteparse/src/projection.rs:2293-2298 | crates/liteparse/src/projection.rs:2525-2530 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfaeeb3e507985b5167488e044d117375ba2d3af600cdbb44ef3c37d4ce2fef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/liteparse/src/projection.rs:3309-3314 | crates/liteparse/src/projection.rs:3336-3341 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"787cbe863b7f614cbffade4a2cb06b379b73398d075e2371c7fd9a01751dfa01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pdfium/src/page.rs:1821-1826 | crates/pdfium/src/page.rs:2058-2063 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/page.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"131f81b9faed87dfbcecc88ea84574beeadc1bd5db129f2caf289590c74d7bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/pdfium/src/page_object.rs:168-173 | crates/pdfium/src/page_object.rs:309-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/pdfium/src/page_object.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb0ff2fb77dba4dc836eb8836b3f1c93d0c4d84ac566ed319c836e8261cd4ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/liteparse/src/projection.rs:3528-3532 | crates/liteparse/src/projection.rs:3629-3633 | crates/liteparse/src/projection.rs:3907-3911 \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/liteparse/src/projection.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe120a94a7618784b71897b981b0fe06d67df0a7a8970cdce80c5587b52ded6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/liteparse-napi/src/types.rs:506-510 | crates/liteparse-python/src/lib.rs:519-524 \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/liteparse-napi/src/types.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e176f6d9bb63565f72a18cb831a12f6305d6ce8bcecae1848070353b55cecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/liteparse/src/figure_cluster.rs:268-272 | crates/liteparse/src/projection.rs:3425-3429 \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/liteparse/src/figure_cluster.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4fbf2741dd4166bd12adc4a09bc3ac656bce254480899bc6d329290d52501e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/liteparse/src/markdown_layout/repetition.rs:368-372 | crates/liteparse/src/markdown_layout/repetition.rs:379-383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/repetition.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc07875a35e047824e9eba9fdcf14394e169a72cef580b82b2bef78e0eaa05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/liteparse/src/projection.rs:798-802 | crates/liteparse/src/projection.rs:832-836 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"79016b777d04376f8d3fbfec467a5251c3b112fe1c6e9312bb89311f32aa900b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/liteparse/src/projection.rs:2529-2533 | crates/liteparse/src/projection.rs:2543-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/projection.rs"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"175853c0922c57920a2769c4b487733205746d446a896b51dcf54c99138585da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/liteparse-napi/src/types.rs:837-844 | crates/liteparse-python/src/lib.rs:144-151 \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/liteparse-napi/src/types.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc97b829e58436beac51d3bf3455f6b8e75ed32ab930291428fe6f09933c51cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/liteparse-python/src/cli.rs:231-241 | crates/liteparse/src/main.rs:341-351 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac8733f1b0771e341c7253a8e8a85d892cbeba718f8ab97457847b0a677c6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/liteparse-python/src/cli.rs:553-558 | crates/liteparse/src/main.rs:722-727 \u2014 before extracting anything, compare \u0060crates/liteparse-python/src/cli.rs\u0060 and \u0060crates/liteparse/src/main.rs\u0060 as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 302 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/liteparse-python/src/cli.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"649f156c9b302f8e0a52c35d530a59ffb4b3586974fb68fe3b00dff6ec73c5dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/liteparse/src/figure_cluster.rs:319-325 | crates/liteparse/src/markdown_layout/tables.rs:3688-3694 \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/liteparse/src/figure_cluster.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4eafe416c74fa3d2681a730d90d8411a4288f6471f57bb2c0fd485b7e69b05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/liteparse/src/figure_cluster.rs:327-333 | crates/liteparse/src/markdown_layout/tables.rs:3696-3702 \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/liteparse/src/figure_cluster.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a27989c463456eefb7f0def1690e49ebd0a19f5b6cd20585e8e1ebc1486579e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/pdfium/src/document.rs:437-441 | crates/pdfium/src/page_object.rs:280-284 \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/pdfium/src/document.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc223b4a8bbadd6e3c02147c8f519b6e948843948e1811459fad067a9f8fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/liteparse/src/projection.rs:2026-2034 | crates/liteparse/src/projection.rs:2089-2097 \u2014 both copies are in the same file, so extract the block 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/liteparse/src/projection.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"135ae7507094283c7f0a46de2bfa4db2bad164eeff24e2d491821de8e50b9eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/liteparse-python/src/lib.rs:1757-1761 | crates/liteparse-python/src/lib.rs:1770-1774 \u2014 both copies are in the same file, so extract the block 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/liteparse-python/src/lib.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"083f0470e613889fe8d7abb35dd858bc2ce460e1d26a02b5134178acef563021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/pdfium/src/page.rs:890-897 | crates/pdfium/src/page.rs:969-976 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/page.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"28387515d3d30e25d65b09aa802ecd8f7cef4de1e05dc1e19b2fa0a30a2b04df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/pdfium/src/page.rs:1744-1752 | crates/pdfium/src/page.rs:1930-1938 \u2014 both copies are in the same file, so extract the block 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/pdfium/src/page.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cadc65259bd3a90d9d3320d75bba5d64049ea1da45bc6a30d11e32a87dd448f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): packages/python/liteparse/parser.py:407-424 | packages/python/liteparse/parser.py:936-953 \u2014 both copies are in the same file, so extract the block 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":"packages/python/liteparse/parser.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbeff840def2e25cf0d9dae49bc2df00ba57d88bdbbbe9b94747b8662d33d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): packages/python/liteparse/parser.py:98-107 | packages/python/liteparse/parser.py:284-297 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/python/liteparse/parser.py:98\u0060 it begins part-way through the construct above it, so those exact 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":"packages/python/liteparse/parser.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a15a7b7edb8b271aebd685421dfc2befd46cafa18f5977434507ef5f9ff90ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): packages/python/liteparse/parser.py:603-613 | packages/python/liteparse/parser.py:639-649 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/python/liteparse/parser.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d530d1932b29508067ce39ce7a412bb1598627594818f524201d2ec403c76e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: liteparse-pdfium-sys: liteparse-pdfium-sys: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e7e7dac557490826235fa902daa7437e5ae0cb0ab746324f581d785ab73b1642"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: liteparse-pdfium: liteparse-pdfium: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a66e596413cd3752891752938525aa7439fdba05ea8aca7a1b10fe59c1401866"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the dependency install for packages/node/ refused the committed lockfile (npm error code EUSAGE), so the suite never ran. 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. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D11","level":"warning","message":{"text":"Test reliability not measured \u2014 JavaScript/TypeScript suite install refused the lockfile: Test reliability NOT MEASURED: the JavaScript/TypeScript suite\u0027s dependency install refused the committed lockfile, so no test ever ran and flakiness could not be exercised \u2014 the dependency install for packages/node/ refused the committed lockfile (npm error code EUSAGE), so the suite never ran. It is excluded from the score rather than counted as a defect; a lockfile in sync with package.json is what lets the suite be re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"166e5a7f1e7f7840934bd0f1c14ddd658b4d7aa7c7571340b9874ca6caf351a2"}},{"ruleId":"D11","level":"error","message":{"text":"Test suite cannot be installed from its own lockfile: packages/node/: The node:test suite in packages/node/ was never exercised because its dependency install refused the committed lockfile \u2014 the dependency install for packages/node/ refused the committed lockfile (npm error code EUSAGE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a35ebce20196ca228d43cdf911fa848cb84399eed82c2877ef34fce3d6d79277"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/extract.rs: crates/liteparse/src/extract.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in liteparse::extract::extract_page_text_items at line 1487. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/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/liteparse/src/extract.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd8e0dc395d1f2e2a8176c9d21ef8a9e3b62ec35d5157cf21926ffe1670814b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/projection.rs: crates/liteparse/src/projection.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in liteparse::projection::xy_find_column_cut at line 3581. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/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/liteparse/src/projection.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"d984b2aba767d3817587cdd73a2d3b60ef2020e6f849e35243035508e6742606"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/markdown_layout/tables.rs: crates/liteparse/src/markdown_layout/tables.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in liteparse::markdown_layout::tables::assign_cells at line 4214. 8 of those changes were fix/bug commits, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/markdown_layout/tables.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/tables.rs"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc755e18ff9e4c72fdbc1b9da6678dce7d7045b10dc7f73ed0b86e5ebf15142"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/parser.rs: crates/liteparse/src/parser.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in LiteParse::parse_resolved at line 617. 7 of those changes were fix/bug commits, and the other 40 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/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/liteparse/src/parser.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef3f603d053de7c985c9ba73961e0915ee403be5024588ab94df78573a93105"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/python/liteparse/parser.py: packages/python/liteparse/parser.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in LiteParse.__init__ at line 465. 1 of those changes was a fix/bug commit, and the other 21 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- packages/python/liteparse/parser.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":"packages/python/liteparse/parser.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bbc76f51f7cdcc8a1414b95a102a8a2dd039c3d5b0d3159035ecd3e9e427a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse-napi/src/types.rs: crates/liteparse-napi/src/types.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in JsLiteParseConfig::into_rust at line 155. 4 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse-napi/src/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/liteparse-napi/src/types.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f2357190bdf9bf699eeed24ccde4cbefee2e585263abee0591df9e2b53ec32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse-python/src/lib.rs: crates/liteparse-python/src/lib.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in LiteParse::new at line 1516. 4 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse-python/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse-python/src/lib.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e84c3f6230757f140e4718dbbcaca49742baf6b7dd311938e40f3663c1960b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse-wasm/src/lib.rs: crates/liteparse-wasm/src/lib.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in LiteParseConfig::into_core at line 148. 3 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse-wasm/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse-wasm/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc929da864387e0aa1740137fab9dfac55114005c838a52b743e9e198e6e22d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/ocr_merge.rs: crates/liteparse/src/ocr_merge.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in liteparse::ocr_merge::merge_ocr_results at line 1103. 7 of those changes were fix/bug commits, and the other 14 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/ocr_merge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/ocr_merge.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a210c1a66ae28ce4ec3d04ef57370e5573d2dfcc2789e696d2417ee2b12360"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/markdown_layout/classify.rs: crates/liteparse/src/markdown_layout/classify.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in liteparse::markdown_layout::classify::classify_region at line 529. 6 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/markdown_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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f0616b7e7a7bdaf7e45aed1785497b300f1d940c6aa6dff4bc189e75df2307"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/main.rs: crates/liteparse/src/main.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in liteparse::main at line 413. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/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/liteparse/src/main.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"430c5dc7c45143e12a42916040cafccb6c773cd4c14bc27f7a5d3c767cbafe5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/node/src/cli.ts: packages/node/src/cli.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in cli.program.command(\u0022batch-parse\u0022).description(\u0022Parse multiple documents in batch mode\u0022).argument(\u0022\u003Cinput-dir\u003E\u0022,\u0022Input direc at line 404. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- packages/node/src/cli.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/cli.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"612884cef88e5e37daa7f2a09d9081788d5b9d86824b42e43480dd0a82ee00e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse-python/src/cli.rs: crates/liteparse-python/src/cli.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in liteparse_python::cli::run_cli at line 271. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse-python/src/cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse-python/src/cli.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"456ecfca6e7f21126ee673f4325d4e5a50e3245076aec3905c064e01874293d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/markdown_layout/blocks.rs: crates/liteparse/src/markdown_layout/blocks.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in liteparse::markdown_layout::blocks::render_blocks at line 418. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/markdown_layout/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/liteparse/src/markdown_layout/blocks.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d1bafb5f6f12d0a7d34019401599c64d2e300668cbbf216ea18c9fd7870877"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/raw_text.rs: crates/liteparse/src/raw_text.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in liteparse::raw_text::build_item at line 317. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/raw_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/liteparse/src/raw_text.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"689f97e81692a0be22fee595d9d7907f76d729133f21523d9e365de64a001963"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/markdown_layout/cross_region.rs: crates/liteparse/src/markdown_layout/cross_region.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in liteparse::markdown_layout::cross_region::try_two_col_direct at line 333. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/markdown_layout/cross_region.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/cross_region.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"634318949bfbf6b92ae23e5baea5a623d27765dc47c7175fbd88cffeb2a06ef7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/liteparse/src/markdown_layout/inline.rs: crates/liteparse/src/markdown_layout/inline.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in liteparse::markdown_layout::inline::render_line_inline at line 130. 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-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-24 15:59:33 -06:00\u0027 --until=\u00272026-10-22 15:59:33 -06:00\u0027 --full-history --no-merges -- crates/liteparse/src/markdown_layout/inline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/markdown_layout/inline.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb6a5d138956a6d3471863670ea0e80f9b399dda2979a30022f6f98388fa8f3"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 14 significant file(s) lose their only recent owner: crates/liteparse/src/markdown_layout/headings.rs, crates/liteparse/src/markdown_layout/blocks.rs, crates/liteparse/src/markdown_layout/repetition.rs, dataset_eval_utils/src/liteparse_eval/evaluation.py, crates/liteparse/src/glyph_names.rs, dataset_eval_utils/src/liteparse_eval/benchmark.py, scripts/generate_filled_acroform_fixture.py, crates/pdfium/src/font.rs (\u002B6 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3dccba1c19fdd9f419fe3122e8a185154b75201a66c6aa3a8f784f6fb1f43b16"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (16 single-owned of 76 analysed files in total, 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; 76 of the 103 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: ocr/suryaocr/server.py, scripts/bump-version.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac6a35740f02273dee70bbc51c6c0978daa714685c44694a3b0fbc22dc72fdf1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c717892252d9226b5419d500570e944c7720e2fbbd6812b30f0f21d0b2f8758"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2759bb543af2537047d7a87658d99ebbd896243dd98811438435ebdc824d7e45"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6d2cd74e74ee1e392e60bf48476b4a89681cdac4041ccd39889dc66ae58de19"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0878d18c859ae5a8c6ac0aa6edec2110c8fb1dbdcf8f9456dfaa96cb70bec3d5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c57eb4e2a4b1880d26d17d0c5a0bc74599336ffcf08663eba60ad17374e9b7ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7652364d408043c40a147a0797740ef1fbcf7d787e5b52f39e56b61d9107511"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15b99ee509e0e0ec7e1717fb1f795fd9965a304a32929af9d9fa729b34f7aa76"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a65bfde63ec2a9cc303122a910de13db26d7c04286171b3a514ab36590d5303"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bde3ff6a3feca0d1692805105085fcb8639996bc5e6d836b93dee23571bcb46"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97eb3ecb3f7e775e3640d2c6ae06ba662a0dba7d4c7dd2bcf4f97f65338c38ed"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8199cd8210b20aeb783756fd38182e219af240a1b6c1804089839de650655f32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"817bd491a2716ec15a6cf7522e56ff79e0575e7b1bb3eec6b6c7f73aa3ebd4c1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c371e80766843abbd11a86c102cde2234d27453e5f3df484f642247591a77f2c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6595aa59403dc92cad4548744c521159038afeb94304d244b7f616ca1c77d73a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f8fc531c15702db4703bb1165ef265ccd581749f18e1e79e746663a4cd16ecf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0e93084629c1d042b68b844e0c1b91dbcd0aefd7c5f4ea8112f910acd40a601"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e18c7e5804a9ce93a40d7011db0ff616c9e7d98c472385b9f4968626a2703f70"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc1aa9a553d673c0a8f98d88e7bd0162ac8869c32729348f85c1dfb0b7234625"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cf5ed7a94e99c9d2cd8c7cc6a8e61be06fb1b61571d3794bef97ccc7dfd99ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5084a91001778182f52a79c69f49cb48570d7e1329014c8fd4b6853100a395b6"},"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":"262b8c22a4ca4bedba0ca05567836b0d758dae78eab8c73a862b9612d5325913"},"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":"83a879ee23a0b9c1d14b27143c05462d3f64cb8ca2373e1f37423d2665855541"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f15b3714ebd182becaa530977aa6a39b1a5291853fc154555ba609a527db96f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d998c8d8541b9bcb45b6c0163f3bffa2a9a4381ecd62fa86538e1570887f137"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37ef86f2f85d54188dccbd4590486388c5017a5ae8223225f2ce34ddda966b43"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6bb3d1445e731fe1b99bc1b48a8a7315c42893b0233a3c743e29bab1322f4d23"},"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":"30fa9db28134722d486ec409e26d70e73d16c5ab916472a2eaf4ef06855c035f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d0088d417b5cc475cd2b62a51291c25824c9ba9c2e1e54abfd6a15d102a759f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95dd2c4ecc2c8c6d3a76f3852c6b54a2837a3369fe0a27c007daf9305624bc7b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e53e5d125a1403c224ff2be2eb38ea92f429eb581d96d23e84fa45b26474bcf8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc7154ee27b5a4e9427f814b85b15d77a8fa2bd731df132db6e8005611c7db29"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61d2aa6ad5aa5d2ab1e3e977664b25a7a770ef7323224829f0677ab7c2cb7aa4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c011ece8f9ec0e10a03d723bf01ab87b6e8d236f6818cbf19cee8c1de7c80fec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b549d9de0052cdcf3a0fd587b9baa6d0b3f93fe1c813085c4da28502a20e77b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e507844d9e29fe4e32c427b050c7736a02e75f8a3d95373e2469a28c729e1b7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f0cb1016bedd8546ecbe532646e2cf508911b1f367ca5469b87e6b76aa7fbcd4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d58b403c4d3895d2c304e3e37938813e5845a57ad6b8cc032e4bf75fd08c6546"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"651ac72aac9d6d837feac4f676128fc5b25458fe1c3d7c36051eba52f1066c56"},"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":"2c48369d0f8d58ccb6faf59d9f9a37baef5a18f3cbebf8482476ae0a48c4989b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f85f064633699d986e12398b66d4eeb3a0a710f0d299115b8c0defba5751f16"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6535f00339fedb232b64cacb0478221c5b37e43cc96c03159c6f671e8fa6826"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14fd294d6db9936a8229c9214ec84d205ccfcffa8449dece28bada691f0292b9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aac5c8fa82b69e5201bfbe5ffe7086bcc1e40cc3758f62110f02ee6711b82a57"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b87f9612df67e8e9fa31ae1366783b3b42c2931b15eacd06f5e8142e164f54e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da4ac5829903ec047c3150687eff077ddb62fe7424f92058ab1d3ca18b158f15"},"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":"4141296c0e6ab265cbf2fb041265f90b82012bfe8e7781cdf65cb4abae55a858"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b24ec04cfe414c3ed22de6407f746e216524d4b89f857f2a84491b777594b1c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77070e4d9089fd87bf43027da43d9d35107bf9fbcc599166ca37bdb0ecf283cb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46ed5088e372a1645841089d14aca0a25845741310820ce62e7cb1a6cd16763b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29a123e5ded039aafc5f9608aaec5c5e039833e07d8997aa993c9ad344fa17f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4cb465e1f0d2eae4c574d9bbda594dca37b461c20ca4391a9a1ab1fb76b76e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34f998d59eaff18b05f62f3ffd53eb1d86ddd758e021a3b06f3dd141181d69a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d7d87f4e305b31fa6ca8def5f9170189beac7a01d9e444172165bd47515ea63"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"014b24ea9f065b107ee6c20ece28cb79839c085336bf5f008a51fd15eaa0d0fa"},"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":"dd81e15c6af3f3f79e34be2525b624faf73d45fc44a35be7d66a9d596e8bab19"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"786dcbf8bfa4c3d982cd93a951203d8cb7a7e36feb498c9c1dbd565556246cf9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0c36c77e53bf9a201cdd6f87e8eeb4a26af2dac99d1fda71d4d58c82a324d98"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bb04dbf43893475e9ed9b19b9a5d8f31fe93ed0be227e90da26b9b34a61f0266"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7f84379e383281f00bf6db0372bbc0441b9cae83bff584b04385c0466b98cde"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d1dd7092542b2ea0e748b8ec1f156b7c5f3461c92355bf93585be49b51f95bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8cf897c3f0346d00b6e99db7deb5a8d319af566d311ce40368c4b37ad1c75609"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c87b753f5e819651307bb54a2dc647ebe24c7756039f8646d3aef936f55a40da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4cbc58df962a9a61802bc867f2391669e2c9ac25df6b60822d55879322c9de2a"},"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":"eecacbc84600d0b16b2afe999d9c175b3af67263869906b0ccacacab87b17e74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"98b2ce03b45789252c6676ce3fa69eb1b54e82c4e6e354501705db61e5a1ed43"},"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":"d283bb1ebc16b2b6610d6cf32eb42b80c62a2e3b9b052b1f395ad0f65622e429"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5637eab3d818fedac5ffe7622c2d6c0240089805e422bcae49e7d8413307694"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62ac0357045a96d55a365e452d6bcee0fc2a6a7944997c4638a45a64e4b3d727"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37b6bb5a7a103fd2f7fe0475b6b4edbdf918edcadbdfbb785a1db844dadd14cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2132ebaaf14e2aada733b7841eb342377666f741ddbbebca884bd1183c2bec2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53558cad848c50740171c33ffb55d8eaf559fff206c1eb4ca15d61511040a3ae"},"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":"d68871bc61689c13e04b995e65a60fbe9a326977c917b52348f2fd7ca80b99a9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82ea0d4e37afdb1fb84b31411b1c621f7406242ccf26bf583cab826141483497"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ea82011e65584f1fec05de42621dfb7bf11721c87bc97102b9ec1921e5b85e08"},"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":"f484011716cb821e38e778ad0dec8baf6489ea7aa7b9dca89df02eda5195baab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2c7ac59ccd5ec06ec20d4541f3be1a332023ddc9e2edea7281ef75d67adc6d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5be39a6755b394900a0c55e3a6c8c7fbd401df46e51cf81b3dcb6551b0203213"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a0c996e4a0c3fdc5c68a4944d9314f6e292eda07fbe1df6b9389c6f4946c2520"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52b3c5872fc7522273fb157e2d05306a222304d08922203292d35e67faba3741"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4464d95f6ce4ba5dabd1d6b4dd8172492b8e7071b00ba16edc722c5b154a2a1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"806ba28a39dfe3dc20c6b51c6434b260da70d06a4c1dca59cddd351f86250ae7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"733eeed0058c84ae9982073493452038866c446ecc267394ef42c281d5273d55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"442ed558e4d98b2027d252f09036206871be3e8a698552abce1678673b060ebd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf6bac216d3cbf1fcda59d2d9ba021938f798c4df885391629d7288d73c7b7b0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a656c70b72a59754d2b8985e16d3ebeae342746ab73bfcee5f486bd77129b698"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61f36567cb41c49389c8586f1ad1ccca4995e4caad4704d07c124d37a2c82504"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b439329ca2bd31b1c2b88051cd2317f35132f2990e87fea65a7940d8f8b00db"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d804b4e5a1a1bf2dc9181964d569d4c9f8f2ea14c756ba52b7f55f632a6528f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2773c6b2f25a9df0da2394a84e5428cadb1421f7c894e4e2a13571c95a5cdfbf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6825b7f30e0ed2b4b191f5d0c15e21a0a2b66961cc812d306b15087d201c7ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cf66c7f6bb72865fdf31cdbeedc22903efdb70ced10fd567f0933736a6426b9"},"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":"610643cf8aa8822bd5d3734219fb63e4dcb121fbcb38629eee3d98feae40799f"},"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":"dcd826ab16a15689a53c1d0470a52f9250031d0f0338026767a809a1a4d06321"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3bdbef7e54e191483d876f4cc538d13ec664fe7a28b18d6f4402ab5d090b1985"},"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":"924c2d13ca7fd2b4129dbf95429d150bd11c7ff8602200beae15ca402d38177c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69b4022af3bc1b604021aaaa8c17eae15b3d1c3a46841887aa507e2bf30a4cbf"},"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":"13d30ad0dffe63e8e1ce28cab774cddfa7b4d8de0bb42a2d0191c596cd47bf7e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"402527aca5275e98dcce96caed3ed411a3e1dbfa73fbfdb5c774b35dc14313be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"66059f8f628b7a7e525817494061ba90a4fcdda57b8bce696941049ad50286f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4775f35f5847b6130b5e4b33ab568245e5409a458ddbfdc7e4e63a778e1c0dce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759a321db5526941df0b9b1dfa052eb6b42832f3933c7187e01cd533c3b42a88"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8d43e8f931c33d5d6162749e6b1e6267534aaa747a838d080d92c2bb9208055"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f57f912740c29eaf2098da84f6ffdd807ed4c8c3968347cd288b9f14ffcb10c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51694dcadcb1484003c3b621ae18134d747d5c49405cfc2349fcebe88f653f0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c06051938303e391f30117e18cef052254cb7f1e6f04305495c5e2eaa060d9a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac9b6fbad98761e1147e7b4dfa57763e4b3814fb377e1f8f8f77d49052fb2a02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1a3c4ee5cf76d6bcb67d33b58764c364f19679eda3d6025688dbb18cd943cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36c430b7455d0328d75759fe89c6d195729587c8ec567c033f2b039f3fb16315"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c66f323f8d231125ebcd4afee8e2c75829be1b4e0f2e25c898caf31702559d5b"},"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":"b1ef740d39790ecdec811a3be539c5681ae47acc506a6e3698abc95d91136df8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77a568012776ce6b76521e424af5b628280eb43dc018b57b466a14167520251e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36307450b54ab10277f8f86c344e7f73f9ea14b503f5c838ca5a5d34c75fd725"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"20640f19c361b83b4a14f85587f4ef9dee39779d1ce357e34f75930921bd3a90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e743bc14e22f77d8e98d8f14a7abc4475bc3003fcb7c98b684c45bd104113bbb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"094d8a7ca9cccd790e08320ad9e6215a06165db90c8a0c9b40bf89f229849b64"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d70e0b5b9e728452b63bb08051bac5f274f5b6685a0dd05040e484e45ed528c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bdad60fb91e5beed6d8e2ced0d005281f7e7e3c1efb55320d52870af17f67126"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"368fbe52225d44054bdef011a8e8ca860283ca5d928835dcd254b204c0e7e31d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae40e0a183df80d5dc91dadf0f98b8fb53348980981ea420dd8271b894c7bd62"},"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":"0cf0db42bfde4dc5bcc039582fea506a3ebb525f6104f3d74d5128f53862e4fe"},"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":"305ecf222ca12e8fef83e3f22a1abd666c305bffe91c732fb69c9c4c77d96602"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78903f93ce0cbefbcb1667e7c734695f43728efef450edb1a95c6e167f972047"},"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":"f460cdcce112ee4d4d26b4dd2cbee069134055a82aa6d560540ef01c5dfb853a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d17623529748e469d39b87bf5dcf61f6e7d9b9e6836cdde2eb97d29f52b9511"},"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":"42ee94440cd2cebe1674021f05a089dfe28b30e9a317acdc7c6d1867390ebc16"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83bdf5430fba0b84fe5ab923c1d5b4729b748a2ec68caddbd94ade9591c44c3e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a6ad6ceba8cd41f22951d0a2d93a94b1af772795961107d2ea0104b92da65c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91844b3cfaee46eddf53297cf75a6de3bf00c40b48657da49343699986493ec6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c22ab3246511c95a6c16d7e0b3788df0ecccbe6a32ccb32231f9da257c3fe7cc"},"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":"31f1f36099088d53818a05ea6e7d569ad4b2fdec89a76af3d92ac62895ce4c75"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a16f4f5a6afa6738bf08f565604e135e24a334991fda871e1596cd4c0a9067a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6126763cd0cb0572ae4c915874f8bc218cb2c75a9fb2952f31e13b2c865a9f30"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2eb31d1e94924fe8e1ee1b7aa97305ecde5395615171e9cddbdafbe45f5c2170"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"edc628ba2621b5412fbd31f6bcb5eceb90e733d35febf6487385f10d9740cee7"},"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":"628037ff67816457882aa3190ed732c50c2b6c57f39993536d2a41d1eda43aa3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"478b3329b9bcdbe05f75302dc0f08865cffcdbfbd8b8721c837410df625a0f65"},"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":"6500240e448601f50d35ccbc1b6416ae3e4e8bc5649a8204ec95ce9246c2db18"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"478aec3dce290409ece83343cf83f066ccff36abf57aecbb2549c8a4706a3d20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b880c2c828320a7efff86bfbed3f5e2f18b8b43ff4037851e93b9e8b5ba0a714"},"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":"4140282730c5c7e333ec70fbab7c5d4d849be42b3c6d7ced83bcb2c37174bec5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5d74a9cd809b9ff7c12cee181deb0b811c7c3a877468e807b88a39d4f87c46e"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5c1a8f1b0512966cd1d43a32ddecc17c875b12333ad41575afc563344eb5bcf"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e6c77db57a019f1b64c839f0ede9ac9037f61a4b85a78bfc2416d852f47e0ac5"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95e9b0e2070fbb21be03f12a64dbe15928fa48828258dce8979b1e30a02aeee2"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcde25c817cb3b92b35a8921c76ffe94f3e48f928db6807fd99174deaf169612"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"164883e328e2d11e7093513a96aa663895b9139d80430dbd777a1e1ed36ec5fd"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dc9045aa3b82ac48afb8be669f5e7bdcd4b6448c3ef3233aa44d45f0b2ab13cc"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01a2c487f9be5e5a9c8cb6433563f861949df1767cf83f5f7340d2e487864a20"},"taxa":[{"id":"CWE-502","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":"4b13fefd51984f3aabffc9a1e77b3e116cdbecc61a684935546671432ab3f2e9"},"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","[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]"],"reachability":{"kind":"production","file":"ocr/indraocr/server.py","line":13}}}},{"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":"b75ac6594d3e67c031730f484ca8f46186a3aafc798c6971b8b2389bc0fe6150"},"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":"da724ab6a1edf2834ae6022921f5bc99d1c593e8e0e3501409b57eda274d9068"},"properties":{"dependency":{"package":"filelock","version":"4.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE 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":"46b5bfd0dc779701d378df2f383d398312d1ac46bab58b7502b614e58665bef7"},"properties":{"dependency":{"package":"filelock","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA 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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","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":"e42f034c67d65aecbbd6197863ec1511b12fe8de80b74391107426a88ae63e4a"},"properties":{"dependency":{"package":"tsify-next","version":"0.5.6","advisory":"RUSTSEC-2025-0048","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":"28fb663915b1667dcee72df09804ecf474b9bb35feb353632260ad03ee131263"},"properties":{"dependency":{"package":"ttf-parser","version":"0.24.1","advisory":"RUSTSEC-2026-0192","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":"c33ece8eb14de00890912f1504934bede9e3a653599c9b3a86b872c020b9b041"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","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":"be12c71023c43937a607a177a93163e0581c742a3255ef7103051bf074226b53"},"properties":{"dependency":{"package":"rustybuzz","version":"0.18.0","advisory":"RUSTSEC-2026-0206","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.0","advisory":"RUSTSEC-2026-0386","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","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":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.42","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"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":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342"],"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":"2f88d3a70d29acb7742d775c7077dafff055d53d623adea4448751985efe8ee1"},"properties":{"dependency":{"package":"zip","version":"2.4.2","advisory":"RUSTSEC-2026-0367","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0368","RUSTSEC-2026-0369"],"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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"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":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","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":"eb0b4b60f41409f55abfe4dac3ef9ccb80d05f696e4429652be5925ad2be3bff"},"properties":{"dependency":{"package":"esbuild","version":"0.27.7","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"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":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"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":"6c9bd328f1425e4185802e2cb388fc5dec17b2da92bc5227fa43622d89e747d7"}},{"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":"a5ea733b3f0430897d72d49cfc0f797499e6222a8b61e7f4fef340fdf38cbd3c"}},{"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":"44e34f25660d97b362fdebfbc7b79330138cd287074e8d1d7dabb3fb0fbe6bf4"}},{"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":"1ef9348959ff34c085829c42f4053aa68deeed051056b22b13fbdbcbd209cc25"}},{"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":"d294675aaebc6b387f9119ab107095f1e8b522dda8a702bd0e82e8019e99c48a"}},{"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":"babf6df854977bde85b737cdc282ed0c7a55816df2c2984789b5b6c236e6abb8"}},{"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":"73149a2db2da5ce8aca5860407c75f413eb658e8aa36fc99724d330a98eddc87"}},{"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":"4f897a64de7a61479c42ab1b25b85937e485da03e4dd90bf18e38d726446f302"}},{"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":"309bff4f7c18f4f4b6a8bc4a57e52b224f3cdad7a4eccbb58d67e25b6284fa4d"}},{"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":"0e1b22354b84a16d04a900657e942f47a95d4d6f22ec0f7421942ac294986f30"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"1f3de5ef0b48ca1917c9f9f2286bd0eae7c590636bcadbe579e0347bfdcbbb38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"dd5804a53e83876ea29f28011b6ce028543b092ecb951f9bde1ea53395b3984e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"dec967caa76104746736a6554d18497839b9543d5f84a4e2901a83b77b2d6471"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"dd702164cb224f3f0635f736ba30ce26d5f9092c5f6d8d3f4ad80b71c59ebf2e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"9f12b0fe952253b6e36e15640a8318add7965cfbb3b2f22fcca0a27bd8d4f2f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"801fec070f4298ff8a37ac5544f470a4b5820df105ffe07875eb7cf3ce8d7af9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"2fc8c4ca67c2a99c9b1bd181ca4613abcad80f0fd84717d28e9a2e748d8da99d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"28ea78f498fd192e50a263426eb04f6ece984ddf3059e45f60b822728943f76b"}},{"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":"c8e435c692742c481af45edbcd48941c9681af3f9ca53b7b54448ee9ae23a2e3"}},{"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":"6288b13fa1530f46693cc61c0d678fb9918181b2e986804fb3ff8d82f009024a"}},{"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":"4d2c3aa588c8e0cb85e3df26b0947fd2b5b3a5f1da640dc8a2451d06f6882351"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: json.rs \u2192 lib.rs, extract.rs, native.ts: \u0060crates/liteparse/src/output/json.rs\u0060 changes together with 3 other files \u2014 \u0060crates/liteparse-python/src/lib.rs\u0060, \u0060crates/liteparse/src/extract.rs\u0060, \u0060packages/node/src/native.ts\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/liteparse/src/output/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe07b9cc9ffb38eab7cb9ba325c3a06a5d341ac7ffdedd4caf80f2155ae9254"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: cli.ts \u2192 types.rs, cli.rs, main.rs, native.ts: \u0060packages/node/src/cli.ts\u0060 changes together with 4 other files \u2014 \u0060crates/liteparse-napi/src/types.rs\u0060, \u0060crates/liteparse-python/src/cli.rs\u0060, \u0060crates/liteparse/src/main.rs\u0060, \u0060packages/node/src/native.ts\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8815116ea1899159929cf9645af10b083c4d6dc57854da28c917a61030f4d4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: extract.rs \u2194 lib.rs: \u0060crates/liteparse/src/extract.rs\u0060 and \u0060crates/pdfium/src/lib.rs\u0060 change together 73% of the time (8 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00601fd6136c\u0060 feat(pdfium): facts a faithful annotation/form/struct-tree consumer n\u2026; \u00602625dbe6\u0060 fix: reduce memory and latency for large docs; \u00606a0ea0d3\u0060 Revert \u0022fix: reduce memory and latency for large docs\u0022 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a884f8d2ebeb07fe283e55031ac5f993ac0431d0b060a1e6f7128a1a29162485"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: native.ts \u2194 types.py: \u0060packages/node/src/native.ts\u0060 and \u0060packages/python/liteparse/types.py\u0060 change together 64% of the time (23 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are \u006052f8bffc\u0060 Add page_orientation_corrections: counter-rotate pages by a caller-su\u2026; \u0060e00ac423\u0060 feat: async python parse(), output page labels; \u00606ca990eb\u0060 wip \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/native.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca6812105c5eeb0cc185744e3e8aee077eb70e08e072ef5ee2ea829dd147760"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: http_simple.rs \u2194 ocr_merge.rs: \u0060crates/liteparse/src/ocr/http_simple.rs\u0060 and \u0060crates/liteparse/src/ocr_merge.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603bac262c\u0060 feat: add OCR resiliance \u002B letency optimized hedging; \u006021b2b094\u0060 fix: improve default tesseract options; \u0060d89a9428\u0060 feat: update http ocr to account for rotation \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/ocr/http_simple.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abe2c6fbe0dc2da4fba259a1ed0c9df3cdf7a16ce09bc767e83ed86bab71df2"}},{"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":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87868c76929db7c6d3c4dd4cca05da806676dd9adca918f1ae695d07555de482"},"taxa":[{"id":"CICD-SEC-1","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":"32ced7d36a446ec392013d19854c9d38bc9f46da16d70aba5296984d8837bc11"},"taxa":[{"id":"CICD-SEC-5","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":"92544babb458d957522a360aa53456189cae88fbda90c8f262cfc0a6320658be"},"taxa":[{"id":"CICD-SEC-5","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":"bdc01cec96fbc281786576b72ff8086e6dc5fe4ca3446b56355d94b1a83512c5"},"taxa":[{"id":"CICD-SEC-5","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":"390d4fb96657c1d76be4f4d4b0dfc204a7301feddb6d39bbdbf747f12b5bc9c9"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"wasm-demo-site/index.html"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ab412576d7bb97148c74d8a59b0f730533e352d04499a262d1413f45c57aac"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/browser-compat/wasm-test.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbe3b3fc7d9d8bd90ad0177747e2fde6b97d73f767f16bced0ff14ddb9de586"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 2 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 4/8 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/liteparse\u0060, \u0060dataset_eval_utils\u0060, \u0060packages/node\u0060, \u0060packages/python\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/liteparse/src/ocr/tesseract.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf45ce054554a7cab84169dc19370b8781df1aeab9887f2029a2b33704ace836"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 7 typed \u00B7 9 plain JS \u2014 the untyped files are packages/node/scripts/clean-dist.mjs, packages/node/tests/cli-batch.test.mjs, packages/node/tests/cli-text.test.mjs, packages/node/tests/exports.test.mjs, packages/node/tests/pool.test.mjs, packages/wasm/scripts/patch-wasi-imports.js (\u002B3 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (204 matched lines \u00D7 2 locations): packages/node/src/lib.ts:189 \u00B7 packages/node/src/native.ts:83 \u2014 the two spans are one implementation copied and then locally edited \u2014 887 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/lib.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"772c1b4c6ec92c7ab1389b776865ea1d53189090f3cad4b8d3a847b578f33084"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): packages/node/src/cli.ts:97 \u00B7 packages/node/src/cli.ts:383 \u2014 the two spans are one implementation copied and then locally edited \u2014 273 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":"packages/node/src/cli.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab8f55bfa95418c93e364b9511cc84044188360a41191aade504d4cfcfd1ee9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 42, cognitive 41): constructor has cyclomatic complexity 42 and cognitive complexity 41; 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":"packages/node/src/lib.ts"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab67c00c9f9158f3e35547aa6ba39a4f0e838247dbfc6220eeaa08a8919cc21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 38, cognitive 44): (anonymous) has cyclomatic complexity 38 and cognitive complexity 44; 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":"packages/node/src/cli.ts"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"03225f445e00afe1f94a9b60ad4b81fbb876a6c1a3b122db7b44934ec1b48186"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 37): (anonymous) has cyclomatic complexity 36 and cognitive complexity 37; 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":"packages/node/src/cli.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2192f035c0a4ebacda23c200725a9ef23bc34241026701931c43c8e2b5215824"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function textItemToCliJson (cyclomatic 17, cognitive 16): textItemToCliJson has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"packages/node/src/cli-json.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93cadfaeb3a55f4bd19494c668eb81fda83cba9bfab53e5a8a12986f18b2d87"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 21): (anonymous) has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/cli.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ff0bb7f02a6d25ae065f511527c46f6c8921a851ad62dd473ff1b127f8d0c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formFieldToCliJson (cyclomatic 12, cognitive 11): formFieldToCliJson 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":"packages/node/src/cli-json.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aae059eda2a74dc455e8a514c4ca115447cdb21beb017e3bede00c0ec00d0b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) has cyclomatic complexity 11 and cognitive complexity 12; 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":"packages/node/src/cli.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5545ff65b400c3a42c8a4fd3cd64205ca6749b8af24400b0c7039fc9e5a298d"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/node/src/lib.ts: 1036 lines of code: packages/node/src/lib.ts has 1036 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":"packages/node/src/lib.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf3a2d819c527ad927ee76cf6a0c9319c398112e7898431829fc91a5f7f77c0"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/node/src/cli.ts: 574 lines of code: packages/node/src/cli.ts has 574 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":"packages/node/src/cli.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9ef535ece1222a3cc86cc27e646ba274be360aa8b9b635bbbbee42163ad806"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/node/src/native.ts: 407 lines of code: packages/node/src/native.ts has 407 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":"packages/node/src/native.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19501acffe114e02ba434ddb9658efad003512e040f7f5c4b4656586aee25222"}},{"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":"packages/wasm/scripts/patch-wasi-imports.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb1e837529b53758d5066c2bfe1478d91c11be15a662bfc18ea69e3dedc8d01"}},{"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":"scripts/browser-compat/wasm-test.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79452046077989dd1587fc631e2c86c353e1e930609166aae97bbbc190a28022"}},{"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":"scripts/edge-compat/wasm-test.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb24ff41b0b6ae3ed065c4b8097d985a6efc92eb409f4fef234bcdf9d15a1a9"}},{"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":"packages/node/scripts/clean-dist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1057d789a781d3b5a1d2fd49a52823a5fe585bd0e4cde472a67da52a2de16e5c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e \u003C lines.len() \u0026\u0026 lines[e].region_path == *path\u0060 appears character-identically in 2 files \u2014 crates/liteparse/src/markdown_layout/classify.rs, crates/liteparse/src/markdown_layout/cross_region.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/liteparse/src/markdown_layout/classify.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c322eea3f1a690f967dc3e976479ff92ff0797ba5eed9d1ce478358164833a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060__del__()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/python/liteparse/parser.py"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"0259ad23c722c765727b90d82caf527344933a6a51c9ce0d9f72d0e967bf7775"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/cli.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"173afc7e547206c1ca6a1420e7719097526423d1195baac9560f4a8ab857ee72"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/native.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c68bc2382a5782e630dad919850fc2bb0eb6765ebd5020d58433c558fe3302"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/native.ts"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"87625b279ac50f86cbffc3872e0a0fb70ef0a1acdd63e85da01e81553bd2645a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/pool.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad815512c210b518dde2926949875a0869e3fbe84383b2a32a1cc5faa3e5774a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/node/src/pool.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8746641f366a5104740cdb2138763243ab1ff26a81fc9431a35169bc852cd804"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dataset_eval_utils/src/liteparse_eval/benchmark.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62f15d7403bf075e25f5fe4bb220361a8f20f4a79e55e1530084f581442f5a3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dataset_eval_utils/src/liteparse_eval/benchmark.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"1279b6501a81ac4bd556fe101ccf3a0565314f21f5f909be744dea871e6bb374"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dataset_eval_utils/src/liteparse_eval/providers/parsers/opendataloader.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff39ab2fb7fd84c36787f84f19e77edcc691c50b577af2e2903e1a7293b0aaf"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) reduce the strict null checking score: ~2.9 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 8 assertion(s) across the 2799 source line(s) of the 7 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: packages/node/src/pool-worker.ts (5), packages/node/src/pool.ts (3). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"edb251d0f8dd1deb75ff6fa12d145c3d5c948a70b0aaf8da052107c857335979"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-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":"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/"}]},{"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-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":216,"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."]}]}