{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X31","name":"Test-only surface in a production module","shortDescription":{"text":"Test-only surface in a production module"},"helpUri":"https://codehealth.canine.dev/dimensions/X31"},{"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":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"difftastic::display::side_by_side::print (cyclomatic 38): difftastic::display::side_by_side::print has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"c101320b6554ea16561d9980e6068a232b2fb6ee0a3f4ea2bec058fd143d65be"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::main (cyclomatic 33): difftastic::main has cyclomatic complexity 33 (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/main.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e5db0ccf43755841ab8c687d23bbc99b36015959c410394db4a806bf9d1c05"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::options::parse_args (cyclomatic 33): difftastic::options::parse_args has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca846468c09617d9adda89e187198db1425bc7c9b32abd538a792cbd1db99102"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::display::context::add_ends (cyclomatic 25): difftastic::display::context::add_ends has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b57d94a79efc0f3717095121e6fc8f414f788e26b3923b89efc897d07c67212"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::files::guess_content (cyclomatic 24): difftastic::files::guess_content has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/files.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b642ecd9801a5aa9faa6108a167285bbff4239846a274265d162f3cd67516003"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::display::style::color_positions (cyclomatic 22): difftastic::display::style::color_positions has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/style.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0616d133f12a8c2e8d82b0a8d90d012158c3e25f79ffec41579e43e5b4e1912"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::diff_file_content (cyclomatic 20): difftastic::diff_file_content 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/main.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ca00c4b3cf42c7911d9aa201900654c336f80880d5225070c8132203f2f207"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::parse::guess_language::from_shebang (cyclomatic 19): difftastic::parse::guess_language::from_shebang has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: difftastic::parse::guess_language::language_name (cyclomatic 62) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/guess_language.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd82d31542e7321a10c0dc8b45936df083f807b3f4740b3ecc4b0b80cabb87ea"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::print_diff_result (cyclomatic 17): difftastic::print_diff_result has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e65e49b0024ec8c1fa16ae860f6e6461392b71d846ae20173b5298dfddb74ce"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::conflicts::apply_conflict_markers (cyclomatic 17): difftastic::conflicts::apply_conflict_markers has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conflicts.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4689068a72b3b520bb2bbb25fde2fdb8bdcf3c7f0d15fb4f23c3c4c89e275223"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::display::side_by_side::visible_content_max_display_width (cyclomatic 17): difftastic::display::side_by_side::visible_content_max_display_width has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3750975a004b67c979ccc0411182512ffdfea1b27a1c321f8ea1f8825783a91"}},{"ruleId":"D1","level":"warning","message":{"text":"difftastic::parse::tree_sitter_parser::tree_highlights (cyclomatic 17): difftastic::parse::tree_sitter_parser::tree_highlights has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: difftastic::parse::tree_sitter_parser::build_config (cyclomatic 61) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6524b0cb224113182214ddb34520aac558a83f44f87394a25ba7932e71a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::side_by_side::print (cognitive 97): difftastic::display::side_by_side::print has cognitive complexity 97 (threshold 15). Drivers by points: if/else 27 (61 pts), match/switch 4 (16 pts), loops 6 (13 pts), boolean chains 7 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into 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/display/side_by_side.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e4250c8f66026408ebcaa0d9504957d5854411cbbef8a4bb5e0e64d8b5e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::main (cognitive 69): difftastic::main has cognitive complexity 69 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 6 (18 pts), match/switch 8 (16 pts), boolean chains 3 (nesting depth added 39). 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/main.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ced71ee6c7c684a920ad983a4980fa93d00ff5b0d327dd6a76ca996c2ce41b"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::diff_file_content (cognitive 64): difftastic::diff_file_content has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (37 pts), match/switch 8 (23 pts), loops 1 (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":"src/main.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dbc5d3bdca708509e6384824814dbc7cd49f64c5dc4ed3a018d22390f9a41b"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::style::color_positions (cognitive 47): difftastic::display::style::color_positions has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (36 pts), match/switch 2 (7 pts), boolean chains 3, loops 1 (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/display/style.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51a3a8f79586949c51134d633242bbc8d2d26c96053c84d64b34b38a7fce0c5"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::side_by_side::visible_content_max_display_width (cognitive 45): difftastic::display::side_by_side::visible_content_max_display_width has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 6 (11 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":"src/display/side_by_side.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"793a9bfd6addd82b5059fd885268a74b96511e44a78c301fb5decb45f59c2b14"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::line_parser::change_positions (cognitive 43): difftastic::line_parser::change_positions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 5 (15 pts), match/switch 3 (9 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line_parser.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbe21e29d62d37f41b433ab0106103e4e9308c1d9a9e38ce0fe210d3e75e1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::conflicts::apply_conflict_markers (cognitive 37): difftastic::conflicts::apply_conflict_markers has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 4 (12 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/conflicts.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d42745ca877aed726ce90d1a0485f12833d14a4dfc4126873da1c7ed3f05036"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::diff::unchanged::split_unchanged_toplevel (cognitive 33): difftastic::diff::unchanged::split_unchanged_toplevel has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (9 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/unchanged.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e8ac8986f654f4b74d4b17067987dfeefee1d23f5bffc4a3cba17e9f72a9c1"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::context::add_ends (cognitive 32): difftastic::display::context::add_ends has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 8 (10 pts), boolean chains 8 (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/display/context.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9308c141dc3d77ced2eb16339e4678c8dd9b8e99458aa4e640746be64e753b"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::options::parse_args (cognitive 32): difftastic::options::parse_args has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), match/switch 4, loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"873ee495b6712baa4f719fcc13d30a319169f96e1116e59cb389b9028a1b8442"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::print_diff_result (cognitive 30): difftastic::print_diff_result has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 5 (13 pts), boolean chains 2 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"088f592bdfa5a2286543946ab0a7a7fd3b7e9c230383fb9ca9009a249e35d807"}},{"ruleId":"D2","level":"warning","message":{"text":"MatchedPos::new (cognitive 28): MatchedPos::new has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 5 (10 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7ee2f068ac45c2094c686a85c231282a169d8f4479ed64d864dadfdb7727d1"}},{"ruleId":"D2","level":"warning","message":{"text":"File::from (cognitive 26): File::from has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/json.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73535ea40fb91658539b70a3bb62f97fc751d54696f37ce3d1cafd384c8c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::diff::graph::compute_neighbours (cognitive 26): difftastic::diff::graph::compute_neighbours has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ff41852b8383714fe24fcf70284b46b53e573cc67fcece946941722a6c36cf"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::hunks::matched_novel_lines (cognitive 25): difftastic::display::hunks::matched_novel_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/hunks.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c819c747f2ae1562b4ae5fdd65a5ec218041a44112148cde664c69bdf50a293"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::inline::print (cognitive 23): difftastic::display::inline::print has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/inline.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"38026ec66739bfe7263241e9f428a30bc5362f5afbc780d6c3918b5d514ff8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::style::split_and_apply (cognitive 23): difftastic::display::style::split_and_apply has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/style.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6dda948147f631cb3806a4d04af17db9c45c841fdfdd345c1dab654364087d"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::hunks::novel_section_in_order (cognitive 22): difftastic::display::hunks::novel_section_in_order has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (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/display/hunks.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde1b37b4f2c36fbcfed35d9b75a3f578276058c9a87fe683074014ce1ba3f58"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::diff::shortest_path::shortest_vertex_path (cognitive 21): difftastic::diff::shortest_path::shortest_vertex_path has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (6 pts), loops 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/shortest_path.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2a27a5668818a340ab94f6e50e1ed68c0a63f882e31cdf76c9c0b4b035664f"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::options::parse_overrides_or_die (cognitive 21): difftastic::options::parse_overrides_or_die has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (3 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c691874f5cedb662ed7c2c3597cccaa7befcf317c3583ff1be2d3ef02ae2e29"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::parse::guess_language::guess (cognitive 21): difftastic::parse::guess_language::guess has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (5 pts), match/switch 1 (5 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/parse/guess_language.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f2d12f67ac42ebd3743cc560aa9a74dded9b30f463cbec8a483a614eefb6c9"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::parse::tree_sitter_parser::tree_highlights (cognitive 21): difftastic::parse::tree_sitter_parser::tree_highlights has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b18f16c30aec839b88ad526faa71c534a607dea18e88a6074771c59bf9fad73"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::context::ensure_contiguous (cognitive 19): difftastic::display::context::ensure_contiguous has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"490a12b5f86f993bfd03393fcf45bbc2ae821b76fcbd8949bda42c5c41821586"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::words::split_words_and_numbers (cognitive 19): difftastic::words::split_words_and_numbers has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/words.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434e3e39e7fa1e489d27fddd032dbe999875a5f6595ad0fdd5bfaa95c808e93"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::diff::graph::pop_all_parents (cognitive 17): difftastic::diff::graph::pop_all_parents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cdabd6c3bcf4333a36c89e904c0ddd90aa8ebb0ea1cf38392ffa43a7490207"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::diff::sliders::unchanged_descendants_for_outer_slider (cognitive 17): difftastic::diff::sliders::unchanged_descendants_for_outer_slider has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2a21ee81e2425e3677ed35d064876ae45bea5877aad12650601b1381bc5224"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::context::calculate_after_context (cognitive 17): difftastic::display::context::calculate_after_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b71c3b7e7a8701049b3fb284a5f4190aea046cc73f0fd0351105f13360b0d55"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::hunks::merge_adjacent (cognitive 17): difftastic::display::hunks::merge_adjacent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 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":"src/display/hunks.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78a20824527317daef7483b391da34256962272a77ccec150f8250adc1a27b9"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::words::split_words_up_to (cognitive 17): difftastic::words::split_words_up_to has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/words.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7698d351f9328c7d54bbcbe613081e9311f960daaf2b6df9988adf17f897fd9"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::diff_file (cognitive 16): difftastic::diff_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b958b2b9669d3ba4d751b913129f796aec012f8a9e62fecfefdaf6e287a38ca"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::display::context::after_with_opposites (cognitive 16): difftastic::display::context::after_with_opposites has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"41aa9fd5e394bc98ee53dfe3dd73dd21b88d0b97e7ef9fcd19a7f1ba9a1d8025"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::files::guess_content (cognitive 16): difftastic::files::guess_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 2, loops 1 (2 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/files.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e997b8604c392064d0e2c3b65de5104b6ec35fcf4778b6ed9a022a456e7679"}},{"ruleId":"D2","level":"warning","message":{"text":"difftastic::parse::tree_sitter_parser::list_from_cursor (cognitive 16): difftastic::parse::tree_sitter_parser::list_from_cursor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 1, loops 1, 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/parse/tree_sitter_parser.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d29506f9bf0b1488a21906596d6670c02b0b82f3f60a98bb08898620f793432"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::parse::tree_sitter_parser::build_config: FunctionTooLong \u2014 difftastic::parse::tree_sitter_parser::build_config runs 927 significant 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 827 over it, 9.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12ef873b18cdebc0b40d633eff128381851e43790bf22f58485f6b0faf94cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parse/tree_sitter_parser.rs: FileTooLong \u2014 1469 significant 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 969 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/parse/tree_sitter_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"769cdaeb4b86deb70c1378f151cb3d13d8aca2e1f2a9d8451e8a76158c1f4455"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::display::side_by_side::print: FunctionTooLong \u2014 difftastic::display::side_by_side::print runs 254 significant 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 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd15a4dd1b41e16f8cbe05d9502400310def5f8297403a13f66eb900ba547cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::options::app: FunctionTooLong \u2014 difftastic::options::app runs 226 significant 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 126 over it, 2.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8657dcfad9c78401d30dc0a810d0eddf31186c6a4f10462bf3e7f46bacbe1617"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::parse::guess_language::language_globs: FunctionTooLong \u2014 difftastic::parse::guess_language::language_globs runs 216 significant 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 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/guess_language.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"08326f5c8a56984aa904e22dd3d83b7995d70e667a20539dd677c409d5b05f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::diff::graph::compute_neighbours: FunctionTooLong \u2014 difftastic::diff::graph::compute_neighbours runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5715e483f1d49e5dc446e8f52cc0db71651e33169fc04b588c2931834a742162"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::options::parse_args: FunctionTooLong \u2014 difftastic::options::parse_args runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"8801d771702b8f7c0db003f96383b629495a2aba49596dbdbdb35572b15c98c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::main: FunctionTooLong \u2014 difftastic::main runs 188 significant 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 88 over it, 1.88\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/main.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3fd42ee0fc7dbf83834cac1e1630af7f17577579c82d06ccb01d7acf43a218"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::diff_file_content: FunctionTooLong \u2014 difftastic::diff_file_content 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/main.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbe2785efeadbe522c0ca9b2c06a3766ab8260b4dd4c6fd1bbc64a706ddde9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/options.rs: FileTooLong \u2014 722 significant 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 222 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb50c811e029f36383333faca969a9321a9d9574cdeb0e10cb507955096895a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 720 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 220 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8051fac64e936f7c1865babf7d506a8673f918fe3a29b7d5daf1e9c85ef2e6ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::line_parser::change_positions: FunctionTooLong \u2014 difftastic::line_parser::change_positions runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line_parser.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b98c338bcdd789efa0de3b827b7eaf7873b7fe238fe435ee3b79850e4711eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parse/syntax.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). The bar is 500 significant lines; this is 132 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"049b8a486dea35fe6a585019675c18b69ec9afd03bac4f4b70bc0519cceaa26e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::display::inline::print: FunctionTooLong \u2014 difftastic::display::inline::print runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/inline.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e14d1d545a25aedc9bd5d41f35af2b085ab380cd7800ace4657114f2dfa810"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::parse::tree_sitter_parser::list_from_cursor: FunctionTooLong \u2014 difftastic::parse::tree_sitter_parser::list_from_cursor 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/parse/tree_sitter_parser.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f0753a6c2a4eb98ad9626e685d091a2ee6ade00d734f8ae16666016dee90f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: display/side_by_side.rs: FileTooLong \u2014 530 significant 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 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f947abf0f37685574361c629607de54bd08561573713825b44e9ec68b3b24d31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: difftastic::print_diff_result: FunctionTooLong \u2014 difftastic::print_diff_result runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aaff7778d3969feb9e4f3279314010be33035e6cf683fbd55ad4b69cb866c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 64 shared lines): demo_files/1/src/conflicts.rs:30-104 | demo_files/2/src/conflicts.rs:30-104 | src/conflicts.rs:30-116 \u2014 These 3 members are variants of one another: a block of 64 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/conflicts.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"906154b96442bb0bb3525c34787fe27ba6edaf567f3980fcb85a12b850977018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/diff/sliders.rs:365-409 | src/diff/sliders.rs:416-453 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d952854137cccaae1c2fb10521f69db78942adc760133a4d9ea762bf79ad1ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/diff/sliders.rs:496-542 | src/diff/sliders.rs:567-612 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af625f3f82633b5288be4acf339aad24d3428e1270ccc32268055896dffe11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/words.rs:9-46 | src/words.rs:52-89 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/words.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e128a1148a276b404467e7c9771694fb06861568fc5a31b0ccac3ebd2c1a42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/display/context.rs:379-415 | src/display/context.rs:477-513 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd93b377d1b4e98f51df05f51b3620b201164c81cc8fde70a7cc20ea5b4e7498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/display/context.rs:211-234 | src/display/context.rs:240-267 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab1c37fe28963e95ae0ac021cb6a849c9729fe27819203a8bcb7e0b4385cb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/diff/graph.rs:187-207 | src/diff/graph.rs:212-232 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd269dadd950402b032ffbf7af29a0733ddd3b36da21bbf105734c614b4fbcec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/diff/sliders.rs:289-314 | src/diff/sliders.rs:323-346 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd35af9bda690749836756c64048fdfb189fa22f2ed7216bb557d22fe728e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/diff/sliders.rs:632-653 | src/diff/sliders.rs:655-676 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a817eb2e1a93f760b936ffb3357a685b4fca6be2dfe0e659545bcc7f612ed7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/diff/graph.rs:238-249 | src/diff/graph.rs:255-266 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b9eaccdb7896000af88ac0a13c90fd851bec5c3f84dd2197a0b0904346e0dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/display/hunks.rs:209-224 | src/display/hunks.rs:626-641 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/hunks.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"700822b8afd2660f960b2ef47e1f66241b932c6bc4462a017c2c3e66ee36ce98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/parse/syntax.rs:571-580 | src/parse/syntax.rs:584-593 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d807e5503f754c932513ae57373cc7e0b3b90856a512f246fb59a0ff6b29a63e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 3): demo_files/1/src/conflicts.rs:68-104 | demo_files/2/src/conflicts.rs:68-104 | src/conflicts.rs:80-116 \u2014 before extracting anything, compare \u0060demo_files/1/src/conflicts.rs\u0060 and \u0060demo_files/2/src/conflicts.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060demo_files/1/src/conflicts.rs:68\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/conflicts.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3a844e09cc2f05afedf82603f3137efd3bc1e4caccd1dd61725289eaab7278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): src/display/inline.rs:25-55 | src/display/side_by_side.rs:446-478 \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/display/inline.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4333fb43d5c6c7c1904df6042d6c6a603fdcb859e56b71d869b59a1e4017ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/diff/sliders.rs:517-536 | src/diff/sliders.rs:588-606 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/diff/sliders.rs:538\u0060 calls \u0060insert_deep_novel\u0060 and \u0060src/diff/sliders.rs:608\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc70b6ae04e43b10afbe19e0c2980ec45fef9b6ec286c340e190021026ea68a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): src/display/side_by_side.rs:663-682 | src/display/side_by_side.rs:684-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/display/side_by_side.rs:663\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c2a191572db41727bdc0e47a8dc3726e0d9f6da69fef4d921030860b08fe05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201317 lines \u00D7 5): src/parse/tree_sitter_parser.rs:485-490 | src/parse/tree_sitter_parser.rs:683-689 | src/parse/tree_sitter_parser.rs:952-968 | src/parse/tree_sitter_parser.rs:994-999 | src/parse/tree_sitter_parser.rs:1102-1107 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:485\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e4af8db0ff9ae1c5264c55a1a2fecbf523797e2cb05db27999bea536b220edc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/diff/graph.rs:693-709 | src/diff/graph.rs:760-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diff/graph.rs:693\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf6d9456236f0db37015751275222b175b34468b24b180436c2ba2855eb0e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/diff/sliders.rs:294-310 | src/diff/sliders.rs:326-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diff/sliders.rs:294\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c1a2c75da2a749a9109c11ff66b417bf14e681ef8041d85693575dd39134d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/diff/sliders.rs:394-409 | src/diff/sliders.rs:438-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diff/sliders.rs:394\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/diff/sliders.rs:390\u0060 calls \u0060Some\u0060, \u0060push\u0060 and \u0060src/diff/sliders.rs:437\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc4431a58ac2f4587dcb08f0c282bb1485b3f0d80397630d98696c53599f9a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/diff/unchanged.rs:410-425 | src/diff/unchanged.rs:440-455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diff/unchanged.rs:410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/unchanged.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"172e762a29ef7c9eb221acc87a2c55f743969858bf888305c691a2444914e6d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main.rs:170-184 | src/main.rs:193-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main.rs:170\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main.rs:208\u0060 calls \u0060print_as_dot\u0060 and \u0060src/main.rs:185\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"261d18c645a689163f8c63e75ee14c461a61d3f4fcb3b6cd4fae7040bfcc2e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): src/parse/tree_sitter_parser.rs:1902-1916 | src/parse/tree_sitter_parser.rs:1918-1931 | src/parse/tree_sitter_parser.rs:1932-1944 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:1902\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"c102d50ce94ddb1f7343ff4b27eec1be5be36f638a1fd91b0f0b2c87b35271c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): demo_files/1/src/conflicts.rs:51-64 | demo_files/2/src/conflicts.rs:51-64 | src/conflicts.rs:57-70 \u2014 before extracting anything, compare \u0060demo_files/1/src/conflicts.rs\u0060 and \u0060demo_files/2/src/conflicts.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060demo_files/1/src/conflicts.rs:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/conflicts.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3934c88927db6fcc4c5bad439f3e81c49febff6048bcdb83555138a4d77a9486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): demo_files/1/src/conflicts.rs:34-46 | demo_files/2/src/conflicts.rs:34-46 | src/conflicts.rs:34-46 \u2014 before extracting anything, compare \u0060demo_files/1/src/conflicts.rs\u0060 and \u0060demo_files/2/src/conflicts.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060demo_files/1/src/conflicts.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/conflicts.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"355432ae541089776db5e8ff413269b1ddebf47ebbce568f261c9c725d538e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/display/side_by_side.rs:355-367 | src/display/side_by_side.rs:369-381 \u2014 both copies are in the same file, so extract the block 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/display/side_by_side.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"560780eaeff7e9cd4daa55ce20c373561417dee7b0081295030ecb06e984f187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): demo_files/1/src/main.rs:382-392 | demo_files/2/src/main.rs:384-394 | src/display/json.rs:62-73 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060demo_files/1/src/main.rs:382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae0c8c35eb901dcf1f6f94dba703ed10a2e38c31073337ff733f4e4d136914e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/diff/changes.rs:63-74 | src/diff/changes.rs:75-86 \u2014 both copies are in the same file, so extract the block 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/diff/changes.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c6e16a5f789139adb41e8d9c46f584a5d16a88c32469e982e3b6f73a1a68c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/line_parser.rs:211-222 | src/line_parser.rs:252-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line_parser.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a10c642613efdb5ef087bf40510431d16f3c980b3854311d26776e9711bf1f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/main.rs:150-160 | src/main.rs:171-181 | src/main.rs:194-204 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main.rs:150\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc913141c7fec6936175fbc36197353553d5f229e53e4e5507fa62ba6ac4c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/diff/sliders.rs:366-377 | src/diff/sliders.rs:417-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diff/sliders.rs:366\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"024ecf3fafe7e3b5b5e1cdc8719e95e1988c6133f4934974ca29d4e3fb420725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/display/context.rs:39-49 | src/display/context.rs:54-64 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/display/context.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5d9e76adca9005a115f56ddbb613a57dcfc5868aff01b24318ef2d27195b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/display/side_by_side.rs:281-291 | src/display/side_by_side.rs:295-305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/display/side_by_side.rs:281\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab2d5741230446d3319d13b299b2528c3b5a40c96a5bbbc5ecb455cd7f01831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/line_parser.rs:180-189 | src/line_parser.rs:190-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line_parser.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c58f1502042530c99573d8007a00dc807798e71b6f229ef57d8607a4a5f68b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): src/parse/tree_sitter_parser.rs:442-448 | src/parse/tree_sitter_parser.rs:520-525 | src/parse/tree_sitter_parser.rs:881-889 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:442\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d32b8f4b3d415363d2134a69bd37ec49d286f590a12fdaca9ffa091c0541b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/display/context.rs:212-220 | src/display/context.rs:241-249 \u2014 both copies are in the same file, so extract the block 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/display/context.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21fce7881436ec0ab9953c4fe7ee2afb52a0b65c9bbe7e865756cc5ddf4d44d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/parse/tree_sitter_parser.rs:763-774 | src/parse/tree_sitter_parser.rs:1269-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:763\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc68ad93dad5ce06c3fedfb5da9740fa1ccb2b3daaf64677133a1434303b96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/parse/tree_sitter_parser.rs:800-808 | src/parse/tree_sitter_parser.rs:1255-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:800\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71698a422ea8c1cf2c1426f7d8a4be46ac5139a788cdab52b51867262876397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/display/side_by_side.rs:385-392 | src/display/side_by_side.rs:394-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"340ebbbede1bf9f9801c8d13a86472c324d17054027207da6a47b5960f43df99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/parse/syntax.rs:1067-1073 | src/parse/syntax.rs:1093-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/syntax.rs:1067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ceaeb0dc3868be671796478d9ac8d8c38351655dd7755b09ce7f53cb4fb09a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/diff/graph.rs:188-195 | src/diff/graph.rs:213-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/diff/graph.rs:188\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ae79a648f536faefc43640a9b10ad10e4d48022e85d6c5e00363dd2a4c0d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/parse/tree_sitter_parser.rs:855-860 | src/parse/tree_sitter_parser.rs:868-873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:855\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f978dc6caec7c56ce4c7644dd9216d788cb0b33165f7c596d2c36388f24cb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/display/hunks.rs:79-84 | src/display/hunks.rs:86-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/hunks.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"f851febfad27f7cc3c19be748d377760367685cf78f3186b1087ef1ba6304a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/parse/tree_sitter_parser.rs:221-229 | src/parse/tree_sitter_parser.rs:986-992 | src/parse/tree_sitter_parser.rs:1193-1215 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:221\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e53ae8e7a343b0f06c2e3b9c43dd4611587547c256f802716809c659c0dcea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 7): src/parse/tree_sitter_parser.rs:128-140 | src/parse/tree_sitter_parser.rs:287-305 | src/parse/tree_sitter_parser.rs:348-360 | src/parse/tree_sitter_parser.rs:537-554 | src/parse/tree_sitter_parser.rs:706-719 | src/parse/tree_sitter_parser.rs:751-761 | src/parse/tree_sitter_parser.rs:886-896 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"305fcb198e2840bebdcd230445f6e0ace51b7ad3b93067f833a884e6b0279eb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): src/parse/tree_sitter_parser.rs:412-418 | src/parse/tree_sitter_parser.rs:485-490 | src/parse/tree_sitter_parser.rs:683-689 | src/parse/tree_sitter_parser.rs:835-847 | src/parse/tree_sitter_parser.rs:952-967 | src/parse/tree_sitter_parser.rs:994-999 | src/parse/tree_sitter_parser.rs:1102-1107 | src/parse/tree_sitter_parser.rs:1143-1153 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/parse/tree_sitter_parser.rs:412\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f0f40ebf654f0fe139647a6c563d7531230db095b5a86d143b52b159454b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/options.rs:744-748 | src/options.rs:756-760 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/options.rs:744\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6272f94e3acfe136e4ffe2f8f635781ddee6d28a2014930b31315eac9fa35b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (128 corresponding lines): demo_files/1/src/main.rs:208-335 | demo_files/2/src/main.rs:208-337 \u2014 These two members are one piece of code written twice and then edited apart: 128 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"339483976f5d2ff333a5a06978c1d05d2beb2db169c54a6e5251e5792ea00662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): demo_files/1/src/main.rs:197-200 | demo_files/2/src/main.rs:197-200 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf492a56a8c33167309a78fd98048415981a9a09dadcac6ab4ae72e8e54ca9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (101 lines \u00D7 2): demo_files/1/src/main.rs:87-187 | demo_files/2/src/main.rs:87-187 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4c47caf5829ac8bdbc0ecc996f1366b39245f9936cf794fb0146c0f4d5b8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (85\u201387 lines \u00D7 2): demo_files/1/src/main.rs:251-335 | demo_files/2/src/main.rs:251-337 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060demo_files/1/src/main.rs:251\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e82f159c19c0c2c40a7c4ecbf74693cb87c69e44ef736dd6057150385a962c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (84 lines \u00D7 2): demo_files/1/src/main.rs:384-467 | demo_files/2/src/main.rs:386-469 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060demo_files/1/src/main.rs:384\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"992f9e611de1507ca4241e428e2b816a1b83e15bdff11b66ffc46fbfdc4c372d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): demo_files/1/src/conflicts.rs:40-84 | demo_files/2/src/conflicts.rs:40-84 \u2014 before extracting anything, compare \u0060demo_files/1/src/conflicts.rs\u0060 and \u0060demo_files/2/src/conflicts.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 109 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/conflicts.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f81227abedd9dba33b9fe16187ba708d34b7afd965d29fa7dd602772317dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): demo_files/1/src/main.rs:209-248 | demo_files/2/src/main.rs:209-248 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"84378fc0463e25ef30be60ff5d00ecba29cc9a6e24d34a1410cd64ef6ffe7d71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): demo_files/1/src/main.rs:350-370 | demo_files/2/src/main.rs:352-372 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73419755a64ef15a0f7b18b1b6d71afd239bbc52afaddadf3eec5cf8e1f4a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): demo_files/1/src/main.rs:470-482 | demo_files/2/src/main.rs:472-484 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1a3806cdde14a8f2b3781944058d106d13deb5391799b15e822ca48b77f047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): demo_files/1/src/main.rs:484-490 | demo_files/2/src/main.rs:486-492 \u2014 before extracting anything, compare \u0060demo_files/1/src/main.rs\u0060 and \u0060demo_files/2/src/main.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 365 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c61984aa9d2ef8b8675616ef28e2c5072fb67ac6034daafbda74bf7fe67386d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/inline.rs: 0.0% line coverage (0/128)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe742a180edafa89660e68bd0cc3a31208ed23513938de9393b22fed2ed616e"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/json.rs: 0.0% line coverage (0/197)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/json.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"198e6d8491d59676f9a2071cccbbc53dcfd8007291ab01e67c30a9d0851c5d95"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/display/style.rs: 44.8% line coverage (160/357)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e824bd02897c1972615e4768e1866ad035b4940d118c99555bcf0f1cc5a4197"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/files.rs: 34.0% line coverage (69/203)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a989bcec827eb79b82237129f97bbac17f4b7b1c05f809ddc74b6086cc9bca9b"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/main.rs: 4.7% line coverage (31/657)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdff9871993161b3fe91ef031e1f1992065b989809cdb5528904d3cc9896338"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/options.rs: 36.4% line coverage (240/660)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25254c9c3b31a6540382ebce1a659b97706a335fa4adbd41b302658d13af7651"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/summary.rs: 28.6% line coverage (4/14)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/summary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3926b1aed9b6c312f283943bd12bbca10b2fc848ed0c938e744369cdab372736"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/parse/guess_language.rs: src/parse/guess_language.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in difftastic::parse::guess_language::from_shebang at line 576. 2 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-06..2026-11-04, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-06 01:58:22 -08:00\u0027 --until=\u00272026-11-04 01:58:22 -08:00\u0027 --full-history --no-merges -- src/parse/guess_language.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/parse/guess_language.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"de82d728dd9540b8d8e360f95a09ea6459ac948c52ea99fb20af4d33ecc86236"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 8 significant file(s) lose their only recent owner: src/parse/syntax.rs, src/display/hunks.rs, src/display/context.rs, src/diff/unchanged.rs, src/diff/sliders.rs, src/line_parser.rs, src/words.rs, src/diff/changes.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a38c24170f890954a826e41bb90793f05a2e36a8ee12d7802c57335ba5a4b792"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If either side is \u0022\u0022, don\u0027t split each line by words \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/line_parser.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a6d6bda20dcb59328529c0d142bb14eeaa47d5804be1eec03921045309dd05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Fix this pedantic case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4cd3ef780fe1e0a6495c5af0f064abd0941eae353ff4aa272a360974d2f8e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: where does git document these 9 arguments? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbcb7a5a4397fe1237d5be53c7bcc256684aea9b1172e98a6b9c9745087ecfcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider following the env parsing logic in git_config_bool \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61ae72081cbf1a8274b8796fcb9d60e454a74aef1ad50772549c94a616a509f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should either have a AtomWithWords(HighlightKind) or a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ec8c52d73c4b79e527a37891eb85189b8e5f7116818368316bfa16550a74a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: merge adjacent single-line comments unless there are \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e53eeddb13e8d3a572f2aa237f7c1c77343d2c9f142aa7139486a916fae5c15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t assume a single line atom. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a740f81d83115099b1d13814568b3625fef9858aa8e2118bf9d90c7f2be394"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t assume this atom is on a single line. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/syntax.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae1cc845999607a1e9430423001f1fb38b7c94f220c787702ae85fed1b6d843"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: define a proper type instead of an alias. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"702ec21ccd4d96c7e5e6c76d3fa3245a2a2d46834e181cf1fe20f0a7eb43663a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: begin/end and object/end. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72380cb41a592d159dde650688b233062d54df3be06e2fbcbcaf8c526a0823d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: our syntax highlighting logic should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ead1250ace6c369473a8d3872f243885cc3f1d73791c2cd1e8250cd61f3611"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: why doesn\u0027t tree_sitter_ocaml::HIGHLIGHTS_QUERY work here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"2382493f365a199e6b2c2f708113ce7eee1c69ad1de0e70fb6f9fad4593ab948"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this doesn\u0027t capture (type_ref) in Elm as that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7237b49beaa65111c359aea1db58f2a26ff17c5bad64a56ed6ec8591363faf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should probably only allow the delimiters to be the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"7358ecf7bde19e4440740f7589a2365c3d4ea7751eb6ff385ddf13215dea16b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: match the exact trimming behaviour used in React. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/parse/tree_sitter_parser.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"b102cd09de1a89e6ab0d34cb07eff1516952c7184c90811950d774f6672c442c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It would be simpler to do one loop over all \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/context.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb8796bf1119fab5dcb4bba42d62414403a76eae635f9595d4bc6b95b148b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use binary search instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/hunks.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45b8b145a9b252046701c270b24115fa3f352c1a667320578c40df71c3d4a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: move into function as it effectively duplicates the hunk computation in main::diff_file_content. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/json.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ff7c7e33e99e3d519b00633dbd2d700222391f17dfcbfadbbd8a3fa4ef22ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use syntax::TokenKind and syntax::AtomKind instead of this merged enum, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/json.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"75336aebf9c151669780c27eb1de6c4c87db67b8a88ae8a1a79d1228b86be747"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is largely duplicating the \u0060apply_colors\u0060 logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/side_by_side.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e7688b5c32f8c1a00c80da591e2dc7ecfadf45d6b56d7a4f276ce39d510e0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this is inconsistent with print_warning regarding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/display/style.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd04998a78cba18187a55961a0d9cd3360893352c07d0a64981cd7658d093252"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: experiment with storing SyntaxId only, and have a HashMap \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb710c21ee7b56fe47ff20a52a4e25f49702e7634948a811aaa6f81d10d09f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: An EnterNovelDelimiterBoth edge might help performance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e0346449006cc47bd957cb6a5cf306fab6a52cafb30ee036141e3ea04ad66e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Perhaps prefer matching longer strings? It\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/graph.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3c755f322d532132f13c62da1cda258db401f09918fcb0380f01da8f977513"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix sliders that require more than two steps. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/diff/sliders.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a0c4677398b3fae91dc922821fbf30425d51be6ba4a6ff8369fcb78f6cad81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t replace tab characters inside string literals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/src/main.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a17b1f472354f63cccf7a9b96a7158612205249ee6593eb06b04dcab9c7eb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: don\u0027t replace tab characters inside string literals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b680fad279e09ceb5f1ce171687941f231a2c23d69e95b4792e862c54aeaa45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: highlight if this has changes (#144)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/src/main.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e2d090721b3fdf0f24f3fedf6194365fc4fdc28f6e92ad9caca78ba88eb583"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: highlight if this has changes (#144)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a725aa481957f5d7aae44cc0e8fcd2d5715a4f0825a03f19a46f2e3d6b76d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: factor out a string cleaning function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/src/main.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f58bb6e68be1143ab79d1f929b57122187b8dc96f4e4e47b3d00818c269cbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: factor out a string cleaning function. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0c8be7762bc3d6f184d7516b14939173545b8bc80563cb8f58c42db76be856"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: take a Path directly instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/src/main.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7830103341b0b8510453679f771fdfcebaa3e1319571d178cb36c601c4d5af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: take a Path directly instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc67995d96fe37844736110c8652bcb73ac8515dd945ce619e18a30619c7228"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: factor out a DiffOptions struct. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/src/main.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d714ccdd2ecbfd47e8f4e128f512fa506a2b88676514a9eb6af02bd5f910a2b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: factor out a DiffOptions struct. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7869234dc3c8ca1bd4d30802c74a932d1508ebf26766e5e7821f930c60517587"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there are other Text names now, so \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/src/main.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"58941fdf540c8b0efedfd9147c3a212ad6d15ffef6185373f8d0e42635e2f928"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there are other Text names now, so \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/src/main.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"46154c9d600b890921aa28d53edc08a6e4ee744bf9985658bb608e316aa3c6d9"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 160)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0acac9806012a2c8f144fc7887c8e314e9a97ddb7f54df090b86aa6bf4d83802"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e2fa2ef684ed4bf05fb05da9d0394cbbb42223748cff30dbd982359fcc02077"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd27dceeb3c11c16551599a0f2c1996d7eb5e54cd0b8edd396929464c7c3e1da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb57800e5e67cd6a407d1137ea9c88c3de0da746dd6701fc5360f7fb1018a556"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e093c3b10382aac1c654d59f316cf1c0b3df83f87878638e9f199ab9ac035ac2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b7b8881b51a144158d3374968515735686b7ae5e431ec06dfafa46d8f016021b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"494d9103b7df37de6517ce64920bb362cf743db94dfea97bc2340a337377eb03"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7aa2ac153c37d96fb69302757f288ae051ed22ed6fd331a5bb509f82a54427e7"},"properties":{"dependency":{"package":"tar-fs","version":"2.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: build.rs \u2194 tree_sitter_parser.rs: \u0060build.rs\u0060 and \u0060src/parse/tree_sitter_parser.rs\u0060 change together 57% of the time (69 of the 121 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 69 shared commits counted here, the most recent 3 are \u0060def82962\u0060 Remove Elvish support; \u00601bbcb200\u0060 Unvendor tree-sitter-newick; \u006013f786a7\u0060 Vendor the commonlisp parser again \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"build.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a0f8cdab63b36179f0ba31f231b747853e17bac050fe0244eb2bdb90e56f5b"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.85: rust-toolchain.toml declares Rust 1.85 as this project\u0027s toolchain file, and Rust 1.85, superseded by 1.86 on 2025-04-03 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-04-03 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd5f6e731eae578f9af8e76db13b841abc4e7d5b44de65e5edffdc8d5db06a0"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"567b47a0e791a8a4f47e5934807f3d2643ea4931191ff14c0d07f1d0c58aafa5"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfd2acb43bb832491cea47233dc72cf8a18d83b9d9fc97965473fe598ebce41"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0055c718ee15eded3aed69cd73cdaee39e63dd21b643ea1c3dd97471f7ee709f"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c85d2dd45f199f94cae6b1aa00092159b8927ac259f7d9ebb31461055b38c4d"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"acad91bd9a506dd60dc85fc8f184422462a51e3b936b3363b7827d2c635b48d7"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfa5c7bb6d832faa5a04b15ee4b4f6faff7aa94009daa3cacdeb678337b3f92"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"39957c7f513714989320771a31dcae836bb69b1957655ba98ebf6ed02523f6f1"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c163e4493816908d2599da53ce2b1d5fece17fbf60393fe7acee0dbae418a089"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74dc145b916bc08696683fa0274f174e574f264aa2d95ed46637e34a3b3330a"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce7c4214e88ddf91e1c12c9cb8e9887d34935733631b3c0fd754458362d74e8"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedbf94d1699e7719253c42793c20aae265ffaac84f5a2e46b60d270586ffe5e"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba2e5ea37e072f1e61a0591b93fbaf9225a1c0b0db65d1eb3bb3347b31dfcd8"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"050bb081053605ecde897d07f91c44044d9af290c7b5dcccdb8ecd81ab565412"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"42438118475b24173d23bb84eb4e471d92b3a9affc7e27e61c1e0881f8810ab9"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"a583d5b110dc08475ed9cb2e6674357aa622a2c3ab03c87186f8416b9218b9c9"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd56709a47c5e241912256482fd19d5d1235f791e204987d35de9b0c33011af"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"420368e0316e869b3bb1d8801b38968d80c1f2775087f31043d1c95926d014e4"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7742a30cbde5aa861ca2f484d5ae72f1f65f13088239293e23e771b4f2de099f"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1e6765bdf15520b48b0a3a739dd411cef370248f201a0461db30658f2b21c1"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dd926b51fdceace346eac08eb8681ad426a420bedf82b0f324112afed56d39"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"febbde4d858569d698bf251eab3e413c1cf71d64eb0dce0b92f16a4ddac2bfb5"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8554f7b26d49f2cbdd859b48506468a10fedbcf8670c2e4fa826262cbfc1938"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b509015865a325ea8467d5d76af31aaa77d1aef0bf255566de49ff250510c9ba"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"da764c2f707cf934455393fd19a7b71364f5b4fc81540e57896780284c9b40c6"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0f4de730ea0663fe3d9ce4bd8ca0ac3742270a79b8274c5ddca9dcd7f8b62c"}},{"ruleId":"AC1","level":"error","message":{"text":"\u003Cimg\u003E without a text alternative: An image with no alt (and no aria-label/aria-labelledby) is unreadable to assistive tech. Add alt \u2014 alt=\u0022\u0022 if it\u0027s purely decorative."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d80b30b3482a360a0395c805ba7c9fd48ee34adb1a6a2d51b8e76357065fae"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aec9ea4d6bd6c08dab22f28f86fd454ba02c7d126b86d955bd84789233eb04c"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4636e65252292d7b1819fe946e4e4517acfdd08f756ba61e2fc59155866534f"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf26f359f5398d3e86c2ee9139fb8195294439082966400c147a997236bb6fe1"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9787b7ce89544f520e36bb420ce9d8f84c3f22a31b8a0c1fc662d473c509f694"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"297a39c7f6d9350d5c8bdaf6140421f25a08af452e5f1116a61c62649b00b915"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b882e6b0baf2c04870ab7904627c4b07f9dd736088bbac84a5a5c636aa332a2"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ace56921a60e7b389f90d7466892afec7c462d874eb9b3073365e550bae5e6"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"412e009d9ee9463a545605c8de4d8761887f85b05eeb8edf47284f0692273789"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ed58c8512b01be5fdfc499ae7ff698c03e6d4b4ee13628d33b2ade29eb236"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea0b57253629352c0b471681ed146dcdd8675b3267b978dd763923f48ad9299"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6275d9af54117b20e43146624a7707620556b515f129796a6190647d79c4f106"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6fdbebb71a2c86bb2f5775d48bae56be8b33ddd7c6ce7c4a5661bc65223a81"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8bda82a6303af437347943fe66d2283cd1769912f361a1f35357008abb479e"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"674a3ce3ed942290dce12ef6dc1e05230d6b9bd0bce68f4ac269f5c3a330ed03"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"484411679e28a000f9ed367115bb224a5bab401e82ffdd7fa3e38d6dfd025e58"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5a582c6acc77614f1f270eaba305cf18694d6fec51c94470dbff312c0b1ced"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bea6d6045bd96f383c952ca4e7b9568a7d86b1feaaae2388a52bf8f6e3746c"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"15946019bf895d0224bc236ca76ee5ec65c2d48553ade046d46599f90012c907"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b249603f33e90782bdfe9cd8ce8ee0036d1eb5899fa2cedc19cd269436b3a269"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b397c4efe97cee5f33d94757c9e34c2d25a70c5ab0f3240af71b29b02a8349"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d701b08c3e05052e0d95403abfa35e6b9b3829c7a478e67156f7131cd83493"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6684aa12679f6271814aabfde6a6493d7b4b2a223573742201064762871a59"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"66782d2899ead615ba9171f779f0288b923c3bc9431ea0d2fb9677197e372206"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6009ce7c757cd9e9c4606990f7f3af2e5b053af52822d74638d8091401cd7b8"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4218b49a8c58b5a5329c7f6d01c09a0a923871365d3eda45fb4d0df45ab060"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a910958e1172da56d0433071c6a039563fcc614a8a63aea103da2b8b22e0eb6"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e0e428298f98f9513bc4e84a5cd9e5d8be25edddc2704ec800562aa039e0d1"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd492c4d0474751565abd9df305cfb307bddf5a49adfb2b9f1b8916f6e8a518f"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9b078906ec9e1d014add4cde5462fb7116631ccd0cde7b695c9f3a7f739222"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5c212968fb4ca95776a793f951457726168f108a6fae6faff058090e16be14"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"308e4effa72fd95903977ce365ed274e3c2e7aba1949aed130a10c3a0a3486a9"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1dd90f3203d058a727295c671ddb16e9f9aabc98399a86f46160c659b852e5"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"10325a2622c2b2d7e3b3ea3667fd0eb6603eb66fa8b93384ea8f0c88fa5af136"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47ba26b07da4c32565b0f87d989841535926781e82871b689eed6ee9c732614"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"17788a93e45030ce6b1a9d9e7a0e40718403603c8b60d9c4898bcfefab225198"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea55bcf23a9318d53390b8025318e81fb3910e83217415e7d93bdb0027182b9"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6420aa414461b3a17ecf34e970020db1c1979377ea8d9d9caebfeff1652ad60"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bc80a95c4ded760815164302e4bdf1039d4cbbec6f5847e7d25a291e1d5ae9"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fad9b989eafe0765ea4ee946de2eaf3949b37c0812b7acb8920f1a20bcfd499"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ff1973b1fea1dd5de022d520d13697a32d482f3a50c842e372bec83e36398c"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a438d5bb15622d5c6be1c8b8ca579784249f453aa31310ebc5e6990bc7606c8e"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"134c7992fc7468d18176f02828d17aca4b6abc952c5f3365c72de14ae1ecd580"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f094223c14d8f07ffa20eb42e3dde325da3dcb2cfebe575963abe8351ad5363"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"64901e6c561f9285e27c94484e8604bf1a308291f1de3c88dd1ccf61824b0225"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"11221411dc9d7729c479266506e2231ae617c353b8bb613757bd7dd688fea8a6"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"774bec694872f44c7e874518156a6580f92b4684c48de5a408f655688047d6da"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ed680539ca1ee4f44807980069a342c5b26691c17dabfb1e03c815bb8dda83"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"82023699826bcc09aba731fe18cd9549671530ca20185bccc2b7eea67bea9271"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cobject\u003E without a text alternative: A \u003Cobject\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"857b9a5df27adabea0d0671d67edf356115b1ad52384ef3e410f7b38201f4e24"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/1/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"103f49419b1f8c47dac474a2247307b121899577fd85c639ec7ac3a29ae0dc25"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demo_files/2/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48cd04eb04cd4914e16cda27a042106265572142752c7a0b209f9d7c9eaa50c"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6cf7aa53146cea1e1145618ed69a8bcacd91da8ddbca01c81d4995ded92d3b"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_1.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"62294c3c9e1cb41650f77d5bc64cfa8be6a030d2403d4d06075d0871024e89fd"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_1.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4cae715c7c5a620663683a6e024e1b07356e00d2e1db383b2052cacf32c063"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_2.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"11444229d675bae4c46f2c235d647b02beb9d8a32ada0baeed736fc50b073d0a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_2.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb26c08057cd5434bdb32382950373eeca2ae83dbb975f42c4ff1e68a402da08"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_simple_1.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"321de0968784f06acb0d81c0e626acb5775aff4092399d1b4c09efddaa914982"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_simple_1.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"512c5d729ac5f9e547600638aa5e01085635d3d831d6d0a62f24c62ed366af71"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_simple_2.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01df2bd85d2219d394f02a72bb4ca49ccaf896dbcf50e45fb72134689b6414db"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sample_files/html_simple_2.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b2cb67717c3c8ff0819957c61fea3e9a91e344862776d27bf4c1cb1095fc28"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.1:1): \u0060.asciinema-theme-solarized-light pre.ap-terminal\u0060 sets color: #657b83 on background-color: #fdf6e3 \u2014 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/home_static/asciinema-player.css"},"region":{"startLine":2585}}}],"partialFingerprints":{"codehealthFindingId/v1":"314b1258bfce783772f4d9bab254a835e9356fbd7845889f991dfa4f4ea42ca4"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060div.ap-wrapper\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/home_static/asciinema-player.css"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"67717c329f11f7ed6a86a569ee1dfcdd789161542426a203f0088013d1f30b1e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060div.ap-wrapper .title-bar\u0060 moves (\u0060transition: top 0.15s linear\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/home_static/asciinema-player.css"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf3248c1eeacd634f68b6a41169aeca19f0ef1d2e6041d0c464b349c584f870"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060span.ap-marker-container span.ap-marker\u0060 moves (\u0060transition: top 0.1s, bottom 0.1s, left 0.1s, right 0.1s, background-color 0.1s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/home_static/asciinema-player.css"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbd770d74375dc782139850298c1001e5f16e0eecc60fe8e964adc47e67e701"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.ap-player .ap-overlay-loading .ap-loader\u0060 moves (\u0060animation: ap-loader-rotation 1s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"homepage/home_static/asciinema-player.css"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cedb3e265157515b0db3e34ab04aeb45d94a00ff78cf0dae371914a3e9f3523"}},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip: \u0060vendored_parsers/tree-sitter-latex/.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entry to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendored_parsers/tree-sitter-latex/.github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e04c5b001e791314cb0f6687fc2b4b8bc030f7ab45b7f54abbdade29bf5ae5d"}},{"ruleId":"P4","level":"warning","message":{"text":"No deployment automation: No release automation was found in CI \u2014 neither a deploy stage (Helm/Kubernetes/compose manifests, an orchestrated rollout) nor a publish job that ships the built artifact. Releases appear to be run by hand, which is slower, less repeatable and harder to reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a7f38718309412c2d2c2c0663260a3d160de9a5a60f3915755be16386d3f1e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(C =:= $/) orelse (C =:= $\\s) orelse (C =:= $?) orelse (C =:= $#)\u0060 appears character-identically in 2 files \u2014 sample_files/erlang_1.erl, sample_files/erlang_2.erl. 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":"sample_files/erlang_1.erl"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a0054ba5e63366b3cfb331eea9689ca7abb40107e9f9ded19837a36b23ed79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(await prettier.check(input, options)) \u0026\u0026 !context.argv.write\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"902e974774355ad5a8126f2016c38777b557dd23405be511d2bdfd138540405f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!context.argv.check \u0026\u0026 !context.argv.listDifferent\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb00721308c90390d2f6a13dfdab4d522607c0b1ab0b57f2f350edca519da93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(await prettier.formatWithCursor(input, opt)).comments || []\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3182dd16e52fdfefc90f1538ac1835e854a592b74947047bb8139b8589b641"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(context.argv.check || context.argv.listDifferent) \u0026\u0026 numberOfUnformattedFilesFound \u003E 0 \u0026\u0026 !process.exitCode \u0026\u0026 !context.argv.write\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3195fe2ed392db9de74dc71c47e8951e186a6ef27daf4f7c89cc5ee86095abf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(context.argv.write || ignoreUnknown) \u0026\u0026 errorIsUndefinedParseError\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0cff735e72abe444b9b851352ad96d1670cb5e9b0f177b30315239156dc099"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ast.length \u003E MAX_AST_SIZE || past.length \u003E MAX_AST_SIZE\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5eddd00910e6d77e82316e45260cb816f00a48640bad108b940b1baa083a378"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060context.argv.check \u0026\u0026 !performanceTestFlag\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab94b248df947718dca35d4eecf314a173b33dabf8c898bafeb7df3ec751172"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isFileIgnored \u0026\u0026 (context.argv.debugCheck || context.argv.write || context.argv.check || context.argv.listDifferent)\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"9275bd9f66eca9a43f4bb5615a0da7b99fa3482381f5e9bff8f6a80662e421ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isValidationError || error instanceof errors.ConfigError\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/cli/format.js, demo_files/2/src/cli/format.js. 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":"demo_files/1/src/cli/format.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a204a143cb472ca3a917ff746e5283ac545b70b013b8c06d02bf866509c363d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.startTime \u003C session.endTime \u0026\u0026 this.endTime \u003E session.startTime\u0060 appears character-identically in 2 files \u2014 sample_files/Session_1.kt, sample_files/Session_2.kt. 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":"sample_files/Session_1.kt"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4709d9f102d0c7cb2bd271aeead82bae91e4783c51dc5eab6e65d8d98d5ccbdd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060is_probably_binary(lhs_bytes) || is_probably_binary(rhs_bytes)\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/main.rs, demo_files/2/src/main.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":"demo_files/1/src/main.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb40702a3d43798cb9fc553b119a69f48738836dd7e4f9877243cdc73ddb8822"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lang_name == \u0022Text\u0022 || summary.lhs_src == summary.rhs_src\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/main.rs, demo_files/2/src/main.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":"demo_files/1/src/main.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787b5d82894f6c92b4545e20a67bef404ce17dee5502e6f461d614b39d05e8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_bytes.len() \u003E byte_limit || rhs_bytes.len() \u003E byte_limit\u0060 appears character-identically in 2 files \u2014 demo_files/1/src/main.rs, demo_files/2/src/main.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":"demo_files/1/src/main.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7159675fd6bfe34b8ac64743222fb89e578a3e5904d16989e777f46a94c7b800"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_open_content == rhs_open_content \u0026\u0026 lhs_close_content == rhs_close_content\u0060 appears character-identically in 3 files \u2014 sample_files/slow_1.rs, sample_files/slow_2.rs, src/diff/graph.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":"sample_files/slow_1.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bff5cd9b186ba2fc6570fc5cbe251ce12f9315a113911ff093e2464ce95639d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.lhs_syntax.is_none() \u0026\u0026 self.rhs_syntax.is_none()\u0060 appears character-identically in 2 files \u2014 sample_files/slow_1.rs, sample_files/slow_2.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":"sample_files/slow_1.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6a8cd3f67d17d7d5f275908547136ca96656b1b8789b03f92fd06379f65202"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":12,"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."]}]}