{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"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":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"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":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"anydoc::formats::sheet::xls::read_sheet (cyclomatic 68): anydoc::formats::sheet::xls::read_sheet has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01c3ebf4df49f75a34e50e3bfe18b8cde9c784ea55d3e558d1e5831754fdb3f"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::render::markdown::escape::escape_text (cyclomatic 47): anydoc::render::markdown::escape::escape_text has cyclomatic complexity 47 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/escape.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff70fdfa47b65e8c64c78c665f365688c4121d3c27aa0d5624be1af7ba676aab"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::shared::math::mathml::walk_elem (cyclomatic 40): anydoc::shared::math::mathml::walk_elem has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/math/mathml.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb1addf40e11cc70bb05475672db7df30c6d75e2794faa42959e6c087c425c7"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::resolve_number (cyclomatic 34): anydoc::formats::sheet::numfmt::resolve_number has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17efb5bc399c5d87e3c3b9393eb0037782a0b51c53f4e64d4c9903695efa4a7"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::shared::math::tex::fold_alnum (cyclomatic 33): anydoc::shared::math::tex::fold_alnum has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: anydoc::shared::math::tex::symbol (cyclomatic 222) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/math/tex.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13935eedc59ff900d29c9d74ba57fc5e074bbff19ffde7162bd79b13667567b"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::parse_section (cyclomatic 32): anydoc::formats::sheet::numfmt::parse_section has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d1fd4a14bb2351851c2721a52c059dae638e755084c45989d3c945d59e2937"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::xlsx::build_table (cyclomatic 30): anydoc::formats::sheet::xlsx::build_table has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsx.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b57172f0dd2f20763cd9bc3737c47267156ec6f997670d970796670d2169d0f"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::rtf::tables::parse_overrides (cyclomatic 28): anydoc::formats::rtf::tables::parse_overrides has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/tables.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d660b0ee07944c030e79a54556c3fb4032d51105786b6cac1f84caff36c1bf5a"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::shared::math::omml::walk_elem (cyclomatic 28): anydoc::shared::math::omml::walk_elem has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/math/omml.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3083d1c96a511d816273b50cf1b971a73dfe65ac603341f688559097e97c594f"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::text_control (cyclomatic 27): Parser::text_control has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfcb9944d11a0eb497692a881b75359235c2860a9ccffb7d240098808be6592"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.parseArgs (cyclomatic 25): cli.parseArgs has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/cli.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"679f6a99f451b959e3a5cfdac9fa7f068b1840ea4c08a6e554c78430c19930b6"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::doc::sprm::apply_pap_sprms (cyclomatic 24): anydoc::formats::doc::sprm::apply_pap_sprms has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/sprm.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34e777afb10becfb8c9e12583bf189aaacbcf6a3cd75c1dc9183e8ad0d0cb4a"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::rtf::tables::parse_stylesheet (cyclomatic 24): anydoc::formats::rtf::tables::parse_stylesheet has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/tables.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad669eca61b062e1d9ab452612748e609605142cf26dd2c32064267e3f10b13"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::rtf::tables::parse_listtable (cyclomatic 24): anydoc::formats::rtf::tables::parse_listtable has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/tables.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08a8fbd5f03aed3b0cc73d3030210c89017faee593930ff456b5c91ead985cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Assembler::build_blocks (cyclomatic 23): Assembler::build_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":"src/formats/doc/mod.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0d857ab353baa988b7e716246e48ec4072918b2e867846cc2d363766ca7f47"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineWalker::walk_run_content (cyclomatic 23): InlineWalker::walk_run_content has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e89a6617cba3abc0040c740ce1ace7aad887347f0ffbb41f49931e1718a4c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Extractor::flush_shape (cyclomatic 23): Extractor::flush_shape has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/ppt/mod.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"512053e1519a0d6c0290a9e67117a1d10b3233ea4de0f5a1cd784e998d7b25ad"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::table_control (cyclomatic 23): Parser::table_control has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"47eca52dd81435c6ca9113d11a2bdbb736e2a4955a4ea9dd44a10fb9edc97234"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::walk_elem (cyclomatic 23): Builder::walk_elem has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a6c3389a7d6ecbaedf50db8301317f7ebf73d603ee66106200df0a97864a40"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::run (cyclomatic 21): Parser::run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"584748c54f5a494e3e9ffa39df8fec113039aa0d40da7fd5677a53a3a9581d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::object_control (cyclomatic 21): Parser::object_control has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c1b38c22e7fe11696a628f519d708059579264ce45778b2080a23b515d392f"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::odf::walk_shapes (cyclomatic 21): anydoc::formats::odf::walk_shapes has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7116163f2a193830994e5bacb65865d771d05c49bed46ce87634a5d02396ad1"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::pptx::parse (cyclomatic 21): anydoc::formats::pptx::parse has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f3f72e734a0410d8c8e1882e28509db0c227e55f8e02fea7e7d954ddd29158"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::emit (cyclomatic 21): anydoc::formats::sheet::numfmt::emit 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 is NOT this file\u0027s highest cyclomatic complexity: anydoc::formats::sheet::numfmt::builtin_code (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9140e3310a8a4fa34e60cfe677221159b596035b793a61b775bcb4947166918"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::render_fraction (cyclomatic 21): anydoc::formats::sheet::numfmt::render_fraction 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 is NOT this file\u0027s highest cyclomatic complexity: anydoc::formats::sheet::numfmt::builtin_code (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd677fbea7bb5fd24c4060d57452ce137a4d1306bebc018842d543d0fc096ed"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::xls::read_globals (cyclomatic 21): anydoc::formats::sheet::xls::read_globals has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39e304e0a2305cfe81b86e1630fb2911d53e4a1ae577f96d13bb6e18eaa0a9a"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::render::markdown::render_block (cyclomatic 21): anydoc::render::markdown::render_block has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e4b8959b1d568d3f6023d074809a7092cf78b342ffc450a85848cf0e032b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::render::markdown::inline::normalize (cyclomatic 21): anydoc::render::markdown::inline::normalize has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"303c0a127ef7b79e6aa097cd8ce65272c1842443c1ce15fa3ab56f16791644dc"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::render::markdown::table::cell_block_text (cyclomatic 21): anydoc::render::markdown::table::cell_block_text has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/table.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9ae953818715121f435a99300cd265b8c88e9e3e412b8e38fd81b2fd17ed85"}},{"ruleId":"D1","level":"warning","message":{"text":"InlineWalker::walk (cyclomatic 20): InlineWalker::walk has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a144bc275e445c5a10b99f34311a75bc6d2a9f52aead1cc27d13795e1587cb06"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::shared::header::resolve_header_rows (cyclomatic 20): anydoc::shared::header::resolve_header_rows has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/header.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe1b30e187bc2fdd88b118acc37c55663234ef7f2bfd08cbcf546031d5e3d60"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::parse_list (cyclomatic 19): Builder::parse_list has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"037ae28dbace4d1e33d13aa42f6b88185c38ce1bc3347d5f87b1900f4feae76d"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::parse_table (cyclomatic 19): Builder::parse_table has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"023c2449229eedd741f9dd4082659ff97df9cd1a0e553c5c68e9ddc0bff1d6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::odf::text::parse_list (cyclomatic 19): anydoc::formats::odf::text::parse_list has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/text.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"411d2b35fe5b99d2e4c6a7329d94eb688b97806296668e1e014b378c5f4938a8"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::odf::text::walk_inlines (cyclomatic 19): anydoc::formats::odf::text::walk_inlines has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/text.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1255db571bb7dcd4cf0f213e3f05e96c48f4e4cc7e1afb6e9b5e38a7c198acae"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::ppt::styletext::parse_pf_exception (cyclomatic 19): anydoc::formats::ppt::styletext::parse_pf_exception has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/ppt/styletext.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a506c73b8b0b6dbf14539206fe3314db6e2c52384fc73f0751ea5b3396eb63"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::xlsx::read_sheet (cyclomatic 19): anydoc::formats::sheet::xlsx::read_sheet has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsx.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff8d7978f4d20ededd27271c64ab10e1b162389813812524cf045be637977d6"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::doc::lists::parse_plf_lfo (cyclomatic 18): anydoc::formats::doc::lists::parse_plf_lfo has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/lists.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b235e3f84a4467a845373ffe74261b0a9a3232506d95aba8642616e2b04341f1"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::odf::table::duration_text (cyclomatic 18): anydoc::formats::odf::table::duration_text has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/table.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae8fe38d7016f64a0da7aebe25c1ed2656b3aeb7d7de9e28314e047231a2166"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::render::markdown::inline::delims_of (cyclomatic 18): anydoc::render::markdown::inline::delims_of has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"167c603144ec13d915863c356db472ff9a2c44baa7ce69dfc70b04e4e42fcd29"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::shared::grid::build_edge_table (cyclomatic 18): anydoc::shared::grid::build_edge_table has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/grid.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"563d9a320650d8ef69feb8dc8fe0c04f1148132ebe2d9333ffd8729153bc8839"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::shared::math::omml::run (cyclomatic 18): anydoc::shared::math::omml::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/math/omml.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a913f560b1bbc86733ed90425e4ee8223d93bdc9d68ecf4faf564d44e7e380cd"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::formats::sheet::xlsb::read_sheet (cyclomatic 17): anydoc::formats::sheet::xlsb::read_sheet has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsb.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b9e7fd1364daea01d89dc77dee553c2227fd213a2b3bf3d90b533290b4f05b"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::package::xml::parse_xml (cyclomatic 17): anydoc::package::xml::parse_xml has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: anydoc::package::xml::resolve_entity (cyclomatic 47) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/package/xml.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"215fa1caebd08eaa9e3b4665457551017d1cdbf87c0fadafba2fcbdafdf69a06"}},{"ruleId":"D1","level":"warning","message":{"text":"anydoc::render::markdown::inline::render_inlines_mode (cyclomatic 17): anydoc::render::markdown::inline::render_inlines_mode has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5cc2417c96d8376deedcd228fe3370b16db02b5c8b2e0e2edb5aa9182fc377"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xls::read_sheet (cognitive 123): anydoc::formats::sheet::xls::read_sheet has cognitive complexity 123 (threshold 15). Drivers by points: if/else 27 (85 pts), boolean chains 15, match/switch 4 (15 pts), loops 3 (8 pts) (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"88814854eff6c361a3a2adbfe5ea8a1098fc48afe48d98238405d9d08a29526c"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::resolve_number (cognitive 48): anydoc::formats::sheet::numfmt::resolve_number has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (29 pts), match/switch 3 (7 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c5e579fed7746e526f372c21e65d7c4a1f62d4a9850daedd5fdcef3da61828"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xlsx::build_table (cognitive 47): anydoc::formats::sheet::xlsx::build_table has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 9 (13 pts), match/switch 3 (8 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsx.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9be23737ea18e66a68a8903659fa2d46fa2f26419ae2ad87b5221002aa3b4da"}},{"ruleId":"D2","level":"warning","message":{"text":"Extractor::flush_shape (cognitive 46): Extractor::flush_shape has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (42 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/ppt/mod.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa7aabefdd4f58637308fe4ed100ca572dc7e25a4b598a731a580da3e86ef4e"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::odf::walk_shapes (cognitive 45): anydoc::formats::odf::walk_shapes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 4 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b7d2d61f6104fc2f3ec1d2e0b4b6cc31942754be7359b91bbb04fbd9b83720"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::doc::lists::parse_plf_lfo (cognitive 42): anydoc::formats::doc::lists::parse_plf_lfo has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 2 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/lists.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cab84c4bd5d619f9da6e141bb83e49567d4d9d7907c9867d8d2283ae1ac887"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::docx::content::parse_table (cognitive 42): anydoc::formats::docx::content::parse_table has cognitive complexity 42 (threshold 15). Drivers by points: loops 9 (24 pts), if/else 7 (14 pts), match/switch 1 (4 pts) (nesting depth added 25). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"96805641a178c03e28858c8a4a19b334ba77572a75ccb6414367a69cd02210a9"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::odf::text::walk_inlines (cognitive 41): anydoc::formats::odf::text::walk_inlines has cognitive complexity 41 (threshold 15). Drivers by points: match/switch 6 (26 pts), if/else 4 (14 pts), loops 1 (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/text.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d208aa7bd567ee16fa0b9611b0989d623b5220a46e097ef0a14b5c298beb0421"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::escape::escape_text (cognitive 40): anydoc::render::markdown::escape::escape_text has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 19, if/else 6 (14 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/escape.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a8b7b935997227eb476f0972d5a588f1cf898b68a02116792951462c9f3cff"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::rtf::tables::parse_stylesheet (cognitive 39): anydoc::formats::rtf::tables::parse_stylesheet has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 4 (6 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/tables.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b1939bfc83764e313cfc52093c7e9ecca40645dcf64fedb569028f54f1bfcd"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::grid::build_edge_table (cognitive 39): anydoc::shared::grid::build_edge_table has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 9 (18 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/grid.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"58580d969441a47b43fbc9fc147a083b8e4c10bb456265af1b62082113c41cb3"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::pptx::parse (cognitive 38): anydoc::formats::pptx::parse has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 3 (5 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6179b5fcbeba8ac0713cd659f22d6942e83536c43283d46ecd86adb5a7086a37"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::run (cognitive 37): Parser::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcfdfbf193ef0287caf0b78fecfce8405657b8ce015cbdd4664437d3e5a9f54"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::doc::parse_fkp_page (cognitive 36): anydoc::formats::doc::parse_fkp_page has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3870ebafe98f26c32ba57d955e256864470eb72dd66ab76a4fd9e971ba52de6b"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::rtf::tables::parse_listtable (cognitive 35): anydoc::formats::rtf::tables::parse_listtable has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (26 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/tables.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6950ef830df4be2889f32a1d38e09085d8de2e9d4848a8604f9fdb5decfe86c"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::rtf::tables::parse_overrides (cognitive 35): anydoc::formats::rtf::tables::parse_overrides has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 2 (5 pts), boolean chains 3, 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":"src/formats/rtf/tables.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a5b3392204de813a3339a12e5671c17bf41033806f5edaadd8f042d1c09594"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::math::mathml::walk_elem (cognitive 34): anydoc::shared::math::mathml::walk_elem has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/math/mathml.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5f45365de493ac5a9476a7a140573cdff28a6ad16ce4b6c33163402a3854a0"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineWalker::walk_run_content (cognitive 33): InlineWalker::walk_run_content has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d1567312d7d009172ec15b502a9b07c2410c513fab07b2b0bbf58d31b56df"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xlsx::read_sheet (cognitive 33): anydoc::formats::sheet::xlsx::read_sheet has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (7 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsx.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bd91fd7278eab83d278912bec6cbc9b547f9599af77b9d006943c3a90c3914"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::inline::normalize (cognitive 33): anydoc::render::markdown::inline::normalize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc741db3268be9f47d92c5be01cdb00c568b5f0bb3e1197fca2bc3574bba38c"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineWalker::walk (cognitive 32): InlineWalker::walk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a417b653cd70764e2c4e02ab55fbbccb80d4374b811dc50d6cf19ad395761a"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::odf::text::parse_list (cognitive 32): anydoc::formats::odf::text::parse_list has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/text.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3efb3af2b820b24e4205f980cbdc60393118dc43b6bc2650f1cd269c41d2e27"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::list::build_lists (cognitive 32): anydoc::shared::list::build_lists has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/list.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"94671c9893affd979a17af57670329d5f51018a45672979b6d89015b504b7635"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::doc::extract_text (cognitive 31): anydoc::formats::doc::extract_text has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/mod.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4bd7b760e82b65a6520359c5dc5f173eef0fe83e0b9249e1fe85b94984332a"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::header::resolve_header_rows (cognitive 31): anydoc::shared::header::resolve_header_rows has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 2, loops 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":"src/shared/header.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19fe8f74541b6e9b44db6b1477064e1d22fd2f86eab18b9b93b652def635b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xlsb::read_sheet (cognitive 30): anydoc::formats::sheet::xlsb::read_sheet has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsb.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29eac882b694aee29a28e2f470c806d4fc8df697248b3753023d73e04eb65d8"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::table::cell_block_text (cognitive 30): anydoc::render::markdown::table::cell_block_text has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (9 pts), match/switch 3 (7 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/table.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"63577f83dbca0e9889b33d435df6dc50396a42e332abf7d3db440ede89e2330a"}},{"ruleId":"D2","level":"warning","message":{"text":"OdfStyles::collect (cognitive 29): OdfStyles::collect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/styles.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47d054ea3064ab9a8237c3d66744c67ef0a72e5c573c5b5167d5eb588a35cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::parse_table (cognitive 29): Builder::parse_table has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (8 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d47fee67dbf747e658af3f9d100ede6ce5a3b9067d6db4e256a811878dfd6cc"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::render_block (cognitive 29): anydoc::render::markdown::render_block has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b90ebd7247e7f8ef95406f355171d4cc18cd4243e13b233d214e1a9104999a"}},{"ruleId":"D2","level":"warning","message":{"text":"Assembler::build_blocks (cognitive 28): Assembler::build_blocks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/mod.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"accf011ca009282047c72d5474782cea35ba6f4b98430532ea9a56e3c0bf12ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::walk_elem (cognitive 28): Builder::walk_elem has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"74518940d12ffbee67fe4f4743d409e62a39d1ec945d7e7c5676901013cd7ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::emit (cognitive 28): anydoc::formats::sheet::numfmt::emit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edcc561647cc7c9d477e65e9fed2d05463de0bb5bb43517cecc5cdd52a67368"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::fields::tokenize (cognitive 28): anydoc::shared::fields::tokenize has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (9 pts), loops 3 (7 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/fields.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7415f54a2bbdc05acaddd5d0fa4455e991430b187ad3e538b0ee3706fe98820"}},{"ruleId":"D2","level":"warning","message":{"text":"Stylesheet::add (cognitive 27): Stylesheet::add has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2897df792fc51ae5126573b0e78d7d452faa4d977439c115526c3f70e0262c"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::split_digits (cognitive 27): anydoc::formats::sheet::numfmt::split_digits has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8c11c5311ab514176c439872bab13cebebf9df76445561ab19c023301d2081"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::render_fraction (cognitive 27): anydoc::formats::sheet::numfmt::render_fraction has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/numfmt.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"772eefcee7282c08fb0ab9d431f55dc5fa4905cab3ba731f15d5bcbfa99d3736"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::numfmt::parse_section (cognitive 26): anydoc::formats::sheet::numfmt::parse_section has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (7 pts), match/switch 2 (4 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":"src/formats/sheet/numfmt.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab778f6bcefb6e0be89a994491640d5b705a7835beeafcd346a47717124551ce"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::docx::numbering::parse (cognitive 25): anydoc::formats::docx::numbering::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/numbering.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c44f030cd9d3c923a6c07bff1618b6f62744a7621332e9807115db397ea283"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::collect_note_refs (cognitive 25): anydoc::render::markdown::collect_note_refs has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (8 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 15). Of this number, 18 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"87466659a874397cef3e74ce8bcd02fbef2deee069bf920f84704242e1a36e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::parse_list (cognitive 24): Builder::parse_list has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac289eeef451136f4c031c631136d85c26ec4ecd29d85dd20ed9d04ae070726c"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xls::read_globals (cognitive 24): anydoc::formats::sheet::xls::read_globals has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c50e51d25def45904a7e2dff1052b485548742c8a2f7e576f8992eb653b52a9"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.parseArgs (cognitive 24): cli.parseArgs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/cli.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4a8c6718856f345cfcee763dce4df00797fc78373ef975cb4449aa6adfd067"}},{"ruleId":"D2","level":"warning","message":{"text":"InlineWalker::walk_drawing (cognitive 23): InlineWalker::walk_drawing has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"68917ef69607d2b94f03368046017015fd4bf702a4103df469e097e8e8a930e1"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::pptx::parse_para_inlines (cognitive 23): anydoc::formats::pptx::parse_para_inlines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf63520bee71026252cc244f1aba2d4f05c55d5d6db11ad495c0ff675621365d"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xls::last_shape (cognitive 23): anydoc::formats::sheet::xls::last_shape has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc114f687f4321955709fc028f7c66accdef2d35d858ddf1086d3159bba3a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::package::xml::parse_xml (cognitive 23): anydoc::package::xml::parse_xml has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/package/xml.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fda0e6ce2beacc12f9d242f9e87b239704d8ce947921bb1318fa9fda0e65181"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::control (cognitive 22): Lexer::control has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/lexer.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4410cd421958dff901ade1ef6b0867762d6729d50c5b45e1f574148be2ae074"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::ppt::locate_document (cognitive 22): anydoc::formats::ppt::locate_document has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/ppt/mod.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"864070002755a31d80971e78d5876b2dc341e990fe2b4822b4588d7b318713e6"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::fields::hyperlink_target (cognitive 22): anydoc::shared::fields::hyperlink_target has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (8 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/fields.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fcedf49f8778042872d6adb5a24e7194b17a4eeb76ffc8b00c654fe2c9db97"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::docx::content::emit_paragraph (cognitive 21): anydoc::formats::docx::content::emit_paragraph has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d981cf3eca9831ee46df533ba33a430f005004df7e4a7a8b2592cd22fe60b3a"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::doc::lists::parse_plf_lst (cognitive 20): anydoc::formats::doc::lists::parse_plf_lst has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/lists.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598c2c50046d5d890fac8757c6df2afbf2f3aaa9b86e249c3f2c8b3d7864253"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::odf::table::duration_text (cognitive 20): anydoc::formats::odf::table::duration_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 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":"src/formats/odf/table.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec597137a8e97da7611831fcb7ab7b568f5f27c4a2e3a040ae886d0f0feb0ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 20): main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), other 4, ternaries 2 (4 pts), error handling 2 (3 pts) (nesting depth added 4). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/cli.js"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdca18db7381d5a7f8945ffc5fe5c1c1d65248d29bf3c22ebe5bcff510c8e53"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::doc::sprm::apply_pap_sprms (cognitive 19): anydoc::formats::doc::sprm::apply_pap_sprms has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/sprm.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4472499a2bce32a00b66bcf786a49223a955c51592bff094a1e723c706d5e9f9"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::epub::chapter_stylesheet (cognitive 19): anydoc::formats::epub::chapter_stylesheet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/epub/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb885c106dee105f26133ea033070fbaf763da4988bfd39adb9ffdd4405bb0c"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::odf::text::parse_block_elem (cognitive 19): anydoc::formats::odf::text::parse_block_elem has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/text.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d72575551583d63b827b2e1df4c7243c64a34d50a92401973c4dc865dda2cc"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::ppt::collect_masters (cognitive 19): anydoc::formats::ppt::collect_masters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/ppt/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b1a94cee4519fe3db68e7cfb263950240f28c9af57758370f40dd357ac9b51"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::ppt::styletext::parse_pf_exception (cognitive 19): anydoc::formats::ppt::styletext::parse_pf_exception has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18 (19 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":"src/formats/ppt/styletext.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb22f1f70a42068edcb76a72d048e6c2ee51a12653b9001f054e207bbaa5a17"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xls::read_biff8_string (cognitive 19): anydoc::formats::sheet::xls::read_biff8_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a40e749dce375b3168b650f1f316d695b3da02f2eb6db15aa55c66d266c25a"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::inline::delims_of (cognitive 19): anydoc::render::markdown::inline::delims_of has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ae7b7df08046fd17ee8adab603fd6f7b11031af6d7fd79803bc3f362486b48"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::html::parse_declarations (cognitive 19): anydoc::shared::html::parse_declarations has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9caade331bf4b19ea37b0aa3cb457dbca3c29628f017ce94270afb478efb598"}},{"ruleId":"D2","level":"warning","message":{"text":"GridBuilder::finish (cognitive 18): GridBuilder::finish has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (11 pts), if/else 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1260ba82c9c61238d2221b70aa3ebae00b9181c82e3c25511411e91037b8937"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::epub::parse (cognitive 18): anydoc::formats::epub::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/epub/mod.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eea17dd4bae48594a4cddadd251a96ed6738aac50c2a5a28d6b02489ff17d19"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::pptx::parse_graphic_frame (cognitive 18): anydoc::formats::pptx::parse_graphic_frame has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5d5de021c14820515bddc93a694c2164e2e48cab633f204ce9151272a52dec"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xlsx::parse (cognitive 18): anydoc::formats::sheet::xlsx::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsx.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"58802ed459f0b1afa16c3f903f45e2e0c4747a41eb45f2c819ac2e9cdcc30ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::inline::render_inlines_mode (cognitive 18): anydoc::render::markdown::inline::render_inlines_mode has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23c639253a8d87db6a813130efa05c4975627e5c9c4b527bf41b2fcfd669ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::table_control (cognitive 17): Parser::table_control has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d62a2758b53a2f174522d30647e29a6d6bf47f15d330cb517ea982e681aa3e3"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::doc::parse (cognitive 17): anydoc::formats::doc::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/mod.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4c82bff9687fe882ba0df1e7708228a289e3b55a5417b3b19c60301828e114"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::odf::table::emit_parsed_cells (cognitive 17): anydoc::formats::odf::table::emit_parsed_cells has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/table.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e872d3957b75bd0efc16c6479848b681130f975c74c4ea2d46c357a51838ae57"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::pptx::parse_shapes (cognitive 17): anydoc::formats::pptx::parse_shapes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd921bf06cfc85ec49a96e2245a2bf557e06fd8323476732c6119fb14643e28"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::pptx::parse_text_body (cognitive 17): anydoc::formats::pptx::parse_text_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a3262a7afe3b355c4f5e79ef61d0a7497982af64818ce98994e501333e05a1"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::render::markdown::inline::push_math_span (cognitive 17): anydoc::render::markdown::inline::push_math_span has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d51b65b25ef9c0cb4f4ea5fff620090515b392520a2724109f9554f9fedc78"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::officeart::first_blip (cognitive 17): anydoc::shared::officeart::first_blip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/officeart.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"27160147672cac61a43a3e4114df6b50ca0572cf5506316f920e2ad4c6bd7866"}},{"ruleId":"D2","level":"warning","message":{"text":"GridBuilder::place (cognitive 16): GridBuilder::place has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (7 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2429b370cae675600d42dac7689b47ad86b3e6bbf701ce90ae945ac14fb0466"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::docx::content::collect_blocks (cognitive 16): anydoc::formats::docx::content::collect_blocks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc80b039c03ef28f1bccb7ce8a0c0e67fa8c12b0f9bd9f5380528228615b224"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::ppt::styletext::parse_style_text (cognitive 16): anydoc::formats::ppt::styletext::parse_style_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/ppt/styletext.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c75d21e12815e41d6a76f60571ac075152b1b9c9f272c6586e9ce5bfc30888"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::formats::sheet::xlsx::render_serial (cognitive 16): anydoc::formats::sheet::xlsx::render_serial has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsx.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f44de907efb607384e729d05627e7354f1b1907d7cb9b576e1cdf96f91db596"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::package::path::resolve (cognitive 16): anydoc::package::path::resolve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/package/path.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e576f148bebda6fa1007f3ce8da3bcbb9a12a8655934d87c4e24c33983dff8"}},{"ruleId":"D2","level":"warning","message":{"text":"anydoc::shared::math::tex::fold_alnum (cognitive 16): anydoc::shared::math::tex::fold_alnum has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/math/tex.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fed4f8daeea03159f8768bc16cdfa335e36c70938935b314d280fdbae67c06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: anydoc::formats::sheet::xls::read_sheet: FunctionTooLong \u2014 anydoc::formats::sheet::xls::read_sheet runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64f90fe25c2ed05b576db82349ec841926d19a3ccdf80ef152413b69242c6aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: anydoc::shared::math::tex::symbol: FunctionTooLong \u2014 anydoc::shared::math::tex::symbol 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":"src/shared/math/tex.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"67524aa405ef6f51ff91f75a50e6b9d59cf56e151c1928ee59754b42f49a8db6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rtf/mod.rs: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: Parser (2 blocks, 608-1326). The bar is 500 significant lines; this is 233 over it, 1.47\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e713c6592bc71b13f82a8cd432bbd1b6e0f740b13d109195a21ed60ba8141c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doc/mod.rs: FileTooLong \u2014 728 significant 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 228 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bacff04baa60f9e30f46e4ae28ba5ccfe7055280269bf9658d8521365f7880"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 478 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 608-1326. The bar is 400 significant lines; this is 78 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac47e9028c5e9ed63101dddc16ed97843982fc3a3749b4b443a743aff0f5d038"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: anydoc::formats::pptx::parse: FunctionTooLong \u2014 anydoc::formats::pptx::parse runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b9edb79a7a3a1ca1d1bfe11c9f8076c4be0b23baca0999fdcd4b03f7a50654"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: docx/content.rs: FileTooLong \u2014 565 significant 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 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef0c19071005f5bd0fc051b3319f8b9f59c6ffe84797e06341d4329c2bdf7c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sheet/xls.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6485648d042cf03cc1fb15af59e3011bbd62c0f6daae570a8ff0308ad2611"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: anydoc::shared::math::mathml::walk_elem: FunctionTooLong \u2014 anydoc::shared::math::mathml::walk_elem runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/math/mathml.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"33193552634c552ac6f7562d16ca7637bf2da17b67024a5af8d9a6790490cb61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shared/html.rs: FileTooLong \u2014 516 significant 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 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shared/html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad16219e7ffdd4b18950a88ccfc181bc85260b8e1e5f280252af3c36faa64ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): node/src/document.rs:152-181 | python/src/document.rs:131-156 | wasm/src/document.rs:170-199 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"81018f071dad9354cc5028dbb667b81c9bd9675d31a117d4a69a71bee1c89a37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): node/src/document.rs:66-92 | python/src/document.rs:61-87 | wasm/src/document.rs:74-100 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a91064a2ce48af9e076641d4724c072fe8ca7f4ac63bc4729d2498754ba371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/formats/epub/mod.rs:180-198 | src/formats/odf/text.rs:482-507 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/epub/mod.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b7be22b1e4b894f6f8a8b5d32d5c1856ce74ccf8c9836fa71879d187d4293f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): node/src/document.rs:250-262 | python/src/document.rs:208-220 | wasm/src/document.rs:271-283 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cb0e63b529b4dd42dd693398bc8cf31f42a32b6b2598dcef7752c6a7943473"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): node/src/document.rs:344-357 | wasm/src/document.rs:368-381 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8c471e83d642aeffa97b24875e559844f25df25b1ed4c331a2e7356d9a8dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): node/src/document.rs:379-394 | python/src/document.rs:302-317 | wasm/src/document.rs:407-422 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dec37e0284e0865da064606895f813fbee5ed169dcdc10d221884e11426b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): src/formats/docx/content.rs:646-658 | src/formats/docx/content.rs:661-673 | src/formats/sheet/xlsb.rs:119-131 | src/package/archive.rs:119-131 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/content.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb347a5c774cbb2f3aa124659b61e7ec357b7ca2ef91633c87e89980d599aec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/formats/rtf/mod.rs:124-134 | src/formats/rtf/mod.rs:164-172 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/rtf/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90d271d56b4a6266c491d223d6749a4677aa9663be7f97dd46b4e796876ca90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): node/src/document.rs:218-225 | python/src/document.rs:184-191 | wasm/src/document.rs:236-243 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96efa77dc91d6544cf0f6fad6efbcd910abd9a868e95239ba3f1288cb32767c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/formats/docx/styles.rs:134-144 | src/formats/docx/styles.rs:162-171 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/docx/styles.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb30f56b7505a969869bbbc3a6271eb5d2d3223d341f135adecc731a4a626abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/render/markdown/escape.rs:293-300 | src/render/markdown/mod.rs:20-29 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/escape.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"86787f2c2da1a147e9c23a8c18a5bd0f6b0685843b8bed511b7f8e6df5b95bac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): node/src/document.rs:425-434 | wasm/src/document.rs:454-463 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d20d41a1c25432869933bc51bfdf4accbeecddfd2d1c73d7e5485ee587c520"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/package/xml.rs:168-176 | src/shared/math/omml.rs:145-153 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/package/xml.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"532c9fea4ce76dbf50137c131e564f86c5104824f2b27b30669e56c809280cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): node/src/document.rs:451-458 | wasm/src/document.rs:482-489 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"095662c4f12ac56d3d869bdf0016ec43b56472a389afc19dea59436c3991b2ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/formats/ppt/styletext.rs:95-114 | src/formats/ppt/styletext.rs:174-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/formats/ppt/styletext.rs:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/formats/ppt/styletext.rs:172\u0060 calls \u0060Some\u0060 and \u0060src/formats/ppt/styletext.rs:94\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/ppt/styletext.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd12b16c32c3d989c759db0b3cb6367b64077bef29e8b30ae0fcbd1fc6d2fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/formats/sheet/xlsb.rs:66-81 | src/formats/sheet/xlsx.rs:63-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/formats/sheet/xlsb.rs:66\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsb.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a187de22fc76f1fe4fb23ae95c91a8d266a1765fed20c5ada9d3fba33a5bd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/formats/sheet/xlsb.rs:97-110 | src/formats/sheet/xlsx.rs:86-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/formats/sheet/xlsb.rs:97\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsb.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a18745ec1730201ee86c826700fab27dfa28cb0e8bc49dce2e8dcf2fe98652c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/formats/sheet/xls.rs:574-585 | src/formats/sheet/xls.rs:702-712 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/formats/sheet/xls.rs:574\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"c363f6493101053672d971fb5870a6d7ea9f18958f733c3b741ac93877dd7bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/formats/doc/lists.rs:261-271 | src/formats/rtf/tables.rs:440-450 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060nfc\u0060 to \u0060u8\u0060 in one and \u0060i32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/lists.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"610663b2ded1d7698aa7f53fd9ec64943f78347697bda0a264ab27708dcc0a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/formats/sheet/xls.rs:373-383 | src/formats/sheet/xls.rs:510-520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/formats/sheet/xls.rs:373\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xls.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"833a6c4a28e76d9b43a3906c650bba2a5a05052f7dc13141675f44e864dc2c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/formats/odf/mod.rs:166-174 | src/formats/pptx/mod.rs:432-440 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/formats/odf/mod.rs:166\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/formats/pptx/mod.rs:431\u0060 calls \u0060rebase_emphasis\u0060 and \u0060src/formats/odf/mod.rs:165\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/odf/mod.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a9ebd880986392b929339263ca611a5237115aa63a74adf816736e1ffb5e58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/render/markdown/inline.rs:382-390 | src/render/markdown/mod.rs:209-217 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/inline.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb48bfe8dc9a95512bb9cabff12286ba40d1970fd4849e614d1eba8e91f5b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): node/src/document.rs:345-352 | wasm/src/document.rs:369-376 \u2014 before extracting anything, compare \u0060node/src/document.rs\u0060 and \u0060wasm/src/document.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060node/src/document.rs:345\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f96b3eee8add9224259b6570f9732544729f446eeb02862f9f27c7a683db2a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/formats/pptx/mod.rs:418-426 | src/formats/pptx/mod.rs:460-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/formats/pptx/mod.rs:418\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/pptx/mod.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4a699b4bd9e779fff7eed613a63f5adef4b5a76bc66d067d424c1a719edebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): node/src/document.rs:50-62 | python/src/document.rs:46-58 | wasm/src/document.rs:58-70 \u2014 before extracting anything, compare \u0060node/src/document.rs\u0060 and \u0060wasm/src/document.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060kind\u0060 to \u0060BlockKind\u0060 in one and \u0060\u0026\u0027static str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51bbf2f2b82c7c0e0d54d88a599ff8e7cf9b50477885986d2ff81b59905109b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): node/src/document.rs:135-148 | python/src/document.rs:115-128 | wasm/src/document.rs:153-166 \u2014 before extracting anything, compare \u0060node/src/document.rs\u0060 and \u0060wasm/src/document.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060kind\u0060 to \u0060InlineKind\u0060 in one and \u0060\u0026\u0027static str\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/src/document.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"77106576819f5becaa4cf405714f477ac54cbab29d953708e9c964077421377f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): node/src/document.rs:299-305 | wasm/src/document.rs:320-326 \u2014 before extracting anything, compare \u0060node/src/document.rs\u0060 and \u0060wasm/src/document.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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":"node/src/document.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f7de4a672c896a4968cd7d12920444b5aa4f66b99388bb86ae69f530ead296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): node/src/document.rs:462-468 | wasm/src/document.rs:493-499 \u2014 before extracting anything, compare \u0060node/src/document.rs\u0060 and \u0060wasm/src/document.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 49 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":"node/src/document.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d786de3c1481d0ada69c9f913c815645a6871246d126a4904d5d999eecfe9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/formats/doc/lists.rs:31-38 | src/formats/docx/numbering.rs:27-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/doc/lists.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"585cee315fdb37bf7f7a2349d73f4dfd2934f9144f3203d82645623a8e74627d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/formats/sheet/xlsb.rs:374-379 | src/formats/sheet/xlsb.rs:407-412 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsb.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cc0f00b95cfb3497dc54d95d50e1ae0dec9527fd2a6a50683d3cc4781ec3e1"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: anydoc: anydoc: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4b10b2c80453b6a1de78fd20a4caee52e905029849e0e107a19720bc096226b4"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the node:test suite in node/ ran and not one test passed (const error = new Error(), so the coverage report describes the failed run, not the code. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/render/markdown/escape.rs: src/render/markdown/escape.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in anydoc::render::markdown::escape::escape_text at line 141. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:27:31 \u002B01:00\u0027 --until=\u00272026-11-13 20:27:31 \u002B01:00\u0027 --full-history --no-merges -- src/render/markdown/escape.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/escape.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd0b17db5c57a0683986bdd465ed47d457e436bea1dba6d00e7051f19fd5e33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/render/markdown/inline.rs: src/render/markdown/inline.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in anydoc::render::markdown::inline::normalize at line 29. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:27:31 \u002B01:00\u0027 --until=\u00272026-11-13 20:27:31 \u002B01:00\u0027 --full-history --no-merges -- src/render/markdown/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":"src/render/markdown/inline.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"80349971700e67b389be34a877d316e2e7b3d652205255a98376a5a434bf7604"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: node/cli.js: node/cli.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in cli.parseArgs at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:27:31 \u002B01:00\u0027 --until=\u00272026-11-13 20:27:31 \u002B01:00\u0027 --full-history --no-merges -- node/cli.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/cli.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0e9c2707040ad9f079ad86a3fea93a826ebb314404d4dad4f8e3ae6d2b21ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/render/markdown/table.rs: src/render/markdown/table.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in anydoc::render::markdown::table::cell_block_text at line 103. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 20:27:31 \u002B01:00\u0027 --until=\u00272026-11-13 20:27:31 \u002B01:00\u0027 --full-history --no-merges -- src/render/markdown/table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/render/markdown/table.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1a2fb0dcdb381a919e298d8838617fac601eff7fcbb2a0a046eabc22198524"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 5.0/10. The most over is \u0060(repository root)\u0060 (22687 LoC, 141 module-visible types across 16 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"866f5db9e17cba13054be81498300d5689d6380b38ab693dd948f99e20adbff5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"05dd1cc6a6536213feac72458953b3ecc92da85b7219289a9d2c68054660f8e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1873f73df2980e05749fb989e4983bd7e44b6790994284629fa7f4a2ef29ad4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99c8716916ca0dd9ddee8302208a5745bab6513f34ca12c2672d93f07c07be5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"45e43b2cf0f13df69fd5c5d1f3263d8d91ae8a1d217ff414c529a77aebd1ca8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b81debfdf26ad72c8d0b6ae327091ed6b094389fdb86a94cad6363ea8f38e48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"594ba20856faebb900e8f635978e37e019356a968254d953432a089b831a6265"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"43a68f0ba9508bd4cbd3ca1ad2ff861f791043cb607403f421e16c92d1b3fe0e"},"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":"7e97d37fb2fcd0dc69faf13dca8c4ea759524c4daf9509ebb89d5c7d7970aa23"},"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":"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":"c457cb1ea06eecc02c9bf7ee5d3b205627e26bf4a9b3c1839c7c0bab77b6557f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfe95ae3f939ff67a3a3133340ecb572cf35ee3a58ce93efd9b0fb3fd2ee3434"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security 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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f51d598102786d6fe7ccdb4c5ce07901ce46b3341024418f2338de4b1f69943"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c72f8dd0a4660c0410011ad22b062a88bfb12e99dfa88785bd553544f3303bc1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3526ae158dac3f4206fcf9b7a1edf762bedebdc242d662fb1b513f3a6d60d2f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d29b94038490c84613e9786e27a95b1e6778b882160e1bb8b3d7dcc9422beff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f4b234569d9def00d491e2620fc51069056222000fc1f164e722fbe0a7130d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89b87923e8b3b94cd10b7c2ea01d110d15095a171a1ca87e8afce7be4cf7ee07"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63c4a093cd4d8270d8663d7b47af1062c73ee032c2d6873d217251d788ab2402"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc817651145b3746bc99495e7fbc5498d41cc1b481fe483113715158512ae9c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d46bdcf42c1c606bdd786623bb0af01ceec881af0d3bbc48f063beab9197add"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3952b5018533b78fae2659c2a1971db7d3fc9c1ad3bd2a694c50e31033553841"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9317c6bff8cff2e4a88424157c1618dbad988ca014793c84ac07ed03b4dc6dca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d541a0eb3b2dbe5998fdd42a98fc8d42f993bd63318277a56aeb54e15c268e50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f942f498d240b67fee82289eb3ff4f9679a803d0e57a79d106f90c084ee30aec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0710b0f999fee14bd2a7416f6ae96889b6d6c48b026e94a96420e87ec1eb8ee4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6a96db9dd1924a51b4fd0ac7fe803f99efa54351b95804a046ace60c0ea66334"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f82a94b547e583107475ce443fc06e8d421287b4914413339b69fa88eebfa9dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5af221a0a713df6aa43875e37653ab43744fc29dba3d5ea44eaf351c954cd1d8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e92484af1fef3b4dcb7c78ad7c99b2e3ef9afcbadf8a52158104508ba920832"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53e7fcd6f6c53f5e65dfc63d65e3f84b82e83b68274f0e7f997ecdd268788fd3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f96de53a9c41aa9762bf4bb7d8c6ceb5328ca215e45d4016e18c2ff1458e371c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d7d90df32a41d0b22764ca9e9e277f2d3d8367397fe4cefab8be788bc8b8cbf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8f51d4d8680a1b6ded6d1277fb40e58e067409c8e24cc273cacc0f72c3aa654"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e268b63fdbc846cb5faac95d85525ba4ac44611c8dce00dd2f462869cac633a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"855451eb322b80e9c22309f05343d55d411160048b3059476c34034cdd161958"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0687424160123dc6400dcd7c951218a45f955a8035963ae0ac9fa855234869ec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c345193eb5906333a686cc268ee1517ae41d2d38dc0eb623995a922e52e5337"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d72b1d79f31eaa1e490943e6a57837b0febecfe9d326175a5e3b831906ec9d2e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f22165c356ed8e3bfcae3425af927f3218f1c0228f00f630d7ac04c098922926"},"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":"3026c112dd3ac8a773ef27f9ff3c6a0db3165f259ba40b7d56c2763c0dc3e74d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6b70eb262bc47058d76fa85193c87398fcd6a8d5079c1146a947ba956b57cb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e5efa806b8e458bd7c2c167629bc2cec7133021eecdd38b6a5d56986f370afb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d014bd016d7397fdc68c18d908d9e885a0392f6564c268034af4f3eb789faf0"},"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":"c5d8a56b8d1ed3c94f6a1089b91c17fea9d362e6b2b0b35ffeeeac8f84ea5eb4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4953c563c8ff22edf84bef39c28b19b85651ec6dceddf7dfa3c21d45fd63abca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"62d84dd7aa378befee874a011faa7448e3f05aed9570b1026b8525275046b517"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"10154cfb8f8a4dae53159712215af299d5cd024640747e1ddce605ed5f597157"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e217d734e74f8e21620e0eb55ff914a56b917e5a601af40b6be8f55ed5983d8"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"32269c32ef807bbc8c3bfd76ba64e52c463c4c87791be1330ccc18a5d014c461"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d51ae542666a2161d9ff1a1e16192158407fe61ad2488f2e2def24ee65ee0520"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","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":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","reachability":{"kind":"unknown"}}}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"61d9c64c1de88e7edb9c757178d6ec3103868cef4ae7e825aeeac5d15e61fb7d"}},{"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":"D44","level":"warning","message":{"text":"End-of-life runtime: Node.js 20: node/package.json declares Node.js 20 as this project\u0027s engines.node, and Node.js 20, support ended 2026-04-30. An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-04-30 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"node/package.json"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2fac88ecce9222fb97ec1899fb451aa389ee46ee33b9240eab4a62105362ec"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060node\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060bench/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bench/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8942ca94bb1a8764628924e8d138d6150453f9dfe63b58f00c73722757de2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060heading.level \u003E= 1 \u0026\u0026 heading.level \u003C= 6\u0060 appears character-identically in 2 files \u2014 node/test.mjs, wasm/test.mjs. 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":"node/test.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8956ecb6d0f0904ce87222ff6a59791ea7fbb86a72260fc98e12011cf0aba431"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!sheets.is_empty() \u0026\u0026 failed == sheets.len()\u0060 appears character-identically in 2 files \u2014 src/formats/sheet/xlsb.rs, src/formats/sheet/xlsx.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/formats/sheet/xlsb.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3fd2c64ae645f6f3aeef379ef8709e963af77a0c2668430fc1d7e6e3344ac5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_json\u0060 returns \u0060{}\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"python/anydoc/__init__.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8657dc8dbfc03f924161fbe6cc680e75776e21ec10a142c32d77a2b3516a244"}}],"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-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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-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":74,"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."]}]}