{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"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":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"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":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"Reader::prefs (cyclomatic 233): Reader::prefs has cyclomatic complexity 233 (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/model/prefs.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"90593d0858865cf2e132e3792d16f32a60563996efdcba75a6d2c31116475053"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::page_item (cyclomatic 89): Writer::page_item has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/idml/spread.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f340ec39be1398fad5c9fdd5bc6fd466735e7f72740367d91059dd4b6289604"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::value (cyclomatic 77): Writer::value has cyclomatic complexity 77 (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/idml/kind.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f58c34adec480985c617fef5e2a779d3005b789646d0945478bd4b92ca390b"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::story (cyclomatic 76): Reader::story has cyclomatic complexity 76 (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/model/story.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd30958d98462bac10037ef8c4959e1e00519d51dca56c6eb4fac0d4b731328f"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::object_style_node (cyclomatic 72): Writer::object_style_node has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/idml/styles.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e369020d561601086243002bb384933d1f3ac20748d32e595ec88f1e60e518"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::run_content (cyclomatic 71): Writer::run_content has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/idml/story.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbcf0a6a2bfe4d9c22b3bf4065a64d8b4144b38f501e2ac8b3016282590e893"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::preferences (cyclomatic 69): Writer::preferences has cyclomatic complexity 69 (threshold 15). Of this number, 68 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a88b61658ade47e3743e5ff7dd382889c52077ba2fb390446a63fcb08e9acd2"}},{"ruleId":"D1","level":"warning","message":{"text":"indd::model::prefs::print_prefs (cyclomatic 69): indd::model::prefs::print_prefs has cyclomatic complexity 69 (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/model/prefs.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"829244ccee049ab930192bb080bf4f75a049fd531621576aa0dcf31cf5a68375"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.main (cyclomatic 63): compare.main has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6172f46e1dbf23d8f4d49b5f3918b63ee9b39cea9dfc9ef96a15e1f3371892"}},{"ruleId":"D1","level":"warning","message":{"text":"render_compare.report (cyclomatic 58): render_compare.report has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f65e8eb734be1efa57a65eea45a04c3ed7f89980d13d0dbcc5a1300cc7266a"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::ranges (cyclomatic 57): Writer::ranges has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/story.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97d6d8e75592a0af73a19c8245e1dbaeae5123ef138b1dcc981623be317a80f"}},{"ruleId":"D1","level":"warning","message":{"text":"render_compare.measure (cyclomatic 57): render_compare.measure has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e5d465c08e48b11f4872a2de83173d4b938e554a0c8b12250d66c2cbcad91d"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::designmap (cyclomatic 54): Writer::designmap has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cc2050732af50f743732ea3efbed589adb487bba6028c40974880a2d6d53b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::placed_graphic (cyclomatic 47): Writer::placed_graphic has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/graphic.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c7ef1ef037ea9153cbbd924fe8d1fc3d273bfeddd221f5a03d8549c1967f04"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::class_object (cyclomatic 46): Reader::class_object has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0196c45bb28a9940bcd88572968618c288a3712763b82c29cfdf188e79dc3fe"}},{"ruleId":"D1","level":"warning","message":{"text":"check.main (cyclomatic 44): check.main has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/check.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"494a170471317624f2ebe3c650c0c8fe3e0a615a5ec9f1d69dd1098f0c29d7e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::graphic (cyclomatic 42): Writer::graphic has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"211a83c8e8aeb9104d5dd0dc6f216837eab951a2bdd1c79a4bf5513e3ce47f61"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::spread (cyclomatic 36): Writer::spread has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb289bdd0fadf9f892e394c1e7ef06c185a793fc404b980ba90d821af3b650c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::footnote_option (cyclomatic 35): Writer::footnote_option has cyclomatic complexity 35 (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/idml/resources.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb119b373692fe7dfe53cff3ebbdaf0157be4564e341627004ff4fcb12f00517"}},{"ruleId":"D1","level":"warning","message":{"text":"element_values.analyse (cyclomatic 35): element_values.analyse has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/element_values.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc0dcf1b08555ad5b52bb7dd9bec96d735deb1c2b6830c8bfb8e6f054804c48"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::graphic (cyclomatic 33): Reader::graphic has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"547fcdcfef9d4ef52457fe7fd26fd46599cc1d038193ce8e8f4fe707c5e00282"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::hyperlinks (cyclomatic 31): Writer::hyperlinks has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a76a594a076d69059e63c8825bee61b7acbbf50e7cb249e7bf7415b1a01779"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::style_element (cyclomatic 31): Writer::style_element has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/styles.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24e5e2f9b0d1ea95ff8d6f5d4934abbf56e3b190e320115cec59428694e10e9"}},{"ruleId":"D1","level":"warning","message":{"text":"audit_corpus.main (cyclomatic 31): audit_corpus.main has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/audit_corpus.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1befd93f137d5741170d753f369afe27b4d481e26d8c0d80ab19ccc77288b8d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::styles (cyclomatic 30): Writer::styles 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/idml/styles.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ff4230594259a62ef5a1e20779e109480c996ba50dee4cc1eedf338fb0a7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::text_frame_preference (cyclomatic 27): Writer::text_frame_preference has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba98610f32b78cd6ab780f83dc2c97695fe5acfbdcf8a2e22c966bd1a121553e"}},{"ruleId":"D1","level":"warning","message":{"text":"indd::idml::transparency::settings (cyclomatic 26): indd::idml::transparency::settings has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/transparency.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a6a60921caae4ece0b15faf4155203b1cd733c727329d21c06e8301434e9d0"}},{"ruleId":"D1","level":"warning","message":{"text":"inventory.main (cyclomatic 26): inventory.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/inventory.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae88a1c9ddda6345ea8e598b0a306971ae9ce3d914f1406898a03eb31a91b30"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::table (cyclomatic 24): Writer::table has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/story.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e636bff5d4520c6e77cb05f049b5d0f126f043ff7fab6ce4170f5582e493f10"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::page_item_contents (cyclomatic 24): Reader::page_item_contents 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/model/item.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a250adbb35250efbb0b43b05f3195ee5bf99ed1af3551f4a96a6ddd1b80f04a"}},{"ruleId":"D1","level":"warning","message":{"text":"indd::idml::export::object_export_option (cyclomatic 24): indd::idml::export::object_export_option has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/export.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3548f29bbe5d6357d68dbe512164bae03cc01e35ff21921dd80808c83cbd9ebf"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::text_attrs_of (cyclomatic 23): Writer::text_attrs_of 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/idml/attrs.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a8a2b43a33b0511c7056b6047481d7d3fb97a6560edb1490fb61d47bd32747"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.value_coverage (cyclomatic 23): compare.value_coverage 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":"tools/compare.py"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a0363a432cdf5ba36ac7f563b5ea5ed7cbdcc09a5ade45753b15d7c14a2733"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::variable_preference (cyclomatic 22): Writer::variable_preference has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ce0883be0a5441313cad8a21b321bba271008c0bddb222c72e42e01911a942"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::behavior (cyclomatic 22): Writer::behavior has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d180bb1353d3af91c25d36b946c450dbdb919d90685eae4a4a7b3a9d43a9e83"}},{"ruleId":"D1","level":"warning","message":{"text":"indd::model::behavior::parse_data (cyclomatic 22): indd::model::behavior::parse_data has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/behavior.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05748fbf420e342ca6696856381f41498707faaceb33a706875e75394238807"}},{"ruleId":"D1","level":"warning","message":{"text":"render_compare.judge (cyclomatic 22): render_compare.judge has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d697d8998413658d7b4614d13e09e47400cfefab7be7fe662c4c69ea77535e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"render_compare.main (cyclomatic 22): render_compare.main has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96503ed3c3ee2a5a4191a70fb884916145bcfcccdafef7eb3f2d16936bf08e5"}},{"ruleId":"D1","level":"warning","message":{"text":"root_values.analyse_object_styles (cyclomatic 21): root_values.analyse_object_styles 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":"tools/root_values.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e16d461a1ea8d51414801e9dd69e12a5081f1535a5bcb220f18773dc0a2a72"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::endnote_option (cyclomatic 20): Writer::endnote_option 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/idml/designmap.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee8636923a86d12d908c3d1b985f1f5cb444f5a7bf273af290f71f674e65a92"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::fonts (cyclomatic 20): Writer::fonts 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/idml/resources.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd2caea3c64ddcd47b96bb97123eb506c3145ebc5df96643123d22b4b290fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"indd::audit (cyclomatic 20): indd::audit has cyclomatic complexity 20 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2125fe2660d8624b88bede8e3e6db3ec5bbf82cb342dd64ab8036618126ef5c"}},{"ruleId":"D1","level":"warning","message":{"text":"check.diff (cyclomatic 20): check.diff 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":"tools/check.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a2ffee0fc64ca010cc2b3d5f10a5c52265735d222fd0ff4d18fd711cac63b"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.compare_pair (cyclomatic 20): compare.compare_pair 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":"tools/compare.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c18cec40033d1239669dda14a1b79ede7c2a293d8237d15e7b9c04351a58430"}},{"ruleId":"D1","level":"warning","message":{"text":"element_values.blocks_xml (cyclomatic 20): element_values.blocks_xml 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":"tools/element_values.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dd049cb85baee60aa198e073e9010de0314aa89f4385bd726d910f4665c69c"}},{"ruleId":"D1","level":"warning","message":{"text":"element_values.main (cyclomatic 20): element_values.main 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":"tools/element_values.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb4bd27f3721038717bed0df31f0a49f6e17a5be9bb099db8cb84cee8dad8df"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch_corpus.main (cyclomatic 20): fetch_corpus.main has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fetch_corpus.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"35081760bae37b57d1d73bfd3e0d0b9ef182215520233018e8f3c68bd7e8ddee"}},{"ruleId":"D1","level":"warning","message":{"text":"render_compare.line_checks (cyclomatic 20): render_compare.line_checks 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":"tools/render_compare.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"87131aa13ac166d3139c0a76b0bc52f46f25001d5c6ede7ff321a7153c9cefaf"}},{"ruleId":"D1","level":"warning","message":{"text":"render_compare.dropped_text (cyclomatic 20): render_compare.dropped_text 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":"tools/render_compare.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ced0e56751b38bfc78500e1cc475a78de151d01074e5cd47b6cb3b3142d61f"}},{"ruleId":"D1","level":"warning","message":{"text":"render_compare.images (cyclomatic 19): render_compare.images has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"adedcc362f5df6c3ee35a2fa00a1251e030afaeeab81bad1557eac395c592aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::style_values (cyclomatic 18): Writer::style_values 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/idml/applied.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"711737081968882a7be3b25d09308ae6e44d0585b02df00df1f9fb702d899498"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::story (cyclomatic 18): Writer::story 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/idml/story.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"04040dba6609a41ada0decd531ce645fab86ddcc5085955798a5d69f90686c40"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.load (cyclomatic 18): compare.load 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":"tools/compare.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbdee3295c70c1a8c9c34f76dd8b641b752cad7957c56875dfcbbe6136acd8e"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.validate_cached (cyclomatic 18): compare.validate_cached 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":"tools/compare.py"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde7db41910570f3e8722f32af6d9579cb9ac1c9071409fdc5926e332dad3b96"}},{"ruleId":"D1","level":"warning","message":{"text":"element_values.scan (cyclomatic 18): element_values.scan 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":"tools/element_values.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7aeafdfd229cc935de7887c7998998c61c1b56cdb8c5e67266559dde337451"}},{"ruleId":"D1","level":"warning","message":{"text":"root_values.analyse (cyclomatic 17): root_values.analyse 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":"tools/root_values.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63bd18f0c74bbcd5a7ce9f814fa58453565814e5f300f36853a3c3d6593803a"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::languages (cyclomatic 16): Writer::languages has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3dad144b35e3976033682cd8f6c5b61b0aeb3f84bb6a547898c19ead15a7e7"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::values_in_effect (cyclomatic 16): Writer::values_in_effect has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2f1b12c03fd7dcb854080493c3c4dcc2d6bda0c231e12d180532cbee10827"}},{"ruleId":"D1","level":"warning","message":{"text":"Destination::read (cyclomatic 16): Destination::read has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/hyperlink.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff3a6f3a67b4080d011206f491c4a08aa4550f1255bcefe117fb57a22200c76"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::link (cyclomatic 16): Reader::link has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19de2fc5a25568c1fc0b10e82ab895bdf4992a279ee8cabbb24fbcf65cc0153"}},{"ruleId":"D1","level":"warning","message":{"text":"indd::model::item::classify (cyclomatic 16): indd::model::item::classify has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"51668294ccab0cc5cbe4305773fbab2c582298ae0bc90361a8ce3d2f97c407b7"}},{"ruleId":"D1","level":"warning","message":{"text":"indd::model::prefs::epub_export (cyclomatic 16): indd::model::prefs::epub_export has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/prefs.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55f7eab765bdd64b05ae54dfe4841391e70e96007af8c2ad3227c9e2aa02b18"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::prefs (cognitive 376): Reader::prefs has cognitive complexity 376 (threshold 15). Drivers by points: if/else 97 (178 pts), match/switch 62 (104 pts), loops 34 (83 pts), boolean chains 11 (nesting depth added 172). To reduce it, split the body into named stages: move each independent step or branch into 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/prefs.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"53408eb221fd66106a88a6abae9a91b63cdd735becc68d757c7d13b9d768e807"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::run_content (cognitive 128): Writer::run_content has cognitive complexity 128 (threshold 15). Drivers by points: if/else 39 (92 pts), boolean chains 16, match/switch 4 (13 pts), loops 3 (7 pts) (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/story.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"3441a66dca2caa8f4321396088f4d2269c09e32551b091a25e8285252799d800"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.main (cognitive 125): compare.main has cognitive complexity 125 (threshold 15). Drivers by points: if/else 31 (68 pts), loops 17 (30 pts), ternaries 11 (22 pts), boolean chains 5 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae0fffd53d25b173667914635c08e99ad86f1ba88449e959a0d5af0cce2274f"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::story (cognitive 118): Reader::story has cognitive complexity 118 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 11 (25 pts), match/switch 13 (25 pts), boolean chains 13 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/story.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c09e7008ccbe04e0101c3e2823cfa964d2162285d3eb09b95f01ef396dfe0a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::page_item (cognitive 111): Writer::page_item has cognitive complexity 111 (threshold 15). Drivers by points: if/else 49 (71 pts), boolean chains 21, loops 9 (12 pts), match/switch 5 (7 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07c7177207971be9939ce2db76411839ed525f81252e1813c591622b9f73c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::object_style_node (cognitive 102): Writer::object_style_node has cognitive complexity 102 (threshold 15). Drivers by points: if/else 41 (66 pts), match/switch 7 (13 pts), loops 6 (12 pts), boolean chains 11 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/styles.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece145e201e76aeefae3452cad32ef8181cc8c2bb5b1599f9e58d77fb07da7c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::preferences (cognitive 101): Writer::preferences has cognitive complexity 101 (threshold 15). Drivers by points: if/else 33 (55 pts), loops 16 (20 pts), match/switch 10 (20 pts), boolean chains 6 (nesting depth added 36). Of this number, 100 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b1e6a0e0f605252985d1c7fede291fbcd38269169c27c4de618c9512aa3a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::ranges (cognitive 99): Writer::ranges has cognitive complexity 99 (threshold 15). Drivers by points: if/else 22 (47 pts), loops 16 (30 pts), boolean chains 20, match/switch 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/story.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae5d9a5709b0d7d52e0b8c14345ef464b011a13c13369f07bb64f7378dd1a70"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.measure (cognitive 93): render_compare.measure has cognitive complexity 93 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 14 (26 pts), boolean chains 16, ternaries 5 (14 pts), error handling 2 (4 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d374038fc1ebe7787328bdccbf3cf7ecf66cb29b051fe21c4000af94927c86"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.report (cognitive 85): render_compare.report has cognitive complexity 85 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 14 (22 pts), ternaries 9 (16 pts), boolean chains 12 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a04d64920b911bca2ef3085ffaa3809434f3ac51abe1240ba3c3cc5324bc144"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::designmap (cognitive 81): Writer::designmap has cognitive complexity 81 (threshold 15). Drivers by points: if/else 28 (46 pts), loops 18 (22 pts), match/switch 6 (11 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0194f688065c1705100d0ec43f6f63312b03c708f64940f907a871e034f2bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::graphic (cognitive 75): Writer::graphic has cognitive complexity 75 (threshold 15). Drivers by points: if/else 28 (54 pts), loops 13 (17 pts), boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7b0be0e4d4e4e7ae2cbbe722813de76d78edf303403d1893525723b0eb9a32"}},{"ruleId":"D2","level":"warning","message":{"text":"element_values.analyse (cognitive 74): element_values.analyse has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (41 pts), loops 10 (22 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/element_values.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf5bfdce8562800a2749645959540f8d96688121a26cd46a103cfa4365c77f9"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::idml::transparency::settings (cognitive 71): indd::idml::transparency::settings has cognitive complexity 71 (threshold 15). Drivers by points: if/else 11 (38 pts), match/switch 5 (21 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/transparency.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"4175715247b41b452e1c81b38c6784cc65383902d9d89b59d429b984d6b17a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::placed_graphic (cognitive 66): Writer::placed_graphic has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (48 pts), boolean chains 7, match/switch 4 (7 pts), loops 2 (4 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/idml/graphic.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"c553c46809ea395004f7e4b49171c0acd6e2b93c91c92f542de9d5c6ad432319"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::value (cognitive 64): Writer::value has cognitive complexity 64 (threshold 15). Drivers by points: match/switch 23 (42 pts), if/else 14 (22 pts) (nesting depth added 27). 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/idml/kind.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1404e383e52829c90e5bc76f078b4b072f45a78b997422c8556c891feaf42e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::spread (cognitive 63): Writer::spread has cognitive complexity 63 (threshold 15). Drivers by points: if/else 28 (46 pts), boolean chains 7, match/switch 3 (6 pts), loops 3 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ae0c78179e95a755ae66de082b5605e15011eb86c6f46c2c4fbd87555a5d98"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::styles (cognitive 57): Writer::styles has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 10 (18 pts), boolean chains 6 (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/idml/styles.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46d64083320b6dcef49e2493d642c9e61c08b19c9d58981fc7b8b44fae52b51"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.load (cognitive 54): compare.load has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 6 (19 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f41c7c69f18bf6eeeb0adf81e5bca21e57fa6f66bfef9157d07700de2f66cc"}},{"ruleId":"D2","level":"warning","message":{"text":"audit_corpus.main (cognitive 52): audit_corpus.main has cognitive complexity 52 (threshold 15). Drivers by points: if/else 7 (22 pts), ternaries 4 (15 pts), loops 8 (11 pts), boolean chains 4 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/audit_corpus.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7d0e3f10a06f8d26336781f995ba393a4ace434176641f220590681d0924e2"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.dropped_text (cognitive 50): render_compare.dropped_text has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (31 pts), ternaries 3 (9 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"7950e15cd11783f9fa9b86834b23d28937a7053ed832a0e2c09ac21d27499eed"}},{"ruleId":"D2","level":"warning","message":{"text":"check.main (cognitive 47): check.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 11, loops 7 (8 pts), ternaries 4 (5 pts), error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/check.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"27718d363e09b7b4320456a901374ebf3efebd443988533c3c14c1bdcd5ac453"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::footnote_option (cognitive 46): Writer::footnote_option has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 7 (17 pts), match/switch 5, boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3201e31aee7e7c0368465eca9788f4f381d711df0ae38bc84a92b47984b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::fonts (cognitive 44): Writer::fonts has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 4 (6 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bfc15525fc3ba3b4db2996452fe09477ebe5d39764c6037c55fc8192a42e98"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::style_element (cognitive 44): Writer::style_element has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 9, loops 4 (6 pts), match/switch 2 (5 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/idml/styles.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"d552d9848492d4b664ec8732f147e6858140ecf49564204f04292968476c7b21"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.compare_pair (cognitive 44): compare.compare_pair has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 6 (10 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa28d28a6f5a6819f490180cf9af6c03eea8c2360d83dd99376977b40fe633c"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.images (cognitive 44): render_compare.images has cognitive complexity 44 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 7 (16 pts), ternaries 2 (7 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64fa883eecaadee0d8e5fb0a2896825dabe0c67275748921af31b2333ba6f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::hyperlinks (cognitive 42): Writer::hyperlinks has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 5 (9 pts), boolean chains 4, loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"9983a8e94b13764689e2a71205aad34593174a3f5d862d8481502f689aa2b5b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::table (cognitive 42): Writer::table has cognitive complexity 42 (threshold 15). Drivers by points: loops 12 (20 pts), if/else 10 (17 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/story.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"da41159dd61f574a2daef95a9aea87004456f97e67a59bf0b917e62b677aa49f"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::class_object (cognitive 42): Reader::class_object has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 1, match/switch 1 (nesting depth added 20). 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/model/document.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1c4bfea97f2d5fb5308a725e13f09d5487b21429caf3495eabfbecfce0b58e"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::model::prefs::print_prefs (cognitive 42): indd::model::prefs::print_prefs has cognitive complexity 42 (threshold 15). Drivers by points: match/switch 18, if/else 15 (16 pts), loops 5, boolean chains 3 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/prefs.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"525dfaf1b80c7e17dc445d80845c9587abde066c433f7784033dfdd8ca36d193"}},{"ruleId":"D2","level":"warning","message":{"text":"element_values.scan (cognitive 42): element_values.scan has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (9 pts), boolean chains 4 (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":"tools/element_values.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"185eabd4bfe4aa680ec0f9e7ab839d76cfc29e2b8b470f43e0f0dccb9d39186c"}},{"ruleId":"D2","level":"warning","message":{"text":"element_values.blocks_xml (cognitive 41): element_values.blocks_xml has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 8 (14 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/element_values.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"be725d9228d6e70c6766c0d9ddf0c64d68fd64637385bd917da505b37ef2ba01"}},{"ruleId":"D2","level":"warning","message":{"text":"root_values.analyse_object_styles (cognitive 39): root_values.analyse_object_styles has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 6 (11 pts), boolean chains 4, ternaries 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":"tools/root_values.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b219268f4bc65f78d53596deb53a6f2ae366ebc927792e90260c9f657e0995d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::page_item_contents (cognitive 36): Reader::page_item_contents has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (27 pts), match/switch 4 (5 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a2f50692ec934d2b06ccaac40460a5eded857907510c4017b92fba29b7467b"}},{"ruleId":"D2","level":"warning","message":{"text":"element_values.main (cognitive 36): element_values.main has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 6 (15 pts), loops 7 (11 pts), if/else 6 (10 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/element_values.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c408e66022eb7448c6bad600a7b13468fb2e688087464232df4ee86627c64aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.line_checks (cognitive 36): render_compare.line_checks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 4 (6 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de98e6b90be759eb8e14ad10bd25be5944e25683865c824efb34139e8346651"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::text_frame_preference (cognitive 35): Writer::text_frame_preference has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 5, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"132f10fa1a2c5afdc45f48a3b178dda410d56508aef214809b8637f1d816c8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::graphic (cognitive 35): Reader::graphic has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 26 (34 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8deadfb0bf0ea90ba001231f2bf5487b33ac4307394b8b46a550788241236824"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.value_coverage (cognitive 35): compare.value_coverage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 7 (9 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"b570b5fa8d46e0f6ead12fed8f0f4cc2079b668f0204516183f1790fc7a8a230"}},{"ruleId":"D2","level":"warning","message":{"text":"inventory.main (cognitive 35): inventory.main has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 7 (14 pts), if/else 7 (9 pts), loops 8 (9 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":"tools/inventory.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d923de5830a3f5d37732211a4efe32058674336c140886e86b26f9c2170c336c"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::timing_setting (cognitive 34): Writer::timing_setting has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 6 (12 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/animation.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59eadc1fa42e7d6a1d1c0ca46524faafedd7b51b25c02cd04baec0685ddfede"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.judge (cognitive 34): render_compare.judge has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 6 (11 pts), error handling 2 (4 pts), loops 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":"tools/render_compare.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2897a6f3037166dcf2c6bb04116750b9de787f4f46e86af8c95061d59e0b070"}},{"ruleId":"D2","level":"warning","message":{"text":"root_values.analyse (cognitive 34): root_values.analyse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 5 (10 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/root_values.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2df317fbe323f325cc83cb6f99b2483abf02001fe5bbac25e220d4d4bdbdeb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::text_attrs_of (cognitive 32): Writer::text_attrs_of has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (6 pts), boolean chains 4, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/attrs.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b41ff9e7d1c09073c6e639385c9dedff2c1593accaa17b1680aca262ed4e334"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.validate_cached (cognitive 32): compare.validate_cached has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 7 (15 pts), boolean chains 1 (nesting depth added 16). 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":"tools/compare.py"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6399c9bd716a16903cae98893b0dc4f07820a8f2861efd4b7a1876d002036437"}},{"ruleId":"D2","level":"warning","message":{"text":"check.diff (cognitive 31): check.diff has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, loops 4, ternaries 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":"tools/check.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bbb13f73edf00ddce9a661f7ba3b689d9606a67eec4821466615f4500e67be"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::cell_grid (cognitive 30): Reader::cell_grid has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (13 pts), match/switch 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b4189e59bd89eb6284db567eaa4fad781d5350aa52efbc8a8b1718259e4b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.frame_heights (cognitive 30): render_compare.frame_heights has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (21 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a7b52d1fa4ac70ac2acf1a1cd4821f9996268bbaecd59f4d90df8c907bf633"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_corpus.main (cognitive 28): fetch_corpus.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 3 (7 pts), loops 4 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fetch_corpus.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"39001fadcbbfd6680f58c0f7e719ff08e2163002035befdf924f6983b6202b54"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::languages (cognitive 27): Writer::languages has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a09af41c1862ceaa9aaa18ff3c4d78570f542e8273ba337726d277135acf4e7"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::idml::export::object_export_option (cognitive 27): indd::idml::export::object_export_option has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 3 (6 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/export.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e37e219d690beafd5ebe7281cb2cef183323eb49ddfc1c198f68d9f0c831123"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::audit (cognitive 27): indd::audit has cognitive complexity 27 (threshold 15). Drivers by points: loops 15 (22 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9319da232f05b3172ac5fbd881aead9ac9fdb6591d95cd07cd620f212a39055"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::style_values (cognitive 25): Writer::style_values has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/applied.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43975d50bd2cda3c76d980de24beb5d4a574318ac67cf338c034588213d54d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::endnote_option (cognitive 25): Writer::endnote_option has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (6 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/idml/designmap.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec24b6d2e67ba86d48408c185779916471607406059079b2bd4344a27aeedc7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::properties_with (cognitive 25): Writer::properties_with has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (19 pts), if/else 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/format.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46502657524df929985a1e36851935946209ed0e1f54a455a022144206075b6"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.main (cognitive 25): render_compare.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 8, boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1d4d5749af9af3246fe1a0c4a8ac68a6604198dc6ec3c388851c0e3b4d7980"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::text_wrap_preference (cognitive 24): Writer::text_wrap_preference has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20a90f3cf5cd92344a878b7a7918551ab79d4b5ab10b15f948a564d17ee66d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::spread (cognitive 24): Reader::spread has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (11 pts), if/else 3 (8 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/spread.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"685882498ff8113d0e42a85e450d05778ff9150f51491d602d7136a995c1285b"}},{"ruleId":"D2","level":"warning","message":{"text":"Destination::read (cognitive 23): Destination::read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/hyperlink.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e06c7e50e6b5e049e0c96fa4e83aa984d0b09a53ec24ab29f504a677367763"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.props (cognitive 23): compare.props has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95ba0aa86a6ef729338c6b71a5d2096ee2bfb1be702780120e59336f16816c9"}},{"ruleId":"D2","level":"warning","message":{"text":"element_values.analyse_keyed (cognitive 23): element_values.analyse_keyed has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 3 (9 pts), boolean chains 2 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/element_values.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fbb6d6cecf86e843e31cd7c22fba7f4fd644657a4f409a8b7630d78c4cded6"}},{"ruleId":"D2","level":"warning","message":{"text":"root_values.write_preferences (cognitive 23): root_values.write_preferences has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (10 pts), ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (root_values.write) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/root_values.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c978af3756d6e9c3fed8cd1de6de5cb06cba84d9a4e165255cf452d291d0af2a"}},{"ruleId":"D2","level":"warning","message":{"text":"root_values.write (cognitive 23): root_values.write has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (10 pts), ternaries 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (root_values.write_preferences) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/root_values.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ee7b73c277b0fe9d92ae57424d180a27f98e41e978b0249d9962e2dc196b38"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::cell_edge_attrs (cognitive 22): Writer::cell_edge_attrs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/attrs.rs"},"region":{"startLine":2004}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3eb4d16ef85a629d667731595ca494c45b552bbd9e41a84977e21d4c709784"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::idml::format::num (cognitive 22): indd::idml::format::num has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (21 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/format.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"757b7a8e90e360221f997c7175b77e2a6cc13d25f4947682cdec7065655611d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::values_in_effect (cognitive 21): Writer::values_in_effect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, match/switch 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e042e37674b2935bcfab14fecb1e320636eb46817a4cd69cd09a4c040f9183"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.script_of (cognitive 21): render_compare.script_of has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 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":"tools/render_compare.py"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9750ab70c263dae91f5b36ed692e19d9a100f31908651ae19a3ddb28c4ee89f"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.doc_issues (cognitive 21): render_compare.doc_issues has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (9 pts), loops 5 (6 pts), if/else 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd977bf6a18cca4d605f9935b9c40c4382de7b66e3441aeb0529cccae73f7fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::animation_setting (cognitive 20): Writer::animation_setting has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4 (7 pts), match/switch 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/animation.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcc30c9092b41ed9859d9087b613ab4dd83a2b590293d0a7c0753e5d06aa07f"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::variable_preference (cognitive 20): Writer::variable_preference has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ab0211f6b926eb9129d4db9959b173e05834008016cca6bfadb5c7b6987cec"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::form_states (cognitive 20): Reader::form_states has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5ae6d61c75bf7333ffad70811b5ed962a9dfc8f7d4c6e8e895acca1a1b3db2"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::idml::values::parse (cognitive 20): indd::idml::values::parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/values.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0d715bd68667316eaeb97125bffc051e15ec7a9b960e489e534214ab497794"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.convert_cached (cognitive 20): compare.convert_cached has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 1 (2 pts), error handling 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":"tools/compare.py"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2eea506b2a882fa2fb89e3d95b4d1b5869364d2622ef730f45f51fda073686"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch_corpus.download (cognitive 20): fetch_corpus.download has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fetch_corpus.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f345a07f18e4e3164b488fe4b78bd69140f55920df08353db9a28f9747660ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::link (cognitive 19): Reader::link has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b4f7e890bf8e9e903b4838fdc09e46bbc7bc8def9641d9e264fe250bd4d2ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::resolve_spans (cognitive 19): Table::resolve_spans has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (10 pts), match/switch 2 (5 pts), if/else 1 (4 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d29b1cec0dac079bd9f789ab8a81e1681e2fe414fcd529bbddb43f530a716c"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::model::hyperlink::source_ranges (cognitive 19): indd::model::hyperlink::source_ranges has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/hyperlink.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"2778274ee5d76d808f83545c47dd76ba9ddeb6f8cee1ab5711d9f28573a0416f"}},{"ruleId":"D2","level":"warning","message":{"text":"ValidationCache.__init__ (cognitive 19): ValidationCache.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 pts), ternaries 1 (4 pts), error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"80268a78e4e855d6eef6a579979c9026e64bb936f923adf68bf9bf177209493d"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.candidates (cognitive 19): render_compare.candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 1, ternaries 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":"tools/render_compare.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9b3483922e559e4ceba19174fe70f40a7ef54c89b932573ac78926de6c0b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.ra_flags (cognitive 19): render_compare.ra_flags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a15521aa569b86a69a172e6f9162c7a4839aa1a4f89083f22d38407097089f0"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.ab_flags (cognitive 19): render_compare.ab_flags has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd606404526c46bba2a72fd4cf5c8e585303d8c6940ccc92691ff71bbe45342"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::story_xml (cognitive 18): Reader::story_xml has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 5 (8 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/story.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"934b9b366504e40bc7d657e67a11d66e604e50a57493b27f3f2d2da19cadb470"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::xml_elements (cognitive 18): Reader::xml_elements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/story.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c75f7a6b92a5287ea1a4447ab641d27399b9df555ab4f44c83d7803234bb7f1"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::stroke_styles (cognitive 18): Reader::stroke_styles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19abd76b91a3aeda91d3781b222150e3f1af3fb7ce5f3e2159195b2ca01f0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::model::style::prune_style_groups (cognitive 18): indd::model::style::prune_style_groups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbedecf239c21903ac9af81fb5fd89266db9c9dfa28e335474c3db05777b7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"diff_outputs.corpus_files (cognitive 18): diff_outputs.corpus_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/diff_outputs.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5470a25ffa7042daa57ae154e8331c3c00cbc9bd172632230f6e3a96e50e3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.part_items (cognitive 18): render_compare.part_items has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"2434f5a7292ec9f882ec5b10e6883d3b46113495e0e6e0083aa2767b5e0834d5"}},{"ruleId":"D2","level":"warning","message":{"text":"root_values.analyse_preferences (cognitive 18): root_values.analyse_preferences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (7 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/root_values.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea83b3556f6353765cc6580cbea3318eb76bea6374da026134c9c68bbb573d6"}},{"ruleId":"D2","level":"warning","message":{"text":"root_values.main (cognitive 18): root_values.main has cognitive complexity 18 (threshold 15). Drivers by points: loops 10 (14 pts), if/else 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/root_values.py"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da50281a7ada169fc75fde92179d9f2190e56547db0f261c561fdf36da8ed03"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::link (cognitive 17): Writer::link has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (17 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/idml/graphic.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46561f77fd6ebfff306b872a678b772f949b50d7f473b29897ae93332a839ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::shared_values (cognitive 17): Writer::shared_values has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"73097c602894e1dfe32aafbee46c921032765b3e76b1e661292655fa98da1b01"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::document (cognitive 17): Reader::document has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (7 pts), match/switch 3 (5 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"40047479fa68b0983f6b5813ba43c15edd81dd7ee58458a3233bc4fdc7c85a98"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::model::item::item_bounds (cognitive 17): indd::model::item::item_bounds has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (6 pts), match/switch 2 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1943}}}],"partialFingerprints":{"codehealthFindingId/v1":"5733959ef75c7d2532af4bcea94689adabecd570f83c4691fe5fe1110266dd90"}},{"ruleId":"D2","level":"warning","message":{"text":"render_compare.text_pages (cognitive 17): render_compare.text_pages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 2 (3 pts), error handling 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":"tools/render_compare.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45c5daf8cbf97175fe2e859bcb97bbe9cba43c89d1a128f33e55c2d13eff5c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::toc_styles (cognitive 16): Writer::toc_styles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe41002edaf4f0128acf816351b0071bfb1c1880ff1e6c355509149effa5767"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::media (cognitive 16): Writer::media has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/media.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4573143599557a79af195c75504616e3d0ec56264173bba8d86b709c26f0001b"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::root_table_style (cognitive 16): Writer::root_table_style has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/styles.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc57c76719d1f9165a4c411e8f7883334601e0cb4f5477fbc69b9128c2628131"}},{"ruleId":"D2","level":"warning","message":{"text":"Attrs::records (cognitive 16): Attrs::records has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/attrs.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d89a39b1efacfac6842fd6cd6ae91584185483b7a7ca18f8dd22b3b6d42a1f3"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::idml::swatch_refs (cognitive 16): indd::idml::swatch_refs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/mod.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6faa99e67eef6058158cfed538227dabb21473069e134b5e0926f64137753d1"}},{"ruleId":"D2","level":"warning","message":{"text":"indd::model::font::parse (cognitive 16): indd::model::font::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/font.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a928c2e802f2c950e3605ce7a349dbb459c393a077a73fb6111f9e1d8c137b4"}},{"ruleId":"D2","level":"warning","message":{"text":"diff_outputs.main (cognitive 16): diff_outputs.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), loops 4, boolean chains 3, ternaries 2 (3 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/diff_outputs.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d33fabaa20331003380d64c07df2bfac2dbececbab121ccae671e5ce65d71f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.prefs: MethodTooLong \u2014 prefs runs 914 significant 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 814 over it, 9.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/prefs.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c6567ae7caa90d314dcd57c3ad2597a3f60ca53221150290adb0efaf3fca07"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Writer: TooManyMethods \u2014 151 methods, declared across 14 files: idml/spread.rs (29), idml/designmap.rs (23), idml/story.rs (20), idml/styles.rs (18), \u002B10 more file(s). The bar is 30 methods; this is 121 over it, 5.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fd2f18c7809349e4ea4b45adef3a8fb121f6bbaeaaa53c8e21a5d952288865"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.story: MethodTooLong \u2014 story runs 404 significant 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 304 over it, 4.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/story.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee29c5009d0926000cba7c7db2f52975c66c344e7f5d2bbc1cb60a43b2e600d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Reader: TooManyMethods \u2014 110 methods, declared across 14 files: model/item.rs (23), model/settings.rs (19), model/document.rs (17), model/reader.rs (12), \u002B10 more file(s). The bar is 30 methods; this is 80 over it, 3.67\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/reader.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac554872bee816c181f8308f8d71616ce3fbbc4794f93470ae50aa969f967f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/prefs.rs: FileTooLong \u2014 1763 significant 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 1263 over it, 3.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/prefs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae86573baab75f32171fbf8fcf28d23b08a972f84cd5415a86fb42258b235e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.preferences: MethodTooLong \u2014 preferences runs 308 significant 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 208 over it, 3.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28cb34b9432855512d2c4d067ff9e622ef4644ae857fa1b9ba58ef3daaf74a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: idml/attrs.rs: FileTooLong \u2014 1470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 970 over it, 2.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/attrs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb004e19c21d55b348d31cc9785af1f9b08451d04df6df0502553ff593b4269"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.graphic: MethodTooLong \u2014 graphic runs 289 significant 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 189 over it, 2.89\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a95823897a0862ed898f413b1f1bc0ff6e41f4ca68167c1a520c99600c9ece"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.page_item: MethodTooLong \u2014 page_item runs 279 significant 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 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values 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/idml/spread.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32dbe793b497b5032dfb244ed4240c054399b1ca3e2a145e2e0cb5167b2a955"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: idml/spread.rs: FileTooLong \u2014 1380 significant 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 87% of them inside a single declaration: Writer (266-2041). The bar is 500 significant lines; this is 880 over it, 2.76\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/idml/spread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"196d00c83cdf63365adf3b5a5e48f6c28ec982ffd7c161deb35ebb9060c681eb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.designmap: MethodTooLong \u2014 designmap runs 275 significant 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 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"27609ee7ab5fd4c16144098e562ce639860938c2a2a6647910b4c4d9b91b64f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/item.rs: FileTooLong \u2014 1357 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Reader (682-1829). The bar is 500 significant lines; this is 857 over it, 2.71\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/model/item.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5eca76b3c0bff21d6c2d243c6a130e382b3ba1982e540c24befae9ec09bd16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.object_style_node: MethodTooLong \u2014 object_style_node runs 270 significant 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 170 over it, 2.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/styles.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a0247abad2d7759b0f304b1d5669e1556efec921767d797c2c5fe0a6c39b74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.run_content: MethodTooLong \u2014 run_content runs 252 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/story.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c741dc833f5f5913235392d09d5f9c8d78e1131aed4a20d72f0a5023f7ac1552"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/render_compare.py: FileTooLong \u2014 1229 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 729 over it, 2.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":"tools/render_compare.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf884c41e16b1f467318431248747c94d3faadebef07964b4f2dcc7e3c0d661"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/compare.py: FileTooLong \u2014 1184 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 684 over it, 2.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd476b090594acc023253fcddb07800cf3dd132fdaaf4bd45bcf7f3edee97fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: indd::model::prefs::print_prefs: FunctionTooLong \u2014 indd::model::prefs::print_prefs runs 230 significant 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 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/prefs.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c656ec37455740c6ae22ed73498db5c25a3bf86808f4c9b4219868d1e8511f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: idml/designmap.rs: FileTooLong \u2014 1077 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: Writer (111-1442). The bar is 500 significant lines; this is 577 over it, 2.15\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"536193cae69f84e12f714ac2afed3c7b3f4c1d7517bcd7ebc475d97706df0c74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.ranges: MethodTooLong \u2014 ranges runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/story.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"69975647c1aa24dd075927fb8b03b524cd1dc1a8d4d1d1904bf06326b1d45b34"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Document: TooManyFields \u2014 62 stored fields beside 1 method. The bar is 30 stored fields; this is 32 over it, 2.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fef11a1d8401e1b23c1c22612fdb93dba949539233096d03be8e328b189a4ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: idml/resources.rs: FileTooLong \u2014 964 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: Writer (77-1330). The bar is 500 significant lines; this is 464 over it, 1.93\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/idml/resources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03001355d0bae1d6aa8b6b17e8b61acfc23782d59ae093f3f4c3146e2b4fdb71"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.value: MethodTooLong \u2014 value runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/kind.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac44946dd1def7feaad99392c4e43c34d5a6016406ad63409ac3b9fa9cbba39"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: idml/story.rs: FileTooLong \u2014 914 significant 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 87% of them inside a single declaration: Writer (147-1300). The bar is 500 significant lines; this is 414 over it, 1.83\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/idml/story.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be1b91d23386b36c006d4ee93345d3c063b39d1b81146ff9cdc6126fa53d430"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.document: MethodTooLong \u2014 document runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a79f0ace8ce31fdbb1f7eb8743afc89d465b976376414370fe0f445caca90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: idml/styles.rs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: Writer (76-1101). The bar is 500 significant lines; this is 240 over it, 1.48\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/idml/styles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34d567e4608c80f7c928a5082061b495780de7d54deb2323a8f6517b93ddf19"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.footnote_option: MethodTooLong \u2014 footnote_option runs 142 significant 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 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e976978084360406d42a915ab61113e78537a642993568b4e507af927c3479"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: idml/transparency.rs: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 197 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/transparency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa9cdd2ebcd280f1130edc2c50492579b0334106e51c9ebcada354c30d99673"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/story.rs: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: Reader (280-998). The bar is 500 significant lines; this is 171 over it, 1.34\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/model/story.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d53011fb7105e496ed1214d66018a6be185dee034b5a9c3293a857783f17726"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.hyperlinks: MethodTooLong \u2014 hyperlinks runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/designmap.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87fc6c2c2446480f454f08a02b8e4414992f34413190120f0df762cbda0edb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/document.rs: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: Reader (236-921). The bar is 500 significant lines; this is 132 over it, 1.26\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/model/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c77689604a8846889d506f0d1769cf994f6d3ef78d9763c49f8c4f06b1de12"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.spread: MethodTooLong \u2014 spread runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00fe0e24246fc89fca13af4574afa5e25c3902c227e70f6e41b486f13a66cda"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.page_item_contents: MethodTooLong \u2014 page_item_contents runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ec598e163cb0cf919dfd3f94f60e9c7cd929ebab291f644d59324afe6bc79b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.graphic: MethodTooLong \u2014 graphic runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6910acd90ebad5cef2fb0effcfa6b2db4d042198cc719aeb765b6869d49128cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.styles: MethodTooLong \u2014 styles runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/styles.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1237aacc0c1e04a5a9b3fbab7b536dda3634fb1276387fefd616e833b163dd5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.placed_graphic: MethodTooLong \u2014 placed_graphic runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/graphic.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd4d0a10eaff5db0caf08be02fbab2dfee0e922d7f4a8913e9d9a5038c3ed1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/style.rs: FileTooLong \u2014 543 significant 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 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"828ca2792a9a78146eb1c7f42d84ca1c1ff0a2fe822d060310ddc2c36359ae5e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.text_frame_preference: MethodTooLong \u2014 text_frame_preference runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"451d54c84bd65ef4d2f33ba305519acd1c67f7b01c02a26fc13785f988e45e49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/settings.rs: FileTooLong \u2014 504 significant 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 68% of them inside a single declaration: Reader (2 blocks, 124-634). The bar is 500 significant lines; this is 4 over it, 1.01\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/model/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a734f7b0cb3c491da73f98fc092791923386411fa8faeab084d033be191bf240"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/table.rs: FileTooLong \u2014 501 significant 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 1 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28919458f96c4577c2fdf9060817b9f58c6bb267d6858901471ef21987690ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): src/idml/spread.rs:806-820 | src/idml/spread.rs:1171-1181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccdc3207a857e8e817d0f6e386dca564fa53026a7436b2d6b03ebe064c68b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/model/item.rs:1429-1442 | src/model/media.rs:110-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/item.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f5d22d78960bd11e041c72546614554ab1d69ca0b2e6ebbbf368ea21cf6729"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/idml/resources.rs:1100-1111 | src/idml/resources.rs:1118-1129 \u2014 both copies are in the same file, so extract the block 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/idml/resources.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ba9d7a50c3be95103138765fff56ce24942d4aa6cb38b57b9b9b1e24bf38aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/idml/resources.rs:939-946 | src/idml/resources.rs:988-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50dc0462b0025ba3a4477ce971a2e4679d21dffaae49a3de4e75d5ed87a8698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/model/hyperlink.rs:524-533 | src/model/xml.rs:81-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/hyperlink.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b80ef944e19f52cc89854e593ac56fe19438cda86ad64f8b2a7ccf84beddce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/idml/story.rs:715-722 | src/idml/story.rs:731-738 \u2014 both copies are in the same file, so extract the block 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/idml/story.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79bab9ce4886628f7f860950f8f1e4db38b148bcc370dd26e61e4af216c4e94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/model/settings.rs:128-135 | src/model/settings.rs:246-253 \u2014 both copies are in the same file, so extract the block 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/model/settings.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440dc274e1205e361863bfe8e053f37555dd4c367306f7398558e8f44413f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/model/settings.rs:437-444 | src/model/settings.rs:476-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/settings.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9979c89dfcbfda49f220a1f8fad0dd7846494f78faf9c19f192db35c7680bed8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/model/hyperlink.rs:571-577 | src/model/xml.rs:67-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/hyperlink.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7493cf540676dc8ca5db3abd36a998a69327abaf379d079a556fa54b247a0ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/idml/attrs.rs:2105-2109 | src/model/item.rs:1974-1978 \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/idml/attrs.rs"},"region":{"startLine":2105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0bfc2d5d96c6b3b07b81cddefd3ffed652a1c485a2bc20d46f65a6fac17eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/model/animation.rs:65-75 | src/model/behavior.rs:128-138 \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/model/animation.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb445402515f86997c9d180cfc3ce9dccaea0b39bcd2f9338c99f3821f3ff9ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/model/index.rs:41-48 | src/model/prefs.rs:132-139 | src/model/settings.rs:637-644 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/index.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e2ec49fce568b316d0e82bd4960736ca147556663d7e53687aa0cb2294e242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/model/settings.rs:544-556 | src/model/style.rs:396-407 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/settings.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1ee4b2296e5d507230a763e2a4f4d299d011d3c0fc01377ddbced3025c9767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/idml/format.rs:127-132 | src/idml/format.rs:145-150 \u2014 both copies are in the same file, so extract the block 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/idml/format.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"86904a2bbcfbfddb5e1e8267306c36e2048183c35b678e79624bc30cec808395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/model/behavior.rs:221-226 | src/model/item.rs:1287-1292 \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/model/behavior.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b5d78b7b3911c54acafce8b9b682a59265416c5fac8e73a94267fad6588e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/model/item.rs:1286-1291 | src/model/style.rs:67-72 \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/model/item.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8357d88cc97e555de0f9b6f3cd2bbdce3c7a28a26ac88830b4567936fcbef4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/model/item.rs:1286-1291 | src/model/style.rs:76-81 \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/model/item.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"57857d793cd89d0febd3247d40a6fa953d2b894ebf0448f6d6d817640c1ef1a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): tools/root_values.py:298-307 | tools/root_values.py:323-332 | tools/root_values.py:362-371 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/root_values.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1449d849476c7f20dbc0fcd5709f913c5cbc501c2849f7fdac15b5914e132439"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tools/fetch_corpus.py:104-112 | tools/fetch_fixtures.py:54-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fetch_corpus.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"960adfd89e55bb60d025cac96b7e63449d5360d6b767bf2702105b3db6e09de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/root_values.py:154-161 | tools/root_values.py:207-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/root_values.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bb8dfe59b99c304d82167e77b21265fe8d7626fa31ba36954c34fcb2d2c8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tools/audit_corpus.py:151-155 | tools/audit_corpus.py:159-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/audit_corpus.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3bc3dae3601f646782660ad9c6cd59049f2cb152faf05e9e5d74435e9bf84e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tools/check.py:193-200 | tools/diff_outputs.py:197-204 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/check.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2522f8d735f6fa7a8446930fa9649e074a6faaa9708f9fcbc3e74e512132b8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Color (LCOM4 4): Color\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/color.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabe34d1ed63197374b14612d61506acd71f6373cc237c8adad9afdfaa0583d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/prefs.rs: src/model/prefs.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 233 in Reader::prefs at line 1225. 1 of those changes was a fix/bug commit, and the other 26 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/model/prefs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/model/prefs.rs"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a335af2e2b45f4361ea824643ca0d7c79f0ea8b586cffafa3198d2c83839df6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/spread.rs: src/idml/spread.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in Writer::page_item at line 749. 3 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/spread.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/spread.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aa30402cc7d5ab8cfbaa965bb2513d65fba6604030123d9cf5f471b144530f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/styles.rs: src/idml/styles.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in Writer::object_style_node at line 481. 3 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/styles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/styles.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef040ee233f05c45c0c0370ac791c25e5762cc03075e36e935521179685099eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/resources.rs: src/idml/resources.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in Writer::preferences at line 897. 2 of those changes were fix/bug commits, and the other 31 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/resources.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/resources.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19f8fb1f203a8c4131ac0042942ef011835224c570c8925d28c7387a3036261"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/story.rs: src/idml/story.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Writer::run_content at line 657. 1 of those changes was a fix/bug commit, and the other 30 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/story.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/story.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c236e447b0ed852308ee79827b451fe11d232ded607f2e06db97aa62b40b32ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/compare.py: tools/compare.py changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in compare.main at line 1230. 9 of those changes were fix/bug commits, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- tools/compare.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f3ead9e832ddfd30c74f835509c4b5e430a552e26d6abaccbb54106b18f54a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/designmap.rs: src/idml/designmap.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in Writer::designmap at line 167. 3 of those changes were fix/bug commits, and the other 31 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/designmap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/designmap.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"002d4adb2904af3edaca0697142cf79910b70282131b6e5ea7f6e5615a9b1e11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/story.rs: src/model/story.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in Reader::story at line 297. 1 of those changes was a fix/bug commit, and the other 19 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/model/story.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/model/story.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ebe32684f6806eeeaec43da7b8c91879292d7df8c3cab232661976e5006aeb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/document.rs: src/model/document.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Reader::class_object at line 584. 2 of those changes were fix/bug commits, and the other 31 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/model/document.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/document.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b302c93c10c5b6c4b54f66f8e9d7b0fae819f49df5b732b5ad19c6b6a01ae1d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/kind.rs: src/idml/kind.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in Writer::value at line 165. 2 of those changes were fix/bug commits, and the other 16 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/kind.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/kind.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a414fbc20014c564320bbe13d2d033d279a4e7a31542b235354aff69a06ea4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/attrs.rs: src/idml/attrs.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Writer::text_attrs_of at line 1802. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/attrs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/attrs.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f06fb5fcfbc84072bfb326aeafe2d7555dfa74affd9018dba84f8798c458194"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/item.rs: src/model/item.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Reader::graphic at line 1422. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/model/item.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/model/item.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3b227f1cf90964b47092b1535a01116c21f6e7e57b434062d97fd030db0448"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/attrs.rs: src/model/attrs.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in indd::model::attrs::decode_text at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/model/attrs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/model/attrs.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"8113429dcdd77a263ff6277ae38a0ea7d84b865ec6b3a44af53c2970cf22afb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/graphic.rs: src/idml/graphic.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in Writer::placed_graphic at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/graphic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/graphic.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9f310a6d7736b12ed44a8f55c4f713c0ae554a35527aabc1d504c2abaa7b13"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/transparency.rs: src/idml/transparency.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in indd::idml::transparency::settings at line 825. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/transparency.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/transparency.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c1ec89071a4e21c8e08af13da711106cdf850f2405192355d611d12444480e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/spread.rs: src/model/spread.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Reader::spread at line 422. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/model/spread.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/model/spread.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"5635094e605739154acafdb6af97da23ef4bca9524eb0900145c77fce1a322df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/model/hyperlink.rs: src/model/hyperlink.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Destination::read at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/model/hyperlink.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/model/hyperlink.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed0975e67dbb5f3b9ec541ced63d89843d471e8391d87497a796889f68ec03a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/export.rs: src/idml/export.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in indd::idml::export::object_export_option at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/export.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7731c36b347eed396200dec4aa88c7c6ccc928f0c06ea05d6999007ef133b7bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tools/render_compare.py: tools/render_compare.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in render_compare.main at line 1472. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- tools/render_compare.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e374475d07e2fe22902dbbc463318a6d7311333e739e428fe3a28ee7165907"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/idml/applied.rs: src/idml/applied.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Writer::style_values at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-25..2026-10-23, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-25 13:00:22 -04:00\u0027 --until=\u00272026-10-23 13:00:22 -04:00\u0027 --full-history --no-merges -- src/idml/applied.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/idml/applied.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"456c31ccd131dee80f342ad7d35ef84537d89d9d5baf56b9aadf15243bdb7abd"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (40388 LoC, 236 module-visible types across 4 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":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ee2ffc0af2101ced13fe7254234054e8aca8449e37f3eec6f0d36afa7e480e8"},"properties":{"commitSha":"0453eb99c57a57f385f5d193a87ae854fefc28cf"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4af3d726802c563b2acaf79ff50bfe370e69baafadb9c696dccbfcfa0a556e82"},"properties":{"commitSha":"0453eb99c57a57f385f5d193a87ae854fefc28cf"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"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":"f3be6688ed4d3dc0fd607689119841b505dd41a85bdaab10c0be89f7a7e95ae1"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: spread.rs \u2194 ids.rs: \u0060src/idml/spread.rs\u0060 (context idml) and \u0060src/model/ids.rs\u0060 (context model) sit in DIFFERENT parts of the tree yet change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006002e4405a\u0060 feat: write the script labels of frames, shapes, groups, buttons and \u2026; \u00608b259742\u0060 feat: write the ContourPathName of contours; \u0060dd2b3f07\u0060 feat: write the custom text wrap path \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/spread.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf24e3e18188b1582e6a3d2678ebea368353531c666ffc4c36fbed1401f8dd5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ids.rs \u2194 item.rs: \u0060src/model/ids.rs\u0060 and \u0060src/model/item.rs\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006002e4405a\u0060 feat: write the script labels of frames, shapes, groups, buttons and \u2026; \u00606dda8c63\u0060 feat: write the preview data of unlinked images that name no raw data\u2026; \u00608b259742\u0060 feat: write the ContourPathName of contours \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/ids.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e51c39f1152edcf9d0a1b1b0e8f61cbdcbeb06f2c212e73355b54bd8c29eb"}},{"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":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) \u2014 this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.strip() and not line.startswith(\u0022#\u0022)\u0060 appears character-identically in 2 files \u2014 tools/diff_outputs.py, tools/inventory.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/diff_outputs.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b318be4f2c01ae7a86372f76793b06aa8fa2deeaea8dede79c451ec4df8ea2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060order != \u0022LE\u0022 or not dom or ver.split(\u0022.\u0022)[0] != dom.split(\u0022.\u0022)[0]\u0060 appears character-identically in 2 files \u2014 tools/compare.py, tools/root_values.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6513cbb2314f13a1a90982532c696603fe8cffaf7ee13bef9bc7ad79bd336212"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.is_file() and path.stat().st_size == size and sha256_of(path) == sha256\u0060 appears character-identically in 2 files \u2014 tools/fetch_corpus.py, tools/fetch_fixtures.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/fetch_corpus.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b8ab47bf474d72deccf699f807688e5f69a3e909ad80700f7da0430e23925e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r[\u0022entries\u0022] or r[\u0022warnings\u0022] or r[\u0022status\u0022][0] != r[\u0022status\u0022][1]\u0060 appears character-identically in 2 files \u2014 tools/check.py, tools/diff_outputs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/check.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe2deaae43d25b87686f434cb5a91a6407a6b54ace3c6cd123ec2de55be935e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r[\u0022status\u0022] != (0, 0) and r[\u0022status\u0022][0] == r[\u0022status\u0022][1]\u0060 appears character-identically in 2 files \u2014 tools/check.py, tools/diff_outputs.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/check.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b17d9bafa9d7449adbaf472a8695e1aa48fac773e6b9f207328b86d7985c378"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.get(\u0022idml\u0022) or str(Path(path).with_suffix(\u0022.idml\u0022))\u0060 appears character-identically in 2 files \u2014 tools/compare.py, tools/root_values.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed85f7c29d12a1ef5270bdfca12d678af0fcbed6e244d2ec0f16faa0f71c3dbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.builtin \u0026\u0026 os.name == \u0022[None]\u0022 \u0026\u0026 os.based_on.is_none()\u0060 appears character-identically in 2 files \u2014 src/idml/applied.rs, src/idml/styles.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/idml/applied.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ebdb5c94ada528fd0c5a4838df2fe2b6ebf676ba02ab68f89f7a79aa7e13bc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060xmp_descriptions\u0060 returns \u0060[]\u0060 when \u0060ET.ParseError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/compare.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb602af0c01ad1fe1f3cfe75e9f21039adef7a32acbf7ad366bac156bc3cd0c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060text_pages\u0060 returns \u0060[]\u0060 when \u0060ET.ParseError\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tools/render_compare.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a368c6108e55006ec8b1e3475c492b49ee0a91402b8f13d9c95a4a6f31c00127"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060dom_version\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/idml/mod.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f849e51bd1564265203f87c6ac0989c9a1229d2e69cdae9a10c9e40df20184"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060index_groups\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/model/settings.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"51198c40763fd39905443307ceff38e058d47f3e4eb785d1f468850c113620b5"}}],"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-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-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.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-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]}],"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":4,"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."]}]}