{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01: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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"component-review._n::H (cyclomatic 265): component-review._n::H has cyclomatic complexity 265 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bc68376a94c8f6ddda3741779d646fb4d5b0beedd4471029beb2360e6a8cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"review.mountComponentReview.render (cyclomatic 248): review.mountComponentReview.render has cyclomatic complexity 248 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (review.mountComponentReview.render::resizePreview) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ac675d6666e1b39872744e13c912389f945129b71406d12393ea59cc8a8b98"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::check_quality (cyclomatic 207): impeccable_core::browser::quality::check_quality has cyclomatic complexity 207 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f60db5c671c0cee0a24c88e6ad4bb7fdf157c4d7fee91f216909e6d7a963053"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::serve_question::run (cyclomatic 162): impeccable_context::serve_question::run has cyclomatic complexity 162 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0222490945a1a32dde59a8203de337e596676dda9d8210838fbc6f12a67736"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_text_occlusion_dom (cyclomatic 143): impeccable_core::browser::page_checks::check_text_occlusion_dom has cyclomatic complexity 143 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fe4266c7109c8cd8fa9ca9a613d26137d792e5814c4e3759be6288fefc1049"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_hero_inner (cyclomatic 116): impeccable_comp_verbs::build_phase::gate_hero_inner has cyclomatic complexity 116 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"684bff0d0d6e9498b99810d94348e6a8a89e8fb7a69b947403eb58bcd57f2ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_colors_dom_in (cyclomatic 109): impeccable_core::browser::element_checks::check_element_colors_dom_in has cyclomatic complexity 109 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70ceaf1fc41308ca96b178c37c6ee1da5e46b7386aca4cfef8301ae2edc695d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::quality::check_quality (cyclomatic 95): impeccable_html::quality::check_quality has cyclomatic complexity 95 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed44d08834b360ff51a4ecb5ce7bfa4af85568c7d633018b93847dea6131f147"}},{"ruleId":"D1","level":"warning","message":{"text":"capture (cyclomatic 94): capture has cyclomatic complexity 94 (threshold 15). Of this number, 92 points are the body\u0027s own statements and 2 belong to 5 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b6ae590982c42ef994bf19b0f16500a8d9ebf89cf382453327c720552722a1"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::run_with_renderer (cyclomatic 88): impeccable_comp_verbs::build_phase::run_with_renderer has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"945f1ea09d972950db5faefd385d3bdc1bbcde29fe2b6348341e9714c9db3642"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::regex_matchers::scan_markup_context (cyclomatic 88): impeccable_detect::regex_matchers::scan_markup_context has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dea64c3baf260c9512e9f5cb984aefd68e278863d22de99927b0af02db46d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerState::page (cyclomatic 85): ServerState::page has cyclomatic complexity 85 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f622e7f254748271d8b057815a0e9a53db080eced338aaec1eb0b35f9a66db"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::cli::detect_cli (cyclomatic 85): impeccable_detect::cli::detect_cli has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2016d87ea176accb35b0dcaa024399485aebbf0803907730d57915b260dfef6d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::session::apply_event (cyclomatic 82): impeccable_live::session::apply_event has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1960c23b969b1b895e8d77b247db90cd2f4e0f82950ea582918477aa4a87c3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::hook::run_hook (cyclomatic 78): impeccable_hook::hook::run_hook has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f86476f4a8e32a42cab479fa60df41bcbfd8e245188b3dd99d0cc01db4c71c"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.connectSSE (cyclomatic 77): live-browser.connectSSE has cyclomatic complexity 77 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 55 belong to 4 function literals inside it that branch. 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":"skill/scripts/live-browser.js"},"region":{"startLine":7806}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b6e861b9974760adfaa7b66e15cc63f8b1095a193918a8cb14b0f97b25aacb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_heading_rhythm_dom (cyclomatic 75): impeccable_core::browser::page_checks::check_heading_rhythm_dom has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"293e7f9b26ab0c9dea0b599b3cce88e7b9888de43297762007e65fe262d6de7b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::component_review::manifest::freeze (cyclomatic 74): impeccable_context::component_review::manifest::freeze has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/manifest.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d30d7fcfa9dab8b17399e9d057a405594685233d3d2ea0a398993037379c5e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::hook::run_stop_hook (cyclomatic 73): impeccable_hook::hook::run_stop_hook has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01767bb6d1e2c7b7fc0dea3399ad7ebcbf555f812b1ac6fe189bf58927e5767"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::measure (cyclomatic 72): impeccable_comp::font_fingerprint::measure has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fcdb5af8b559849209d6344cb44f9d00f7e0acf6d4ad9a3dcc39a5a53d6ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_generate::run (cyclomatic 70): impeccable_live::live_generate::run has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"191abe7635e98968981180e8d36d90e0cc912c255e65223eefa04bdf7ae6d9e6"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.handleKeyDown (cyclomatic 70): live-browser.handleKeyDown has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8379}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a977a974a44c6d31f9df4f466a7732e9b1e12ce3474c258fcb82d9a651a3ba8"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.resumeSession (cyclomatic 69): live-browser.resumeSession has cyclomatic complexity 69 (threshold 15). Of this number, 64 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1b288286d736963437563c66c72022ba28af44b2ae44e48e730e97e99430d7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::strip_js_comments (cyclomatic 68): impeccable_detect::detect_text::strip_js_comments has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6559fd617cf951449ced53a0e315e6a0552b6e3d80d6b1eb4e28a1cf5c566bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::cascade::csstree::tokenizer::tokenize (cyclomatic 65): impeccable_html::cascade::csstree::tokenizer::tokenize has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/tokenizer.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"41cbb74a1b182aff303c1d3d53de8ccba82e0836249f2fcd23ecb12aca966033"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 64): (anonymous) has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/raster_coverage.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d970ca637d3ba773ba955a22507c5668620236c314f2267ccf0bf1f0447064"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::concept_seed::render_roll (cyclomatic 61): impeccable_context::concept_seed::render_roll has cyclomatic complexity 61 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef06f9c8a059ad70a0cd15eda4fe7e79a33679a39f4aa91b929cfefa02dc6354"}},{"ruleId":"D1","level":"warning","message":{"text":"Page::on_event (cyclomatic 56): Page::on_event has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8a0a089f39959976e2dbdd78b880baf1465b60397b027f3161fbd3c836bda"}},{"ruleId":"D1","level":"warning","message":{"text":"component-review.Xn::ot (cyclomatic 56): component-review.Xn::ot has cyclomatic complexity 56 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 3 other methods here (component-review.Xn::Dt, component-review.Xn::Ht, component-review.Xn::ct) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de7f35852026b77c72ac7ec39a220e1cbb21a251f071fead96707c92779d605"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-review.mountPlanReview.onKey (cyclomatic 56): plan-review.mountPlanReview.onKey has cyclomatic complexity 56 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df1b73fa25efe2a5dac3773aa957df1da0acc83e40589f1ae46a977c2028c83"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::catalog::validate_concept_catalog (cyclomatic 55): impeccable_context::catalog::validate_concept_catalog has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/catalog.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c05944b788831bcc60473033aa6035ef3930e9eea33c8a5cef2cb488dd54898"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::painted::unpainted_walk (cyclomatic 55): impeccable_core::browser::painted::unpainted_walk has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faba150aca6b78ff23cda40c70e9a1bdf557601ddfc218ac056c49b6194436f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::router::run (cyclomatic 53): impeccable::router::run has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/router.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c318c4fd4133a74d6b0a00424b4266b8b69fe1548274fdd80ec1beb939ea483"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::css_scan::path_is_rounded_rectangle (cyclomatic 53): impeccable_core::checks::css_scan::path_is_rounded_rectangle has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d9d78c63147bbad1e9b37b6213cec36b871fef4d8b307d8038a1537ab8aec6"}},{"ruleId":"D1","level":"warning","message":{"text":"Generator::node (cyclomatic 52): Generator::node has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/generator.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6323cec01e0dd9f60323ae89f2df279403cf50c376b06559dde1ded6f9953b18"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::engine::detect_html_source (cyclomatic 52): impeccable_html::engine::detect_html_source has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/engine.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadfda2f06cf0788d441a3edddc146d4b2f019df1edf2ba94aae80cfa6030527"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::analyze_node (cyclomatic 52): impeccable_live::svelte_ast::analyze_node has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b191cc1fe1d6f0d69576e4434ae33053fa54d0085a115c2e8cdf30527d74bac2"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_server::handle_poll_post (cyclomatic 51): impeccable_live::live_server::handle_poll_post has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"d646ae10d9f09031bb10720764bd07f50ca35118564d02f5b1e0a16e6fa60ddf"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.injectSvelteComponentsFromManifest (cyclomatic 50): live-browser.injectSvelteComponentsFromManifest has cyclomatic complexity 50 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6052}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5708649e81f98f297537a0336bf62913bb3c3737162fc0e29192d71cbde708d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_server::handle_connection (cyclomatic 47): impeccable_live::live_server::handle_connection has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e80618e82cfb480622b00d5d2e25233dd34d2d36a5660ed29bd4b39502540b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::unpainted_root_reads_light (cyclomatic 46): impeccable_core::browser::page_checks::unpainted_root_reads_light has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d203217b948878c273e9ade1a3f8ad06e2a7a86fb6eb8311254afec87c86b98"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::fdlibm_trig::kernel_rem_pio2 (cyclomatic 46): impeccable_foundation::fdlibm_trig::kernel_rem_pio2 has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2d1a6d3ca287dfba6114b0353d0b82da9acdfd532038b83169b0c2833f1631"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::painted::mask_alpha_at (cyclomatic 45): impeccable_core::browser::painted::mask_alpha_at has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ed30614c7a02f7ce8d9129df86952d869a6fd22c7a402579006d5cc7dee29c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_pseudo_stripe (cyclomatic 45): impeccable_core::checks::css_scan::scan_css_text_for_pseudo_stripe has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6483a9054b72583691a5e46730cf24166417bf605ac297ed6f87b7181912a89"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_wrap::wrap_cli (cyclomatic 45): impeccable_live::live_wrap::wrap_cli has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_wrap.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0671063726a50ad4095a3554ae5c61dce6d6b2c40ebd8a0fd465d5521ac7aea"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::collect_browser_findings (cyclomatic 44): impeccable_core::browser::driver::collect_browser_findings has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb4457260068c0c84bce5a33f13a4890485785a5565a602421fd7c692307b9d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_accept::accept_cli (cyclomatic 44): impeccable_live::live_accept::accept_cli has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6abee3bf9ae434a4fcaf4bc2b53b1efc2ed78ac2a9408d1b2fc8d716eb03d6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::event_validation::validate_event (cyclomatic 43): impeccable_live::event_validation::validate_event has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/event_validation.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba084cca2384ae41b8722325ea5ef737b23701f0c7ceced2de89ce375ffcccc"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::commands::install (cyclomatic 43): impeccable_skills::commands::install has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2184122f42f510f25b7e09ed04c4fcfefcfea2ebd5ac6cf2de5ad3c33aaed48"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.startVariantObserver (cyclomatic 43): live-browser.startVariantObserver has cyclomatic complexity 43 (threshold 15). Most of this is not in the body itself: 1 of the 43 points is its own statement and the rest belongs to one function literal inside it that branches (line 7258). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7255}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ca663d8835f3453aa34f5ed24b8e61b397b63546426d975cfeacca791889ad"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::critique_storage::run_with_saved (cyclomatic 42): impeccable_context::critique_storage::run_with_saved has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c5b31383c554e9526f6efbcee362747c72403654e3e35fc9047d5716f3ce6f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::count_repeats (cyclomatic 42): impeccable_core::browser::driver::count_repeats has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9c6934e8b7f0efecce9074076db052588099f548a1889afd1883d3d743ef9c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::text_descendants_flush_sides (cyclomatic 42): impeccable_core::browser::quality::text_descendants_flush_sides has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc58eb71ca3c3a9b3dc8afec27553308a73268373d384aede6d3ca63b46f109"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_browser::scan_loaded (cyclomatic 41): impeccable_browser::scan_loaded has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7764d308c785c94c727f86fca33f49f945dbc060b34c105e58bf0ac7f38f0596"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::run_commit (cyclomatic 41): impeccable_live::manual_edits::commit::run_commit has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"b821155b7dac260a66d3a153c135d4e33e9f6a7c33fe5c769e5d9d4dbd16e2fc"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::context::has_visual_implementation (cyclomatic 40): impeccable_context::context::has_visual_implementation has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba68169a8b8de32eac276a8286a30b4562a9c436ae37eb42ae03c5374df3666"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::html_patterns::check_html_patterns_picking (cyclomatic 40): impeccable_core::checks::html_patterns::check_html_patterns_picking has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd694a2c4c8996bfb52141158d42f1b1d76ad4a605e0e8401257503920505bc9"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.restoreSessionWithoutWrapper (cyclomatic 40): live-browser.restoreSessionWithoutWrapper has cyclomatic complexity 40 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9885}}}],"partialFingerprints":{"codehealthFindingId/v1":"64153d2b894dc92feb1b170a4581f8654ccca23b6b1f9310e115cdcff7b5c856"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_responsive_inner (cyclomatic 39): impeccable_comp_verbs::build_phase::gate_responsive_inner has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c56627acbfe70d278df17b3fffce3e8a74666fed8058b4d3a26b08fcba792c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::advance (cyclomatic 39): impeccable_comp_verbs::build_phase::advance has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"c791cd35627d568ba05ee584e402ae8cb640711eaddea3b106b4835eba267f77"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::component_review::store::submit (cyclomatic 39): impeccable_context::component_review::store::submit has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/store.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7e796fe8c2f06fd93b806ba5b5fbbc25a3e067c926df881f16d1fe50767e4d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::regex_matchers::image_source_is_missing (cyclomatic 39): impeccable_detect::regex_matchers::image_source_is_missing has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"3805fa434dfac48dc90b49a5f59b32e7e8f0703d259053eaaf35a5feedfb7319"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::commands::update (cyclomatic 39): impeccable_skills::commands::update has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"612fe6e322b33a8e0db9599d0b4c12ff48e642138634cb938f4ee1be0ea554ee"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.buildSveltePropValuesV2 (cyclomatic 39): live-browser.buildSveltePropValuesV2 has cyclomatic complexity 39 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. 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":"skill/scripts/live-browser.js"},"region":{"startLine":5744}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fa28a5edd6d0d2b761f5f34491d84989c0161cf0c3177e512546f5e025946f"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 39): (anonymous) has cyclomatic complexity 39 (threshold 15). Most of this is not in the body itself: 14 of the 39 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 43, include, a function literal at line 5, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_isolation.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89dede5da30afcb0bc6b9f3ff8ad07be218720e7aeff1967e134c17f1832fd6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::component_review::server::serve (cyclomatic 38): impeccable_context::component_review::server::serve has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/server.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9a40cad92a02aa649d5757f2746fda5db6c82180d984a777aafa9ae6e140cb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::generate_image::run_with_api_base (cyclomatic 38): impeccable_context::generate_image::run_with_api_base has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f24971da70de0558b4456e7e468eac796bdccbdbdea9790f9e1599859a7f73"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_inset_stripe_dom (cyclomatic 38): impeccable_core::browser::element_checks::check_element_inset_stripe_dom has cyclomatic complexity 38 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"04718b60a05f7f66d429e60b9f55f7e82128e8091086bb2eb08cf61f24b1be0a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::mask_js_literals (cyclomatic 38): impeccable_detect::detect_text::mask_js_literals has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b5fcdc7f227a566dee780b45d36614fe38a318d9612cac53a719bf9cb2327d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_server::handle_manual_edit_commit (cyclomatic 38): impeccable_live::live_server::handle_manual_edit_commit has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbfde9da4cc73d909c4595121e2f4f0fd5c6f58edc99db49ea9094a8a08e080"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_common::http::read_request (cyclomatic 37): impeccable_common::http::read_request has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/http.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4581aa5f8be44fcf4c0d9da0096846de20edd3017c68e75005f55e33a1e7f4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::find_lines (cyclomatic 37): impeccable_comp::font_fingerprint::find_lines has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c1e616fdb8862d94ce623627992a416459c08cd5c7d30a5ac8064ae75287a0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::font_match::run (cyclomatic 37): impeccable_comp_verbs::font_match::run has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/font_match.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0c0905962adf9fa2a47350ea3a031691e3d13b3d0a43ba3861c72ef54afac6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::cli::scan_targets (cyclomatic 37): impeccable_detect::cli::scan_targets has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97790da91845c6207bed92d2fc126ba7a3cfd026db1f31c4ad9ead74d09a3a6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_server::run (cyclomatic 37): impeccable_live::live_server::run has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fd3052175eb861425544d7ec787ac0fc40173684bde0b961db3541c6ce4c94"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::map_inspection::inspect (cyclomatic 36): impeccable_comp_verbs::map_inspection::inspect has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/map_inspection.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0f69b3b4798f9dd382d0ac0f7aaf820e85ade1178b6e4b7612d0ec1663c795"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::adapters::check_element_colors (cyclomatic 36): impeccable_html::adapters::check_element_colors has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"b616c031aa035fe974b2b527de2ad7b494710dfef6edb2b95206340fa3696cbe"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::cascade::shorthand::expand_static_declaration (cyclomatic 36): impeccable_html::cascade::shorthand::expand_static_declaration has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/shorthand.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d832e425e623588963cd81def4816afa400a1db3d943db29d525e1d21524b6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_boot::run (cyclomatic 36): impeccable_live::live_boot::run has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_boot.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0953767b1671ea0cbf3607fefec901bdd9f5ff442d8b3823c8446feddb3d90e1"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_inject::inject_cli (cyclomatic 36): impeccable_live::live_inject::inject_cli has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_inject.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e491f7634951ca02814681434aaca1d6965325fb568449899d84eaac873f3e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::collect_visual_contrast_reasons (cyclomatic 35): impeccable_core::browser::visual::collect_visual_contrast_reasons has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22f114474d23c9f3fa52241e0f47f182ded8b29f2a3ce914b1dbf1b305f27fc"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::color::parse_any_color (cyclomatic 35): impeccable_foundation::color::parse_any_color has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ec5fc58671fca7ae2e4ddc9477225ffbfbd9207a5d2bee3667f2663977be55"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::config::glob_sync (cyclomatic 35): impeccable_live::config::glob_sync has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/config.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"82de4e73d895a131d0730b5de6400ee1337c246058ae86cd3bb0a204f7ab9fb8"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_server::handle_manual_edit_route (cyclomatic 35): impeccable_live::live_server::handle_manual_edit_route has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddef265738bf231abcafadec38ec392564ecd7cf6518c2faa9cd57e7f9071ff5"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::manual_edits::apply::push_batch_in_chunks_and_wait (cyclomatic 35): impeccable_live::manual_edits::apply::push_batch_in_chunks_and_wait has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06352532b5f06ee1095f0988f62e56038714d7297d0058a4745fb039a0c5ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::asset_capture::capture_page (cyclomatic 34): impeccable::asset_capture::capture_page has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae53345f2cee5a5acd430e3ed74d128c6f651fde9870f3d03286b0fe4423770"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_pseudo_stripe_dom (cyclomatic 34): impeccable_core::browser::element_checks::check_element_pseudo_stripe_dom has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"95310253dfc5b350e598b6e5baa1ceb6449cdd3a78e9d43289285b0fe2c4aa33"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_text_overflow_dom (cyclomatic 34): impeccable_core::browser::element_checks::check_element_text_overflow_dom has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":6038}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1012e5b8bed4e70ee3b6c762d3733ff308b51b4000a303125d74bf6a48b3b8e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::scan_inset_stripe_css (cyclomatic 34): impeccable_detect::detect_text::scan_inset_stripe_css has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88792cf15ec0a021995f2845e7a9923963f6599d5f335b535763b0ba9343847"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::adapters::check_element_stripe_child (cyclomatic 34): impeccable_html::adapters::check_element_stripe_child has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"728ef9925161a953534175d32d27fd386042ccfb705b429f8de3b269e57a62fd"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::manual_edits::apply::validate_manual_apply_result_message (cyclomatic 34): impeccable_live::manual_edits::apply::validate_manual_apply_result_message has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ace04bbf3a0bb664091d8bd3b985a095b0ef30514e8e3c22f0229df71d712c3"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.handleClick (cyclomatic 34): live-browser.handleClick has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8212}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e45eb31984bc2f03388b04f005a555fb3b83d4919f7127236598f1be42c9e4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_agents::resources::apply (cyclomatic 33): impeccable_agents::resources::apply has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ebf22d2a11b5731846954d3f28ed76ff65bd88cd0ca368d2909b6900c47a44"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp::hero::text_region_check (cyclomatic 33): impeccable_comp::hero::text_region_check has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63d6dd95a174dcf1e6b908f81b9778a612ddf6b4c8d9adfb2ea49b51dc065e3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::read_pseudo_gradient_face (cyclomatic 33): impeccable_core::browser::element_checks::read_pseudo_gradient_face has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9d7f717064df33d419ccf3bcf1a35c991d6a09ecae15f94a19fc435ae26028"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_edge_flush_cards_dom (cyclomatic 33): impeccable_core::browser::page_checks::check_edge_flush_cards_dom has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"7303a417a3737007006bab2094e38487bf1fa1483c8e1f971a68c2fe6fc2976b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_first_viewport_column_overflow_dom (cyclomatic 33): impeccable_core::browser::page_checks::check_first_viewport_column_overflow_dom has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":5516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a1c97797cf62a3a8ec44e792b83f0ede570f5fbb8cb52c39d1ea233e88ae5b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::vectors_a::call (cyclomatic 33): impeccable_core::checks::vectors_a::call has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_a.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eff30f775cabb8f73b87ab09e2778b5c47b60d856264a2f9ab01bd29e32283"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::analyze_attributes (cyclomatic 33): impeccable_live::svelte_ast::analyze_attributes has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"098d99d3bdf78324c0eeeed2ec7047d9ce273b57d72a68e0a3874d4027c47af6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::wrap_common::find_closing_line (cyclomatic 33): impeccable_live::wrap_common::find_closing_line has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/wrap_common.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b90dafbb199d82788cad0cb55540b7bfc08128b21fd5e0c959da06f2efbc2b"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-review.mountPlanReview.wire (cyclomatic 33): plan-review.mountPlanReview.wire has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 543, a function literal at line 541, toPanel, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5239ff6442bed96ceb2614c21f65d799b07be2c7ad501031098f905057fdc3"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::scan (cyclomatic 33): (anonymous)::scan has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5816bb078abe1971956583b4d08f19eb09200aefd38c7709d90635b2a27c0cb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_agents::resources::build_resource_records (cyclomatic 32): impeccable_agents::resources::build_resource_records has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cb2b3337b89b94f8cde9f948ea080137bcc05f0be0ff01417ea10063f16ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::url::parse (cyclomatic 32): impeccable_context::url::parse has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/url.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"231b9a14436b7ba3ae3906556a217585512a34a75b926ffa5c8e5e2ed390a132"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::vectors::call (cyclomatic 32): impeccable_foundation::vectors::call has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/mod.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"9235bd44e2616dcfb07e43d6ad5bd89b4d505343ec8f77cc6c4678adf54c54f4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_server::handle_events_post (cyclomatic 32): impeccable_live::live_server::handle_events_post has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cc15492a1c24e602228bdf40b346e841222119ddc76fef25df4f532d3feb64"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.handleManualEditActivity (cyclomatic 32): live-browser.handleManualEditActivity has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06c42cdb609c3aca561c10e7d38235b5a3d20d3ee897f9ee5b87f7e52a8acd2"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 32): (anonymous) has cyclomatic complexity 32 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 7 belong to 8 function literals inside it that branch. 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":"extension/background/service-worker.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81af0328e05a55f677864a8ffd8367f8da0daf025e9285534bf4aea60d11646"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::loop_install::run_inner (cyclomatic 31): impeccable::loop_install::run_inner has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_install.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cb83d425dba3758dc198058fccb85e17db5e27b6b212c37e9b2b2dd0855ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::signals::git_signals (cyclomatic 31): impeccable_context::signals::git_signals has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/signals.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"62382e5220047d17695f7c1f3eabac3e561c8cf6247dadf2c76179bdc10b0da4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::slot_keys_of::visit (cyclomatic 31): impeccable_live::svelte_ast::slot_keys_of::visit has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c4a364986c3c55c695cd2ad7fc30c20b21746b8b20ef393ccd261e3b845ca1"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.injectVariantsFromSource (cyclomatic 31): live-browser.injectVariantsFromSource has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 14 of the 31 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 6689, 6712, 6663, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab74d717a85fa676e2c20d16cfe8ec24149b0a2d2d9e5df0270a10966c27c376"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_common::jsp::win32::relative (cyclomatic 30): impeccable_common::jsp::win32::relative has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e00c024e8935b346e29ee5e80b34697adcf2a509bbe1bc280d4a1db61b78aed"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::component_review::store::prepare_bound (cyclomatic 30): impeccable_context::component_review::store::prepare_bound has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/store.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c54723e8ee99a83e9d5e87e45974cb36a8c5efc935daf5f63fc7855ef8bc750"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::component_review::verify::capture_intact (cyclomatic 30): impeccable_context::component_review::verify::capture_intact has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/verify.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b38ece13b04f5639a3bae628c52622832e71f46a559183aa2eb0a783d087ed0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::design_parser::unescape_yaml_double_quoted (cyclomatic 30): impeccable_context::design_parser::unescape_yaml_double_quoted has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f7b5bd11139676e7aee049eb5f551ad0367a677c3893c069af5acd68072a51"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::layer_entry_fills (cyclomatic 30): impeccable_core::browser::element_checks::layer_entry_fills has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea8879c63388607a1621957c0a1b33575b72ac6eae6e580b552a2518fa7e099"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_layers::covered_by_a_later_picture (cyclomatic 30): impeccable_core::browser::text_layers::covered_by_a_later_picture has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0df9b385f561078d31d3999d1645dfd372e47ff8304a3f86c0279254147acbe"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::pseudo_paint_placed (cyclomatic 30): impeccable_core::browser::visual::pseudo_paint_placed has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"712a9d3581e040ede083805f2ab3d2e869ad4056f01121b0945b5dad8f64e706"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::design_md::unescape_yaml_double_quoted (cyclomatic 30): impeccable_live::design_md::unescape_yaml_double_quoted has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0740dfa9f2ea3b6f33c9d437cddb498d1c28d09ab441eaaf06e2db56e4ef39cf"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::restore_svelte_markup::walk (cyclomatic 30): impeccable_live::svelte_ast::restore_svelte_markup::walk has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95f5fc95d67566d476bf193b28dff5698c02346b7640a4b765eccefa2910aa6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_account::design::after_scan (cyclomatic 29): impeccable_account::design::after_scan has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/design.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"975af22d3931689d4fedb0309a34f30135aecb0ea814e34779ad1b19af6c18f2"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeComponentCapturer::capture (cyclomatic 29): NativeComponentCapturer::capture has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_capture.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"710b2f9c581c6b83e196cf6f6556a452b7de009664d444cf734be1b9c5602180"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::body_text_edge_span (cyclomatic 29): impeccable_core::browser::quality::body_text_edge_span has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"256232a7966798863b7e2ee95eef2c7790f7e2b5435595918d129a60d291a46a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::collect_repeated_container_text_findings (cyclomatic 29): impeccable_core::browser::text_collectors::collect_repeated_container_text_findings has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4424aa21638411cf243d84d4599a11a549fa7fce381425b296ff8bbddcb3395"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_pulsing_dot (cyclomatic 29): impeccable_core::checks::css_scan::scan_css_text_for_pulsing_dot has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcee8733290298d6348c394feb84aeaa62ee4bbbee16c53220999a0d1ff48942"}},{"ruleId":"D1","level":"warning","message":{"text":"KeypressSession::next_key (cyclomatic 29): KeypressSession::next_key has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/prompt.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c4aba24dca92d4e5afb67ed54ce3355e49c10cfa0438a0bb6202ad1374def3"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapLinkedStylesheetText (cyclomatic 29): 15-snapshot.__snapLinkedStylesheetText has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 2 function items inside it that branch (appendRules, appendSheet). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48174262883a0db812381cb6b58a0b560015bbc005ed0ea2e66e35648bf533b"}},{"ruleId":"D1","level":"warning","message":{"text":"service-worker.chrome.runtime.onMessage.addListener() (cyclomatic 29): service-worker.chrome.runtime.onMessage.addListener() has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb94920832067b66e31eeb2af24b837d4460cdfaa6d59cc3fe4eb993a8b1f78"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.unlockSteerChat (cyclomatic 29): live-browser.unlockSteerChat has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11241}}}],"partialFingerprints":{"codehealthFindingId/v1":"40870b326370414343a3c70045d8eb1f0a3e2cc8d9750c1df441a0850e3ec08a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_common::jsp::win32::normalize (cyclomatic 28): impeccable_common::jsp::win32::normalize has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7b4cb33a9e2c9e0555c0599e203871ebcf1a278f58ce1d6cbf65f7bc19c1dd"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::component_review::run_with_capturer (cyclomatic 28): impeccable_context::component_review::run_with_capturer has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0404711d6e95b4b5c4ce3c91104b5e975d71a10c9689aa67564071ec8acb81"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::staleness_deep::check_hook_installation (cyclomatic 28): impeccable_context::staleness_deep::check_hook_installation has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness_deep.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6780de51003c1d6c392bbf1744e8fff093b1bebb90f327b6bb4ec908eba42d3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::side_meets_same_fill (cyclomatic 28): impeccable_core::browser::quality::side_meets_same_fill has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32ae5fb3f1efba6b658bb3867903cc10da42ef59678953867d20f31f5448d77"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_layers::fill_covers_ranked (cyclomatic 28): impeccable_core::browser::text_layers::fill_covers_ranked has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"014a63cb86e61fa9b47a5a26b52e935e5b1433666ba6e5fd806d6a0070039836"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_inset_stripe (cyclomatic 28): impeccable_core::checks::css_scan::scan_css_text_for_inset_stripe has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee49fe1741cf915bf588d842657ad2fb434baa5634692e07d68d48fd7abcc8c0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::rules::tailwind_declared_corners (cyclomatic 28): impeccable_core::checks::rules::tailwind_declared_corners has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f704f0a85a7ae1de46e2410b871bac84a3aeae3c1a40da5fd8ca8b4c7ef851da"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::text_context::fine_print (cyclomatic 28): impeccable_core::checks::text_context::fine_print has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d5eab7864c96d53d9ef16a303aff85fb1f4b696143174f3bacd8df51643aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"Prompt::checkbox (cyclomatic 28): Prompt::checkbox has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/prompt.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0a511e2d7608407e149c12011766b13665212a8e2214958ad689ddd0bffd24"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapPseudoElementHostSelector (cyclomatic 28): 15-snapshot.__snapPseudoElementHostSelector has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d275755748333ca9f0e09f314b4ae7f802b3517eabae924907eb1c3295c1e812"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-review.mountPlanReview.summary (cyclomatic 28): plan-review.mountPlanReview.summary has cyclomatic complexity 28 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e3fc530a2a7dcb836432816d6905999afb4c0c146ed597856772dd2eac585"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_common::jsp::win32::dirname (cyclomatic 27): impeccable_common::jsp::win32::dirname has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce80e240a7f4cdb9a3979a17c2711afe09fe4fe58101d71d61b6a6eb0892ab1"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_spec (cyclomatic 27): impeccable_comp_verbs::build_phase::gate_spec has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4c88a0f88b744079e553681271441397a6c5535245d56900ca797f42b5e6e4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::spill_meets_another_box (cyclomatic 27): impeccable_core::browser::element_checks::spill_meets_another_box has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5870}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cfc72cbaa2c6ea602e7cd2771e246110f7553815e2c7657341d2f843ece186"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::closed_container (cyclomatic 27): impeccable_core::browser::page_checks::closed_container has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cef37272545b23122de5cea286d5dfaef9e7fbb6f4e169e08b7c7433c9d3e3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::painted::clip_outcome (cyclomatic 27): impeccable_core::browser::painted::clip_outcome has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5b96153762ccd7f6adf997d088b317b8d03f4ebf9c9fcba0e8b184550f5386"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::unread_reading (cyclomatic 27): impeccable_core::browser::visual::unread_reading has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c221e6d152411bac5c8c5f28090529dd4e23bc86c31e940d1ae79632912a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::collect_visual_contrast_candidates (cyclomatic 27): impeccable_core::browser::visual::collect_visual_contrast_candidates has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c00c6e1a97e1a6789e3d878667ce80804f3590459c06b651b32adfb52f1099"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::js::scan_decimal_prefix (cyclomatic 27): impeccable_foundation::js::scan_decimal_prefix has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5545f2f905003c5a8ef39c6a7b39136775cea1c831704be77cc0da037703c78b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::stop_baseline::capture (cyclomatic 27): impeccable_hook::stop_baseline::capture has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/stop_baseline.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33abf2b9f592fb450a85151e74d02723fe941517ba34a33ee269c8e92051ebf"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::page::check_repeated_container_text_from_doc (cyclomatic 27): impeccable_html::page::check_repeated_container_text_from_doc has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab4a46746b6b22ecb77f2528199071950894edb355c3085457d97c76e9f0ae"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapLastWordRects (cyclomatic 27): 15-snapshot.__snapLastWordRects has cyclomatic complexity 27 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 13 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfab3e3421cb591054e293c34368e74590e9d316925f3a167312c578f22da18"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.mountSvelteComponentVariant (cyclomatic 27): live-browser.mountSvelteComponentVariant has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdcb9f58acfc084fca994bcd250ca4070e3ca8759806e4b285f5e910f503272"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.startScrollLock (cyclomatic 27): live-browser.startScrollLock has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 11 of the 27 points are its own statements and the rest belongs to 6 function items inside it that branch (correct, a function literal at line 7139, a function literal at line 7189, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7085}}}],"partialFingerprints":{"codehealthFindingId/v1":"305e02b2b0cee345a597c4adbc5fae0c551486bb3aff53d6df6687adc2397f99"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_account::critiques::after_save (cyclomatic 26): impeccable_account::critiques::after_save has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/critiques.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"751611c73ae992457ac4e59cdbafcbcb91f76b87c8d3eadace4b80bab65becfe"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::component_capture::render_page (cyclomatic 26): impeccable::component_capture::render_page has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_capture.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"418d210a24d29a42a8c0996896ea6b56dc6b54152eb04b4fe8d7bacee4177d5f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::background::walk_surface (cyclomatic 26): impeccable_core::browser::background::walk_surface has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a83037bfa78b92096ae49b606e4a006b10ba168d283b32b862f1b41eb4f6fe3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::pseudo_element_host_selector (cyclomatic 26): impeccable_core::browser::driver::pseudo_element_host_selector has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"910358b3f7f6312af4affbec5daf8cccbb1b9a7a94140fc4b246689d6a78bcfd"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::ai_palette_gradient_hit (cyclomatic 26): impeccable_core::browser::element_checks::ai_palette_gradient_hit has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":3940}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb6a06069ff07a0a3f8f64b9773c7a9ddea90de75aa3bca097c8505da17ef43"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_blinking_cursor_dom (cyclomatic 26): impeccable_core::browser::element_checks::check_element_blinking_cursor_dom has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":6205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7493caef1d74796b1fa64f544dcc55280bf670b813eaa3d352e7e543f7c3d629"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::css_plan (cyclomatic 26): impeccable_core::browser::visual::css_plan has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76975347e966e0ecfd4359c3bfd9710cf9e9ce9c0e1306218f2f8b21db843b2"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::rules::check_borders (cyclomatic 26): impeccable_core::checks::rules::check_borders has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bbff5ad95edc76a4c5aec2217a10ec924a4164961e7dab8bc62c31bcfdd8dd"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::text_context::read_transform (cyclomatic 26): impeccable_core::checks::text_context::read_transform has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"758e81746f693489fc3c288e10095456812c4c4766841e0949e5691bc9cdee6e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::jsx_expression_end (cyclomatic 26): impeccable_detect::detect_text::jsx_expression_end has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ca5d00c5cdc841eb8a8ab7020018211825975d1b2699b321afea3f3fbfe2df"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::css::measures::resolve_var_refs (cyclomatic 26): impeccable_foundation::css::measures::resolve_var_refs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/measures.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"91072f89462bc73fe3325af1247232d8ff4a6dbfbe6e20abd35520833aa80e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::before_edit::main_flow (cyclomatic 26): impeccable_hook::before_edit::main_flow has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6802a7a9ae88d05aab27e2f982bdc9d224da2835d829850f5f4f1a94162a80"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_insert::insert_cli (cyclomatic 26): impeccable_live::live_insert::insert_cli has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9fdca5e3ca541a4a38c739dd9caf94ebdbad25bf29d51b537fc9fd10c88e0f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::context_cli::run_with_hook_repair (cyclomatic 25): impeccable_context::context_cli::run_with_hook_repair has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65dfad415c22ee4b8b08e429d299fdc7bf21a74953b0fd79f7e5d989cb1ab03"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::embed_prompt::run (cyclomatic 25): impeccable_context::embed_prompt::run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/embed_prompt.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b47b80985c819494b733fe50d5ac79257fa2a66accbbd918871b93e4b47680"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::staleness::check_native_platform_evidence (cyclomatic 25): impeccable_context::staleness::check_native_platform_evidence has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ba8fce8824c42b83ff830f55e1a15b9020a3fbb3b7980610a48ac49c7c66bb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::measure_hidden_text_dom (cyclomatic 25): impeccable_core::browser::page_checks::measure_hidden_text_dom has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (impeccable_core::browser::page_checks::measure_hidden_text_dom::state_of) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea20dfbb41b8ad81df002c3d686b5c1c1d3bff12600765477e5d77738c8b4741"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_radial_halo_with (cyclomatic 25): impeccable_core::checks::css_scan::scan_css_text_for_radial_halo_with has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7308136defd1575f4c834b0ab216d02cbf7bea9d4f6aae69361bc91572da2f0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::rules::check_colors (cyclomatic 25): impeccable_core::checks::rules::check_colors has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ce1e706fc6a80bdffe86cceb99c92b19db29294db880c7a05d56c91766c875"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::vectors_b::call (cyclomatic 25): impeccable_core::checks::vectors_b::call has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_b.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e749a78a629d363d15ace972070f3eeb67b0fae2f56e346bc404bd1ab5e3db7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::js::number_to_string_radix (cyclomatic 25): impeccable_foundation::js::number_to_string_radix has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"917837a4fbb6a627a5abdaba69cfa0039fe128711612afa794f2bdd5c359cade"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::line_has_object_key (cyclomatic 25): impeccable_live::manual_edits::commit::line_has_object_key has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"9122c7cbfb052c0936ac7b1d3140831395cffe591babeea106ebea3fa6208433"}},{"ruleId":"D1","level":"warning","message":{"text":"40-overlay.createImpeccableOverlay (cyclomatic 25): 40-overlay.createImpeccableOverlay has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 305, 260, 224, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab233e877589fe93d1dbc0ce6d2e977c2c8d33be4ceadcfbbfb6d186df219bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.buildParamsPanel (cyclomatic 25): live-browser.buildParamsPanel has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c2a221cf83176a20d293747d4748d44f10a3619f3a201938e26fa85a27a510"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.initPageChat (cyclomatic 25): live-browser.initPageChat has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 11757, 11749, 11708, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11592}}}],"partialFingerprints":{"codehealthFindingId/v1":"05133e9a6dcac0152dfcaba541c6edfb13868b15196f770cb02255264e9c7e92"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.initGlobalBar (cyclomatic 25): live-browser.initGlobalBar has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 10 function items inside it that branch (makeIconBtn, makeIconBtn::collapse, makePendingDecisionBtn, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11923}}}],"partialFingerprints":{"codehealthFindingId/v1":"732af03fec0077310278db3c5881fe29ab8a08b892c3698cca8b75cc5b48fec9"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_account::health::run (cyclomatic 24): impeccable_account::health::run 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":"crates/account/src/health.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e85080072a306348f822350f5b3159471b3326ea189a96072866abf966e54c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_account::pro::refresh_with (cyclomatic 24): impeccable_account::pro::refresh_with 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":"crates/account/src/pro/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"3865271bf8a3ce075ffbb5c4f95602ac91a399179e8d1b07f32dd3651e04bee3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_browser::fullpage::stitch (cyclomatic 24): impeccable_browser::fullpage::stitch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31d8fd009db54a1f705b377bac2247ebfe2965db70a719826e95d850e51cdbf"}},{"ruleId":"D1","level":"warning","message":{"text":"CdpAssetRenderer::capture_batch (cyclomatic 24): CdpAssetRenderer::capture_batch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f80a0ded4eba15f69f971d44e7d3e35b04d70df02b5f074c0d681371a3a793"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::comp_diff::verdict_for (cyclomatic 24): impeccable_comp_verbs::comp_diff::verdict_for has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e14f4adc50f03afa72ba570db24cf33c22a6fab5f0858af48fd0d59299b68"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::catalog::validate_concept_entry (cyclomatic 24): impeccable_context::catalog::validate_concept_entry has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/catalog.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"af362536d79f7e0d6993f88962c415746f64421f5f8cdc15409453f5281c3475"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::concept_seed::run (cyclomatic 24): impeccable_context::concept_seed::run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94146099a95b55386b27816cb46119da278bc4505c01bc8b213d271d50af349"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::pin::run (cyclomatic 24): impeccable_context::pin::run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/pin.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"c708c8af762cd64797d34bd30b20e62fce62ae1984e2038814e1cba981ef2056"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::page_paints_stock_violet (cyclomatic 24): impeccable_core::browser::driver::page_paints_stock_violet has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b37abdbe415f62894b556f7eb7bf4ce2160b65752a75a04268852980698078"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::blended_echo_over (cyclomatic 24): impeccable_core::browser::visual::blended_echo_over has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c55da248254563a6566a0aa01f8987da5f91ff6baaab957b1b8f3015720a86"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::design_system::check_source_design_system (cyclomatic 24): impeccable_detect::design_system::check_source_design_system has cyclomatic complexity 24 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"529c169a93af5fc667a1dc87d2e9613d33a8af7954a486383d8ba9e698991e64"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::an_plus_b (cyclomatic 24): Parser::an_plus_b has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fed3d27872496002f428529eaaa80f3845d828f38e470edd14b33723f33c542"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::describe_each_item::walk_for_slots (cyclomatic 24): impeccable_live::svelte_ast::describe_each_item::walk_for_slots has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"c012d30ab3cfe9d3caefc04efef04e8f22629a9a8e1cf78d1a1e6c7cc74995f4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_component::inline_svelte_component_accept (cyclomatic 24): impeccable_live::svelte_component::inline_svelte_component_accept has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b1efd501a46a5b2a522a999393e8da9404554981e8968407173042769b1b1e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::util::date_parse_ms (cyclomatic 24): impeccable_live::util::date_parse_ms has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/util.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59640d706c7adffc605c66db9a491bd1bc283889aba54a3cf20a3185dce07fd"}},{"ruleId":"D1","level":"warning","message":{"text":"component-review.Xn::ct (cyclomatic 24): component-review.Xn::ct has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 3 other methods here (component-review.Xn::Dt, component-review.Xn::Ht, component-review.Xn::ot) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ede442def6b68a1e3a23ae24079ae7124be434e9dbfcab205a9f9392266dfc9"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.startVoice (cyclomatic 24): live-browser.startVoice has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11399}}}],"partialFingerprints":{"codehealthFindingId/v1":"590889d04c9da946a27531b989551edb5cd931146c59bbd145023286fbbebb3a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 24): (anonymous) has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/60-offscreen.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c18498764239952896b76ee12b8a43bf21f54c44b14d0f6981a9c1d5f56adfa"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_agents::cli::validate (cyclomatic 23): impeccable_agents::cli::validate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/cli.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8f907a7fee5727af8c7db0e3d3ae7a5ad15d145aef7f5ee0393ce4990d0a2b"}},{"ruleId":"D1","level":"warning","message":{"text":"Page::goto (cyclomatic 23): Page::goto has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"09754e7a36970f0e3f654d42d90507bfcb5a95bd0d8a8e5c90081f4ca5fa2993"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_browser::run_visual_contrast_fallback (cyclomatic 23): impeccable_browser::run_visual_contrast_fallback has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a2c7a9d593c4bac4365bd31390d875cc77f9ba70ea81f76348a3f9e4a29e98"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::unreferenced_plates (cyclomatic 23): impeccable_comp_verbs::build_phase::unreferenced_plates has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"faae156474753aa4412b136304ecc036245bc223fd08cbe5dbf24eceea640b08"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::roll_selection::select_approved_challengers (cyclomatic 23): impeccable_context::roll_selection::select_approved_challengers has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/roll_selection.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3411845b2443fbedfd97faa621832f42a5395572693de9e1566a1a63699d052a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::roll_selection::select_approved_compositions (cyclomatic 23): impeccable_context::roll_selection::select_approved_compositions has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/roll_selection.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6c84a0547496d414386ff92a92394f7686d2dea013fa856e2066fe9df6460c"}},{"ruleId":"D1","level":"warning","message":{"text":"CssHostIndex::new (cyclomatic 23): CssHostIndex::new has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e815a189e9d378eb1a682ad765582bf332592e5179f6c682884ddd493338a3de"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::brand_surface_colors (cyclomatic 23): impeccable_core::browser::driver::brand_surface_colors has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e6cd4c3870272d9f49f4530a7252af42c0ea4824f3882e1968c4076bac095d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::spill_past_painted_box (cyclomatic 23): impeccable_core::browser::element_checks::spill_past_painted_box has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7574c41d427db62670cabe204e8a366d046b444be9c86a2147c81277864aa70"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::html_patterns::scan_html_for_shape_assembled_illustration (cyclomatic 23): impeccable_core::checks::html_patterns::scan_html_for_shape_assembled_illustration has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5099684f6a3d3d99d794828ebe82e3bff2786154ce80c900663ce610237a6c8"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::row_stripe::border_stripe (cyclomatic 23): impeccable_core::checks::row_stripe::border_stripe has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/row_stripe.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"495b05fe98e21d86e450a3466d288fd21c2e614a7db7f7f965db0d3a35c05a47"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::admin::repair_hook_manifests (cyclomatic 23): impeccable_hook::admin::repair_hook_manifests has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"342e622acb47e00bcf3bfad9652b22f9fa45744efb3bd8ad9da9953d5446368c"}},{"ruleId":"D1","level":"warning","message":{"text":"60-offscreen.chrome.runtime.onMessage.addListener() (cyclomatic 23): 60-offscreen.chrome.runtime.onMessage.addListener() has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/60-offscreen.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e1d49ef50416ee5708dd54267f3122e6d7a8b431e73a012762d99a2d2789c6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_browser::validity::classify_with (cyclomatic 22): impeccable_browser::validity::classify_with has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/validity.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2db6c4fb43f1fdbeeb80de5394ba17d2e8c2b2dfce9d9f3cacbaf1bab96c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::capture_service::parse_capture (cyclomatic 22): impeccable::capture_service::parse_capture has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"215d23850c6777d8562548cffb9f53757332cf34d323ef2e27944d9a678a1506"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::concept_seed::ping_chosen (cyclomatic 22): impeccable_context::concept_seed::ping_chosen has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"91288bf04e62f3080d5546d246eb6cb3213d06bd7177788221a29d16a012d76c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::critique_storage::write_report (cyclomatic 22): impeccable_context::critique_storage::write_report has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d606126066a733e9da462bab0de4c315e3dad245be2780d9b6d05cae951c11"}},{"ruleId":"D1","level":"warning","message":{"text":"SafeTagTextSeen::keep_first_keyed_claiming (cyclomatic 22): SafeTagTextSeen::keep_first_keyed_claiming has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"47923b97cfe71d2754c496c376b8d2c35ba30619b7bccbd2ba4e45f05420a0d9"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_stripe_child_dom (cyclomatic 22): impeccable_core::browser::element_checks::check_element_stripe_child_dom has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f18efeaf7e113552e294a93cc18208dfff52039b9b5d8db3d22461059eb72b3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_layout (cyclomatic 22): impeccable_core::browser::page_checks::check_layout has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf49a28d2d8f299bb37336e8186a2b01233152f18df211e6131eb0f4595a4769"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::covering_ground (cyclomatic 22): impeccable_core::browser::page_checks::covering_ground has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0104c370c7dc9c758e8e3418ea6448b5f58328d777ee6041c89d9d8208a236"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::is_transparent_shell_for_flush (cyclomatic 22): impeccable_core::browser::quality::is_transparent_shell_for_flush has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c9a345b447dab579ecdda9dc7ac9043f07b39457a6fd30af01ee4960c4371f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_layers::at_point (cyclomatic 22): impeccable_core::browser::text_layers::at_point has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce908b13a45639d6d69d54a2dd050734f3e436492dcdf1dde6631ad2e2d5201"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::finish_analysis (cyclomatic 22): impeccable_core::browser::visual::finish_analysis has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":4374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9788cd4991bae0644694a8be818c4781bd4d60317a18ba67061483b7e811cf3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::gradient_geometry::gradient_paint_under_text (cyclomatic 22): impeccable_core::checks::gradient_geometry::gradient_paint_under_text has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/gradient_geometry.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdc5ecaa6b22718068fa97476ea7751d1f25cc41cbf4942e265503315c5ffeb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::rules::check_hero_eyebrow (cyclomatic 22): impeccable_core::checks::rules::check_hero_eyebrow has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc06e2139f182f3db22b577fd02ba84a7e6af124855c75cee8e306bab27b436b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::text_rules::is_kicker_candidate (cyclomatic 22): impeccable_core::checks::text_rules::is_kicker_candidate has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_rules.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf88ca657ab2f9a26b0e4bc6956dac32c1f34e5e76adecbe1e33b4d6cd0d435"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::blank_css_line_comments (cyclomatic 22): impeccable_detect::detect_text::blank_css_line_comments has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62f9c7ca4c40caf4d9df01c5a3a62caeaf20d91de975934edc562c9f9ac3fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::background::walk_surface (cyclomatic 22): impeccable_html::background::walk_surface has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/background.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4d0a5412f0a829b4ad3be274dc609a0211d17f130c1ad3765705c9e22cbac4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::static_engine::collect_static_design_system_findings (cyclomatic 22): impeccable_html::static_engine::collect_static_design_system_findings has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/static_engine.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f4ed357696aa408f2bf402e8fe742d6916139ab4d9e3b027b871f5f3a59ea7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::collect_root_identifiers (cyclomatic 22): impeccable_live::svelte_ast::collect_root_identifiers has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bad3b918d7cb5a94dd1145008e9315bf1592965b9f9b52a2b52ac4741a8983"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_component::parse_css_rules (cyclomatic 22): impeccable_live::svelte_component::parse_css_rules has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a4d3992336d9341fb763f9bf932fd60bcb112ebef7d4584faa9409cc5f748e"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser-ignores.pageCandidates (cyclomatic 22): live-browser-ignores.pageCandidates has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88bc5e62307fd810c97174c59cc0a921969fd31399e834517c44a041d36f50a"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.onAnnotDown (cyclomatic 22): live-browser.onAnnotDown 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":"skill/scripts/live-browser.js"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98d7c990c433d05c6c28c83315bd6950526d0452e535fc795ef99f3e839983c"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.resolveBarAnchor (cyclomatic 22): live-browser.resolveBarAnchor 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":"skill/scripts/live-browser.js"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dd448e88732f5819d730218118441136ff2b44782670e305ee206136506f9c"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.applyEditing (cyclomatic 22): live-browser.applyEditing 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":"skill/scripts/live-browser.js"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"4852af6dc60656e01c0348e6ac4d6b74215140d81d7a6d7f566795c5d64da926"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.renderPendingDockControls (cyclomatic 22): live-browser.renderPendingDockControls has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f609a2d913c99863929a2008c4647ba74d88d11e08b9660b18057648809463f"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.onPendingPillClick (cyclomatic 22): live-browser.onPendingPillClick has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d11c482f3c5a370bd854b9ca21b5963fe5100dcc8e48808c4c6bae1d7c2999"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.showShaderOverlay (cyclomatic 22): live-browser.showShaderOverlay has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9342}}}],"partialFingerprints":{"codehealthFindingId/v1":"48070fdbc32dd265f5ee7c5e69183106f5561836b90b43741647ccdbb088dfef"}},{"ruleId":"D1","level":"warning","message":{"text":"Xn::At (cyclomatic 22): Xn::At has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9244be17717c4f3509fa2310582c65e3b2f8ef45e254a91f954563c4a4c8abc"}},{"ruleId":"D1","level":"warning","message":{"text":"_n::H::ht (cyclomatic 22): _n::H::ht has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97144133d933de5c7a4dcf58f946166b34cbe5eb599ba4f337355ffe52672bc"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_account::setup::payload (cyclomatic 21): impeccable_account::setup::payload has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/setup.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a679cc33ebbd3e78cd9927987dadfc0c97ae1d650d6c1cbe7ce81aff7da568c"}},{"ruleId":"D1","level":"warning","message":{"text":"CdpEntryRenderer::capture_at (cyclomatic 21): CdpEntryRenderer::capture_at has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/entry_capture.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeef95e12b1bbc9cbd73f76a35d25fa3892e8bbc664aa3bb5a863ecd0eabd132"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::loop_connect::connect_one (cyclomatic 21): impeccable::loop_connect::connect_one has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_connect.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d41196cf0ac205ea4f0bc8b68cf3e9a9f6d1b2175d07819769a3ae90aa658a5"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::isolate_dominant (cyclomatic 21): impeccable_comp::font_fingerprint::isolate_dominant has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: impeccable_comp::font_fingerprint::stats (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cccddc841084b23e512ea605cb05e94ee7792bd5d1e135eeaf2d51997745ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_plates_for (cyclomatic 21): impeccable_comp_verbs::build_phase::gate_plates_for has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ed45b646f6c86044144dca38ec2f7a6174fdd0e73560ab97e33d42cb95fdb1"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::component_review::visual_approval::identity (cyclomatic 21): impeccable_context::component_review::visual_approval::identity has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/visual_approval.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"919c3ee36b8f2d6a4ebd5a36577ffac8c5afb7ba6201c4dbc1e1b8a2aa7811ff"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::check_element_design_system_dom (cyclomatic 21): impeccable_core::browser::driver::check_element_design_system_dom has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1034735be2da19299ac98c05932b91b989681292545beb891e1910b09e34a8c3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::ink_paint (cyclomatic 21): impeccable_core::browser::element_checks::ink_paint has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f1d7aa701786853fe1bf7f27642bde50f9d1114d8990f46063ead858432fc7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::ink_plateau_share (cyclomatic 21): impeccable_core::browser::element_checks::ink_plateau_share has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1782132d1779055b4ea709b29fff53451040d27fd643b9b0fff893a8aa23f9ca"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::share_left_by_covering_media (cyclomatic 21): impeccable_core::browser::element_checks::share_left_by_covering_media has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4483}}}],"partialFingerprints":{"codehealthFindingId/v1":"8741de32dcba268e09941ceb46ebfd168c6f5a3c65c592924366b9ec5bd4f6de"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::is_scroller_arrow (cyclomatic 21): impeccable_core::browser::page_checks::is_scroller_arrow has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4454}}}],"partialFingerprints":{"codehealthFindingId/v1":"187fbdb605b9c4b93f86029b20a3ceffa3cc3ee473e854dbc47c26b8421ab535"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::svg_text_scale (cyclomatic 21): impeccable_core::browser::quality::svg_text_scale has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5984ced8ef1d19f8ad6bdd7f1ee9809ed2531c3609add0965c3b12d28032131"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::collect_kicker_candidates_with_elements (cyclomatic 21): impeccable_core::browser::text_collectors::collect_kicker_candidates_with_elements has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4295f49555f678d50ebee3c0f1f0268e0de2290f32d39d53c972784e99e83e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::gradient_geometry::parse_radial_spec (cyclomatic 21): impeccable_core::checks::gradient_geometry::parse_radial_spec has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/gradient_geometry.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa29d1dc5856cb75f71647d50302de028472127380f17d644806f7dcb0b95b4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::rules::check_icon_tile (cyclomatic 21): impeccable_core::checks::rules::check_icon_tile has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eec55b7d15c173730adfe49a906babcfdd4c9a2bc8ea7f037621dfcd37e754"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::text_context::framed_walk (cyclomatic 21): impeccable_core::checks::text_context::framed_walk has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ffedba2e86631a515f6dc930e804ba9c5d20f734340c0c8a59f945db9dbaea"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::design_system::read_workspace_pattern_groups (cyclomatic 21): impeccable_detect::design_system::read_workspace_pattern_groups has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cd2adf65dbcc4c4c6ff17b8ad34a939394e174c72af66a9fa37e4f61e0f883"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::parse_jsx_tag (cyclomatic 21): impeccable_detect::detect_text::parse_jsx_tag has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c44e9709c31e92daf2b0d076d22f5737085e9dffe4ff5034c46c259bdeb598"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::regex_matchers::scan_js (cyclomatic 21): impeccable_detect::regex_matchers::scan_js has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a29b3e0f7754bc91083a1e8e8387070b615113cae97c32d3213a490ec7618eb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::stop_discovery::changed_since (cyclomatic 21): impeccable_hook::stop_discovery::changed_since has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/stop_discovery.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"644b2febc33f8e2ca202672b8588ca8f22a51daa12109a1a3a32dc9cb79b4dbe"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::cascade::rules::extra_specified_expansions (cyclomatic 21): impeccable_html::cascade::rules::extra_specified_expansions has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/rules.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"d003a06ee103643266878dc1a2f78968d3c0a141d8a64382f12d174f506d2f28"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::run_agent_process (cyclomatic 21): impeccable_live::copy_edit_agent::run_agent_process has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4a5e62525397b0bdc3dfb3e6185b01d535524e6ad1e994e0a17c519a4ac193"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::inject::tag_strategy::read_reference (cyclomatic 21): impeccable_live::inject::tag_strategy::read_reference has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/tag_strategy.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c042c8eee2e42196cc9ba48eeb828114957b43e108272a8caafbd79f3f4bb88"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_generate::instructions_for (cyclomatic 21): impeccable_live::live_generate::instructions_for has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"40520709d09e83d75be018c75fd2cfb3a4d83fc85b6bf6bb101c80fa601e902e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::collect_free_identifier_ranges::visit (cyclomatic 21): impeccable_live::svelte_ast::collect_free_identifier_ranges::visit has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"061453e30c74d9970e827e5eaef6de4160c669f6d06f0b0b9fc354d71413e934"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::hook_manifest::copy_provider_hooks (cyclomatic 21): impeccable_skills::hook_manifest::copy_provider_hooks has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b51a90cd27ee8af84ea466412d540ed7009f53e9d1999bb8678ebe553218763"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapRunningAnimations (cyclomatic 21): 15-snapshot.__snapRunningAnimations has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d9ced8e65dd9963a8ed71487bfd0a53bef58316095aa2ccca4889564005159"}},{"ruleId":"D1","level":"warning","message":{"text":"map_inspection.html.select (cyclomatic 21): map_inspection.html.select has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/map_inspection.html"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"603d2cc30b9c4ba8c93540286bc505c3096e16c086faf048cceb0aa9b9e856e5"}},{"ruleId":"D1","level":"warning","message":{"text":"component-review.Xn::Dt (cyclomatic 21): component-review.Xn::Dt has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 3 other methods here (component-review.Xn::Ht, component-review.Xn::ct, component-review.Xn::ot) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87febfc5c987a33824c4aedfc29e16ea373c862ffb601d2335bae160099f19c"}},{"ruleId":"D1","level":"warning","message":{"text":"ext-diff.scanWith (cyclomatic 21): ext-diff.scanWith has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 83, 79, 89). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ext-diff.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef5443af80e428ff614a738f36799628570a920d047cfa5527cf08607a7a9b0"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.hitSiblingInsertGap (cyclomatic 21): live-browser.hitSiblingInsertGap has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef94f0127652315466969b38603f24fd648db9b1f36fb8af8d7f101a386ef52"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-review.mountPlanReview.decisionBar (cyclomatic 21): plan-review.mountPlanReview.decisionBar has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f82ed3fd396a937c95b4c07a7e96440221c36f9e1c90c2ca54a5c839cdec005"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::capture_service::serve (cyclomatic 20): impeccable::capture_service::serve has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4190d48a389a0983743f7c8339ef800f58994855950270eb0015124b3d973c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_common::jsp::win32::parse_root (cyclomatic 20): impeccable_common::jsp::win32::parse_root has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d552c85910f2e8d8aca533c0309460b4fcc356509d9c60b6436a16330eef7037"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_common::jsp::win32::basename_ext (cyclomatic 20): impeccable_common::jsp::win32::basename_ext has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e80bcfb7c8e6a6f550399801e4c899ec30f7374758ae7b83b8946d37dd9135a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::fingerprint (cyclomatic 20): impeccable_comp::font_fingerprint::fingerprint has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: impeccable_comp::font_fingerprint::stats (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e7186f8be323a244d212584f3939e56cb4f3e22dc060601f7f37374d5e20d6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::finish_native_capture (cyclomatic 20): impeccable_comp_verbs::build_phase::finish_native_capture has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1914142b4e2063e8a6659e8dec245fa558372ea8ca027a091cc1337c1b07a241"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::context_cli::automatic_hook_mode (cyclomatic 20): impeccable_context::context_cli::automatic_hook_mode has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"553b45f1e9a30efced4a838ac3c135fbf0febc59dc9c3f61ce0374df257eea8c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::painted_descendant_extents (cyclomatic 20): impeccable_core::browser::element_checks::painted_descendant_extents has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"598580f2d09dd6f09cadadf9eada3906d35f1f58e9154546c29e2b1841f908d2"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_typography (cyclomatic 20): impeccable_core::browser::page_checks::check_typography has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0d7765b7bc6d18a77fd32f0c34dafed3d5f81ac39528518346d0d5289f31d7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::is_field_box (cyclomatic 20): impeccable_core::browser::page_checks::is_field_box has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bad7bb20b90ec8f8bf6cddd00fc4203949ecf5a5ff8957a8d0462e1c3094589"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::rhythm_image_band (cyclomatic 20): impeccable_core::browser::page_checks::rhythm_image_band has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9f23717c493f2efef2d99680e9b5884efc7dce0b5d52b4cc89c03ccf16aed4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::scroller_page_insets (cyclomatic 20): impeccable_core::browser::page_checks::scroller_page_insets has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"74608e240d162b98aa08fa5ba367329c2311b4e7bb1b5a775ab9d9de39fa0e06"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::decorative_text::classify_decorative_text (cyclomatic 20): impeccable_core::checks::decorative_text::classify_decorative_text has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/decorative_text.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ed98117f143376c81a3618cb80f04e49375599893e40869d266a4d760a1291"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::hard_offset_shadow::parse_layer (cyclomatic 20): impeccable_core::checks::hard_offset_shadow::parse_layer has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/hard_offset_shadow.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdca92b975c1925850c0067df0ba6265fd7fb885a38c1d7fc647c5b4917aff3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::row_stripe::scan_css_text_for_row_stripe (cyclomatic 20): impeccable_core::checks::row_stripe::scan_css_text_for_row_stripe has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/row_stripe.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"eece383cedcaf0ba850832e68de487a6678b91eb7c17b4f62ed620b8e79e3951"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::design_system::monorepo_owns_path (cyclomatic 20): impeccable_detect::design_system::monorepo_owns_path has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6387cfe796b78ad60c16f64c43607c01621b03e8f67b23452edeac269574be85"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::find_astro_frontmatter_close (cyclomatic 20): impeccable_detect::detect_text::find_astro_frontmatter_close has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed41db8722e0e6bd0e008a5ea98607da1eff58abd26be40072f8943c27e060e0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::find_css_in_js_templates (cyclomatic 20): impeccable_detect::detect_text::find_css_in_js_templates has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1399f4153fd2fa762e883d112e828f412934c4c99685523d3fb9d6fa1208b22"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::run_regex_matchers (cyclomatic 20): impeccable_detect::detect_text::run_regex_matchers has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfe4a49aa1068f4dc2767f1d8ba7d8d849e0dc94ead540695088f0e8afc1a83"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::css::scan::step_translation (cyclomatic 20): impeccable_foundation::css::scan::step_translation has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3e21f9954e50fbaf014e0f7115f94dd2a0e8619141fced2d914f4e100664c9"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::page::check_page_layout (cyclomatic 20): impeccable_html::page::check_page_layout has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"89eb73241611f4e5829466432be7a4b2022c3cc2a862904612576bbf1d3e98e7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::quality::insulates_side (cyclomatic 20): impeccable_html::quality::insulates_side has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9620f9e33155bb69a13e0b814eb8dcc5f941181c13e91e26af9168e41af301b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::accept_css::merge_level (cyclomatic 20): impeccable_live::accept_css::merge_level has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"effd206842e4ba22eeff3a019330f073f02b618e037e65d7fc1d1066d6da504f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::extract_runner_error_message (cyclomatic 20): impeccable_live::copy_edit_agent::extract_runner_error_message has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"05939e81c70ee432df9c811343d550c87d8f47354edb372ec18fd1c9af3c0bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_complete::complete_cli (cyclomatic 20): impeccable_live::live_complete::complete_cli has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_complete.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"31565b0b66776d847f4d95580912087b4467a313718c02883661aa3849609eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_poll::run (cyclomatic 20): impeccable_live::live_poll::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c42605a70e4b02b8e01e0719a793c01075664bdcce8c390044c40ac5cf7ccd2"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapResolvedAnimationKeyframes (cyclomatic 20): 15-snapshot.__snapResolvedAnimationKeyframes has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1700531f93ada589c881e2538fbc94257753883f32cfc7425741496edd646cf"}},{"ruleId":"D1","level":"warning","message":{"text":"content-script.runScan (cyclomatic 20): content-script.runScan has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 236). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4fed3093c300a7334ada5c7b2fb0952043382474357eeba932117a203ba995"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser-ignores.resolveDetectIgnores (cyclomatic 20): live-browser-ignores.resolveDetectIgnores has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"690dbdc6e8d7337a827b324ad17c6abe0e0c4a00367f31015924fe9afa9d8a14"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.extractContext (cyclomatic 20): live-browser.extractContext 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":"skill/scripts/live-browser.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"771304280c8c4986b5ef4a72c9d7729fde2d368d267d315b06d35422da549356"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.buildCyclingRow (cyclomatic 20): live-browser.buildCyclingRow has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2205b1fb4640d7c97558239d76f1b1b9bdf69afe8dc2391983d005d5921e1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::suppressMany (cyclomatic 20): (anonymous)::suppressMany has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4462b605ee9be69c973801026ebeffb36744a377e173ce89b45ce5a4758d222e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_agents::render::render (cyclomatic 19): impeccable_agents::render::render has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3560e59eccb71bb5ed74831329c97df8f3f644225c6307313e5df600d3c196c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_agents::targets::resource_matches (cyclomatic 19): impeccable_agents::targets::resource_matches has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/targets.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc70602523f1c3224c00b73b391f02efd2e24730fa6b89f948e56c4e50727240"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::write_scaffold (cyclomatic 19): impeccable_comp_verbs::build_phase::write_scaffold has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bdda94b12a38c0a0c0b7d99aca4ea9b93ac230992ec0ac732fe577c35ee7e7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::hero_readings (cyclomatic 19): impeccable_comp_verbs::build_phase::hero_readings has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f818c5f5d02b4034e9bf47f78849ef766f0d9407a972c77b04a0aa99a83b05"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::browser_color_ignore_key (cyclomatic 19): impeccable_core::browser::driver::browser_color_ignore_key has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"245dc4e91c12e6ca571cb556c99b484347ae073a7e547def025d2726efcc4315"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::measure_hidden_text_dom::state_of (cyclomatic 19): impeccable_core::browser::page_checks::measure_hidden_text_dom::state_of has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (impeccable_core::browser::page_checks::measure_hidden_text_dom) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f2a183d04635282ee8357627760376fd8e3edaa008a6c89393907293692f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::laid_out_apart (cyclomatic 19): impeccable_core::browser::page_checks::laid_out_apart has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4284}}}],"partialFingerprints":{"codehealthFindingId/v1":"973a8347d824597cc313e18e1588c836992568405e99402e3bc4afc9d4d6c944"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::painted::buried_by_an_opaque_sibling (cyclomatic 19): impeccable_core::browser::painted::buried_by_an_opaque_sibling has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3d1613248ef21536d6c7d6c1a45c6390b77ec4f67ca0c26fab4f0686f38960"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::drawn_inner_edge (cyclomatic 19): impeccable_core::browser::quality::drawn_inner_edge has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5458b5c9b827dae508305c79e3450ca17c55719bda5c58535731adda08ad55cd"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::check_page_overflow_dom (cyclomatic 19): impeccable_core::browser::quality::check_page_overflow_dom has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"4029c1c5726b88ac9e13657d13dc76d25be8c2c851c7ed2d5aa7eb195a83cb51"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::collect_numbered_section_label_candidates (cyclomatic 19): impeccable_core::browser::text_collectors::collect_numbered_section_label_candidates has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f585d3a1d0454730d09494f37ad153d998231c59bc2580681d0dac5c90a1697"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::unread_paint_layers (cyclomatic 19): impeccable_core::browser::visual::unread_paint_layers has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a48ffac79bca5d73fcac7b3c533229936136c42199bcddd83cc93b84bf80c2"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::html_patterns::repeating_gradient_repeats (cyclomatic 19): impeccable_core::checks::html_patterns::repeating_gradient_repeats has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87e7cfebabbd790d101d0ca028c212556c678918cb0ab2b7fc83c8824adf8a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::value_get_node (cyclomatic 19): Parser::value_get_node has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63dbfcb733ad3f037a930c5cdafbd405ccf212b2c442adfafc1444466820ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::background::gradient_stops_walk (cyclomatic 19): impeccable_html::background::gradient_stops_walk has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/background.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff550994e98f8390659df956797f747981341c463f39d598a302f985a8d9d941"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerState::record_generation_checkpoint (cyclomatic 19): ServerState::record_generation_checkpoint has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4d55e7ff86cbdcde150100cdad70179179d795adf79271a7ce6b3ba66af2ce"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::bake::compound_parts (cyclomatic 19): impeccable_live::bake::compound_parts has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/bake.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb59349daba8a13035a682e22a621c136b4e3371aa397e4b7eca1d4c899694e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::run_copy_edit_post_apply_checks (cyclomatic 19): impeccable_live::copy_edit_agent::run_copy_edit_post_apply_checks has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f02d6bf4ad2bc8987abb618610daca3f820a9ca13689b5d92c825a5f40dea3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::event_validation::validate_manual_edit_event (cyclomatic 19): impeccable_live::event_validation::validate_manual_edit_event has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/event_validation.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"889f09bab1a1c46eb51d400ea5cdea1c89cb6f684e52bfc44ff6dc039b1f902f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_component::extract_matching_source_css (cyclomatic 19): impeccable_live::svelte_component::extract_matching_source_css has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ab661ea83bfd33124e5314f9f41dfcf883c6c2113f12fbf472dc236dcd0e19"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.findLiveElementFromAnchorSnapshot (cyclomatic 19): live-browser.findLiveElementFromAnchorSnapshot has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9dc216d8db2cb6ca5549eadc26bb244673df6eebde43ad5eb719400a63b6fd"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.findLiveElementForOriginalMarkup (cyclomatic 19): live-browser.findLiveElementForOriginalMarkup has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5390}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbc9703f771f5f38ae7e017c0a0cf5450d4468366f51d98732a0ac87760f13b"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.completeSourceInjection (cyclomatic 19): live-browser.completeSourceInjection has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab156393eff94ab07264ba783865bd3a4a58f43c3c344d0f5baf2848dc52e16c"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.buildSvelteExpressionTextMap (cyclomatic 19): live-browser.buildSvelteExpressionTextMap has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6758}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfede8304d8f97673f2f4e78f93a734507b41a569a4aa4a3bb9dbbb168e9ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.updateGlobalBarState (cyclomatic 19): live-browser.updateGlobalBarState has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (sync, a function literal at line 12397, a function literal at line 12415). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":12373}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11978f3e7b5141e1e2071d5407c4473c4a417fe4ed025546d4fe6f490266203"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-review.mountPlanReview.sidePanel (cyclomatic 19): plan-review.mountPlanReview.sidePanel has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae5372ab7be200175e454d026fb22601bb4b3ec74e36f5302500732e1187cdf"}},{"ruleId":"D1","level":"warning","message":{"text":"running_animation_properties (cyclomatic 19): running_animation_properties has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"browser-bundle/10-probe.js"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8919dd1638b02dea7991d0c5a49729fb0333288d7f99a9e4a0e8c94a4006ec55"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 19): (anonymous) has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 9 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_fonts.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae076d3a19dc7deaf677f1fc977c5db0db345d0e18d930fe806191d8d35dd4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Lt (cyclomatic 19): Lt has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 2 belong to 5 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"50012349a94678c5e40667620e1dd2a2f5a1d67318730c9b49ab137dbd99a3a7"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_agents::render::remove_codex_hooks (cyclomatic 18): impeccable_agents::render::remove_codex_hooks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b4de82bd6e443f568fc7bdafcdd4ef894572383ed4567722cb7cf4826ac0f0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::capture_service::request (cyclomatic 18): impeccable::capture_service::request has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab8d1ac832ed80ed5f6ef8c9ed37921255614c281c7a16746f33bfdc402bfbd"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::next_instruction (cyclomatic 18): impeccable_comp_verbs::build_phase::next_instruction has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7376a755c83df2a640a20ab9b0675d96bd04b823ab795263b95bfa798e0ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::completion::report (cyclomatic 18): impeccable_comp_verbs::completion::report has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/completion.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"41363d792706914b2f403ff52011e0d4aa693ed750adc383c7cef2f9dc4e42e1"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::critique_storage::parse_frontmatter (cyclomatic 18): impeccable_context::critique_storage::parse_frontmatter has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c566e88e770a2b0fe1f99d4c441cc4321f369aaf6764b8da21a7d42c56c4b0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::surface_briefs::parse_surface_brief (cyclomatic 18): impeccable_context::surface_briefs::parse_surface_brief has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8acfaa44be228d240ee7e6fca499dc7fa0c04b95124af9cb1f832d67a14590c"}},{"ruleId":"D1","level":"warning","message":{"text":"RenderedTextCount::feed (cyclomatic 18): RenderedTextCount::feed has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6819c2072f5b7269dd57510dff52ef7c0a2ea2a5159c6ba022c4ff450e2b5635"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::driver::computed_paint_applies (cyclomatic 18): impeccable_core::browser::driver::computed_paint_applies has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"909c19de77d5af60a7fc3be3a35ac270ad012a2d43d9db7c9927b22c924e86fe"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::inset_stripe_detail (cyclomatic 18): impeccable_core::browser::element_checks::inset_stripe_detail has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1094f1469dce3aac952e196c4bd17c5f7945a109b7cc09862d8e945d95f0eef"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_glow_dom (cyclomatic 18): impeccable_core::browser::element_checks::check_element_glow_dom has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd297ff0edff830fb6b0058cb9a60e3d19690ba497091ddba60ef31feb022c40"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_layers::covered_by_a_higher_sibling (cyclomatic 18): impeccable_core::browser::text_layers::covered_by_a_higher_sibling has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c996ae4165434536af43084f3c75462082c29bfcd43b8cb913e3368e4aae2a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::rotate_scale_linear (cyclomatic 18): impeccable_core::browser::visual::rotate_scale_linear has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bf0699b409b26d1548db0a4d5a38354813ccc8d3dd5016b2b88774caaa74ea"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::layer_in_box (cyclomatic 18): impeccable_core::browser::visual::layer_in_box has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6fde067b40f8859ab8297b3c90981a29006a263fa045ac4be8f2100c946b6e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::gradient_geometry::tile_box (cyclomatic 18): impeccable_core::checks::gradient_geometry::tile_box has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/gradient_geometry.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef1a308e363937eba0df649ff49fbc7f6f6a54d5d001585a4130065772662ab"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::ignores::parse_value_args (cyclomatic 18): impeccable_detect::ignores::parse_value_args has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fd90ca432e70788575a10d51897e02a57d401ba66396a76f1e6213fa8b58ec"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::admin::add_ignore_value (cyclomatic 18): impeccable_hook::admin::add_ignore_value has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e18ad8ac0786f67961ec0395a6057c6bb42d24abd7e72172a7a0426c697dc04"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::cascade::values::normalize_static_css_value (cyclomatic 18): impeccable_html::cascade::values::normalize_static_css_value has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/values.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"475aa97c1ab6c5443e39007992268dd976eea472216c9aa311e50385b90923ad"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::page::is_output_block (cyclomatic 18): impeccable_html::page::is_output_block has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e9d3033ec47ad110ca858d6627a009255f2be86272ab96accfc31ba03a1a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::quality::is_transparent_wrapper_static (cyclomatic 18): impeccable_html::quality::is_transparent_wrapper_static has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"7122c46a253a2427736bc4cc609d51ce74f6b1c1afb932e310a929a48c515165"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::instructions::instructions_for_event (cyclomatic 18): impeccable_live::instructions::instructions_for_event has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/instructions.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae80f9fde21ebb9e0819824be880b516fa91a2235ba5600edce2fe4a206d04b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::rollback_changed_files (cyclomatic 18): impeccable_live::manual_edits::commit::rollback_changed_files has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fdde517d0a8823b82b78f83ea9b5bf6992a90d56d964a7cc47e99fce60b9ef"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::preflight::build_generation_preflight (cyclomatic 18): impeccable_live::preflight::build_generation_preflight has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/preflight.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0fb207d1ea126222262eec8f4d243f777cd1c3273641e96fad53058d1cd334"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::tail_identifier (cyclomatic 18): impeccable_live::svelte_ast::tail_identifier has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf96661c77a234a87599e66d2e03d151b7e0a6844a684da53e8b412771ce1ec"}},{"ruleId":"D1","level":"warning","message":{"text":"component-review.Xn::Ht (cyclomatic 18): component-review.Xn::Ht has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 3 other methods here (component-review.Xn::Dt, component-review.Xn::ct, component-review.Xn::ot) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ccde6638107baa0058cef2c7bd0ed6f91763cf27c9a1b9f0143c8f26344e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"content-script.analyzeCandidate (cyclomatic 18): content-script.analyzeCandidate has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da7cde6c834614e393aed329a65a968417c3c7b740416bfb57b23e0d9c49017"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.captureElementToBlob (cyclomatic 18): live-browser.captureElementToBlob has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8931}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce6bdb92b01f2683859f09271f6baa8659b369dfe9052820d06d29b68ef0ca6"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.recoverMissedGenerationCompletion (cyclomatic 18): live-browser.recoverMissedGenerationCompletion has cyclomatic complexity 18 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cef5f5c16e952cfc57f2e9175cfc14cb8046e186d6dea6875aea7c9edc2610"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.renderDesignVisual (cyclomatic 18): live-browser.renderDesignVisual has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c3e2d642e274f63f5905a502d1aa3d06bd8b3dce3efcabff168910fc042f3a"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.renderMarkdown (cyclomatic 18): live-browser.renderMarkdown has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13667}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1d40be4daa8b3b073768de8783fdfd2fb6efa19a350beb7d7f62763d5cd12"}},{"ruleId":"D1","level":"warning","message":{"text":"plan-review.mountPlanReview.stage (cyclomatic 18): plan-review.mountPlanReview.stage has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"739ac8cc74504c2ab4c837b06080ba243fdf563f8672390c68cc46841b5368cb"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 385, 358, 397, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85044ebb2f5116950b2a6dfae2cf069cb2a71463c5678838a5d0649eba95a91"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2354997d6ec6a81431a1adef0b1eca2b8dab2085b425ffb0a90a0deace1618"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::layers (cyclomatic 18): (anonymous)::layers has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d994aa22aef4697407d9c80ae35d9004e2ca801e5e5321ed0145280cd304d850"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::picture (cyclomatic 18): (anonymous)::picture has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/raster_coverage.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"6810aa1df240739ec7f5e90f368970af232f087b798f61c4db560749a0043bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"Xn::De (cyclomatic 18): Xn::De has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"13036fc2d93a1cd9cbb65cd660e462930da1bb7cfc33097abe7094cb1807590a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_bridge_helper.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4f46a6a4739dfdc36f89edecc31bcb2d569613c32758cd653c610e6bda76ff"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_browser::cdp::client_error_message (cyclomatic 17): impeccable_browser::cdp::client_error_message has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dffa7d70082f7e1496f936ccb929abb1cc94a0993ef8ad27265ba7cf019417e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_browser::fullpage::capture_element_shots (cyclomatic 17): impeccable_browser::fullpage::capture_element_shots has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd3a323675d22e810a229302f908536e7afc1160881292d4de7e24a2aff1b14"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_common::jsp::win32::resolve (cyclomatic 17): impeccable_common::jsp::win32::resolve has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6300f69b9bff0a6b0b30abb0e6dba51cfaa7cf0e58da63c5284731f263dd786"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp_verbs::comp_diff::run (cyclomatic 17): impeccable_comp_verbs::comp_diff::run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"942d553f47cb8fc28302a36d6f2c64771c5b1ea088fb592a9c34d1bbd71e794f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::serve_question::print_answer (cyclomatic 17): impeccable_context::serve_question::print_answer has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f27fdd93fcd58f06a5ca8f3fb82483913d9bc7969bb722ccb4d2aa3b12610"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::hidden_mockup::subtree_text (cyclomatic 17): impeccable_core::browser::hidden_mockup::subtree_text has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/hidden_mockup.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d944f3581fa7f0935164953b13afb4443bc3f59435847085fb55e1a815a2af"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::page_checks::is_output_block (cyclomatic 17): impeccable_core::browser::page_checks::is_output_block has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e42c2f83132e141fdfdf7718a00a73cf0ec7c07ee71abb0e9250cdea038fe0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::painted::turned_away (cyclomatic 17): impeccable_core::browser::painted::turned_away has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf7558e128c9c28bed47e16bf715f3468466b7f9af082f3ca2711725a165f14"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::painted::keyframe_x (cyclomatic 17): impeccable_core::browser::painted::keyframe_x has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1a4f1f4b3f91473b8429cb740fc877d7a2e683e43401f90521d0ff09efae21"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::visible_y_extent (cyclomatic 17): impeccable_core::browser::quality::visible_y_extent has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f555604d18259206c3efcc8ae8fcf67d7f52539b6961b4c568222330f7e514"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::quality::raster_is_state_layer (cyclomatic 17): impeccable_core::browser::quality::raster_is_state_layer has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee881df62e89ddb832c70fc575d7f4e7bc56fda918e595f49dbc21440ec50ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_layers::background_images (cyclomatic 17): impeccable_core::browser::text_layers::background_images has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8778d598847322e453949501e9febb05d19be0e4f6197b0ecda4be32e4aa60"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_layers::covered_by_a_later_fill (cyclomatic 17): impeccable_core::browser::text_layers::covered_by_a_later_fill has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c50e247208c13226afcff39648e9799d94163c6ce35e727b03ec62b1fc7fade"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::rules::contrast_findings (cyclomatic 17): impeccable_core::checks::rules::contrast_findings has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ccbef0e96ffae78de063faae26785909c94a47956aea273a757168b1846869"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::rules::check_flat_type_hierarchy_samples (cyclomatic 17): impeccable_core::checks::rules::check_flat_type_hierarchy_samples has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0ae58296c4a15de5764f8f57006fa7a4ce1971f94097d66e43a8603df083c3"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::config::parse_color_channel (cyclomatic 17): impeccable_detect::config::parse_color_channel has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb611637434c5070c88d13dbaf672105df763ae3623b3941bc3f67fd7486602"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::detect_text::detect_text (cyclomatic 17): impeccable_detect::detect_text::detect_text has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"96593b55b7fe8a68260544e8ea5246d2e6c96fa3de7f9429664d5f6476abc715"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::css::scan::attr_tag_match_starts (cyclomatic 17): impeccable_foundation::css::scan::attr_tag_match_starts has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"106ea6a1bd6ac8398e6b152d4ce5e1306ae80ccaa55c49a67933b5d42663247c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::hook_lib::resolve_harness (cyclomatic 17): impeccable_hook::hook_lib::resolve_harness has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"620dcad2c552d9d2880ccab2df1009c545c7479e98d493af56adaaa0aad94f93"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_accept::read_source_shadow_preview_meta (cyclomatic 17): impeccable_live::live_accept::read_source_shadow_preview_meta has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"75323d5e5344e15634af4f0c8c4c210fbd5d09e0c03bff9d0a6a00c14c4cf402"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::summarize_repair_failures (cyclomatic 17): impeccable_live::manual_edits::commit::summarize_repair_failures has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce587ac6b0328b3ac24e9c2f13a44792df87011a0ec1b9254887537445fc4746"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::roots::resolve_roots (cyclomatic 17): impeccable_live::roots::resolve_roots has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/roots.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3838b8a6d038b2803475b9514e748d1b0d1f0787f65c0e2de5b2be678dc1ae"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::source_search::walk (cyclomatic 17): impeccable_live::source_search::walk has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/source_search.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a6ac07da134d33f7a5691eb324b5d8240dd419a2abcb503060495f5667e8b5"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::bundle::download_file_capped (cyclomatic 17): impeccable_skills::bundle::download_file_capped has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0ef2fe0d29b8b8799293b1cb7129182d8844fdd10e4f4a22c8f807934e2f06"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.collectEditableTextRows::visit (cyclomatic 17): live-browser.collectEditableTextRows::visit 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":"skill/scripts/live-browser.js"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"571fa0f97aa1f578d982f5a19336d225008a404eb85a3f2fcb987ed73d5a2027"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.handleMouseMove (cyclomatic 17): live-browser.handleMouseMove has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f536bacbc6dbf081aec1fbfb7b6dcc8887cd5c3f73ad8c123bf81f320fe4ea4"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.captureAndEmit (cyclomatic 17): live-browser.captureAndEmit 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":"skill/scripts/live-browser.js"},"region":{"startLine":9002}}}],"partialFingerprints":{"codehealthFindingId/v1":"faff9c5af005aaca4ff7a666fc637ba2cb2b2f45069c0b933cfc7d384af230ee"}},{"ruleId":"D1","level":"warning","message":{"text":"scheduleLazyVisualContrast (cyclomatic 17): scheduleLazyVisualContrast has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c896a4e2efd7d3ba9af882a4e2e41a29c0792def711cce63be2217f8533fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"_n::Ge (cyclomatic 17): _n::Ge has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fd78ffd97304073d652d319eb5930f9a0119d749a2f724329c6486e0d09ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_account::run_whoami (cyclomatic 16): impeccable_account::run_whoami has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e6137ee67ada8734c65811c4b18fd519e752970cf04642f456594bf6349806"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_account::design::metadata (cyclomatic 16): impeccable_account::design::metadata has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/design.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8276d3a096674d3d510ac9b34128c4fabc12dbbd82f07c0225014687b1159949"}},{"ruleId":"D1","level":"warning","message":{"text":"Page::native_pseudo_boxes (cyclomatic 16): Page::native_pseudo_boxes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"13379929ecb90c4904f474bd33e8aced7567e7395720ec69188da0bb1cc5b766"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::loop_connect::disconnect (cyclomatic 16): impeccable::loop_connect::disconnect has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_connect.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8c3ce6df22b47a6af2e657c0936c4c549989c9dd492c3669bcc434a3b7c8be"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable::reviewed_entry::reference (cyclomatic 16): impeccable::reviewed_entry::reference has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/reviewed_entry.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6fada06cd62f59aaeb38f0995a8e303e9e667d8759fbf08263024081a9372f"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::line_metrics (cyclomatic 16): impeccable_comp::font_fingerprint::line_metrics has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: impeccable_comp::font_fingerprint::stats (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b245426ee00bd456ac2a93c64a3958e3b3d3e642eb8c45c5c83a3e6efc33bf"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerState::load_round (cyclomatic 16): ServerState::load_round has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1bf6469e2bc62483353a138e711e7cfd29aef2b015f6fa3d04447e7ae484a0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::context::has_ui_signal (cyclomatic 16): impeccable_context::context::has_ui_signal has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836cf622145bd22cf80d03b6c72ec7952917e17cf9fb25ba5a97069fe23c2df"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::doctor::apply_fixes (cyclomatic 16): impeccable_context::doctor::apply_fixes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/doctor.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cf635c5e07d52a1bdb83f7b1bb4e1dc9714c119f3915b9e027fbce6165e333"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::surface_briefs::resolve_surface_brief_from (cyclomatic 16): impeccable_context::surface_briefs::resolve_surface_brief_from has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6af5a6df18c844278bff2440ce02b856cb541ea2c8afbd93a0684c8a53f15a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_context::telemetry::picker_choice (cyclomatic 16): impeccable_context::telemetry::picker_choice has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/telemetry.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"2876f76968c9475caef643c395730fa243cdbbbf2dc0c0edad1c74f1cd5cca7b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::element_checks::painted_overflow_extent (cyclomatic 16): impeccable_core::browser::element_checks::painted_overflow_extent has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5549}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa95bd05f52133040837ae74831fe8ead6fff13cce3814d92337047df5912316"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::in_an_unpainted_article (cyclomatic 16): impeccable_core::browser::text_collectors::in_an_unpainted_article has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"879b9326ca392043152b66364a6477e2528e725bc2cc6c23a47ca5d1541c6610"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::text_layers::detached_paint (cyclomatic 16): impeccable_core::browser::text_layers::detached_paint has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"294549556aaf97e515842d60bb9873ebe808408bf82471548cd29a3539b21372"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::base_candidate (cyclomatic 16): impeccable_core::browser::visual::base_candidate has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67bb287a2f87a6f81b61f918cd705a08cb1a11a454f25c9e5c89efb1f479ba5"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::browser::visual::gradient_layer_paints_no_surface (cyclomatic 16): impeccable_core::browser::visual::gradient_layer_paints_no_surface has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":3744}}}],"partialFingerprints":{"codehealthFindingId/v1":"e627623aa2a29c5d091b2f750ed085876bfb816ce2db6ddae05f9c1df025d641"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_buried_raster (cyclomatic 16): impeccable_core::checks::css_scan::scan_css_text_for_buried_raster has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"54913c19330871588b1a72005178ce99518e0e48e7d975573066e4a075acedca"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::config::normalize_ignore_value_entries (cyclomatic 16): impeccable_detect::config::normalize_ignore_value_entries has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"373767f7c065d7f327335e43dadadba576779c53ca815afc9b15361d052acaaf"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::design_system::split_top_level (cyclomatic 16): impeccable_detect::design_system::split_top_level has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: impeccable_detect::design_system::yaml_simple_escape (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f8fd752275fa2d6ba0b08b81c5f8f5af8e1afb13da9ecdf498d671329e29b0"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::regex_matchers::split_statements (cyclomatic 16): impeccable_detect::regex_matchers::split_statements has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fec6112e3ce95ed2190d7eb8166071bda5be52ce9c618b11e1e34401c4fcf8"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::regex_matchers::sass_scope_statements (cyclomatic 16): impeccable_detect::regex_matchers::sass_scope_statements has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b1a09781d03ab34924b1faefbc465d905c8fccc388e342928eb7c79221dc4e"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_detect::regex_matchers::analyze_monotonous_spacing (cyclomatic 16): impeccable_detect::regex_matchers::analyze_monotonous_spacing has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb76ec05c29c5aac40271d4bd1cf22c1d59d522fe61da5a5850508e76b913be"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::css::scan::keyframes_move_or_resize (cyclomatic 16): impeccable_foundation::css::scan::keyframes_move_or_resize has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db77eb41434256a86c28d71e598b0a30d7797b80546a16b5408798127af4792"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::fdlibm_trig::rem_pio2 (cyclomatic 16): impeccable_foundation::fdlibm_trig::rem_pio2 has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7065ab1071a18ed71d40a912e83c3b5b210dddea511c5c8dc78d5af4df8295"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::js::number_to_string (cyclomatic 16): impeccable_foundation::js::number_to_string has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"03674b79220e3bc84eb255b3ff169d2590c07ab593da4978f5b17ecbb68aed32"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_foundation::vectors::checks_a::call (cyclomatic 16): impeccable_foundation::vectors::checks_a::call has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/checks_a.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a3ee27b31980186ea8a07153a12a68443fdacaf30f2f53b4d7d692ea57e096"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_hook::hook_lib::expand_scan_targets (cyclomatic 16): impeccable_hook::hook_lib::expand_scan_targets has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf02be967942671c1fe4388f32629e16624baf9ea3e8c6c2282cda28a4443270"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::consume_b (cyclomatic 16): Parser::consume_b has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7d716fd12cae7c2c79fc92af6541c167b05462f2584a3f790bed77729e2452"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::cascade::rules::walk_list (cyclomatic 16): impeccable_html::cascade::rules::walk_list has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/rules.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"0078631b2e8a86e76eba77af2e31eb015743bc9fd76c5b356baee986df7393d2"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_html::page::frames_embedded_content (cyclomatic 16): impeccable_html::page::frames_embedded_content has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"65935fa8e54512397ed5b2ed85735fb25fcc78b510c4eb0f9446ba3467e417e4"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::accept_css::bake_param_values::transform (cyclomatic 16): impeccable_live::accept_css::bake_param_values::transform has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83343ca2a7a61c8b26c010a8944225c6438550ce0600bc5e6f5529a15d6f754"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::accept_css::remove_selector_at (cyclomatic 16): impeccable_live::accept_css::remove_selector_at has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"59391bc9f1566833833358fd932a84e5d45d8cc4e8025738b157dfa03580d11d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::instructions::accept_instructions (cyclomatic 16): impeccable_live::instructions::accept_instructions has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/instructions.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"abda4c34e6837bc02f2fbb4b229c11f9b84f9526f7b38138e30b128c1d5b091d"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::live_server::validate_agent_target_request (cyclomatic 16): impeccable_live::live_server::validate_agent_target_request has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f4390792a4564b2bfc475c7db5325044aecb6cbe0926173a0a3cbc34bbed43"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_live::svelte_ast::collect_pattern_names (cyclomatic 16): impeccable_live::svelte_ast::collect_pattern_names has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00622c7977a15b57d886033debc4858aa0275055d29074355b45e1455e07b7b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::bundle::is_up_to_date (cyclomatic 16): impeccable_skills::bundle::is_up_to_date has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae021d36082740c706c0bb6943f1964edabf5e64bac85948900ca352096a804"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::commands::link (cyclomatic 16): impeccable_skills::commands::link has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"78903f6fdb8ce9698fe6eadf3072b57c3cfa7117791d8cf179eb2d882193691a"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::hook_manifest::repair_stale_hook_manifests (cyclomatic 16): impeccable_skills::hook_manifest::repair_stale_hook_manifests has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bee989892c910d873955bb12984707c5004b4872072ec68461b0bbd948ec0b"}},{"ruleId":"D1","level":"warning","message":{"text":"impeccable_skills::providers::extract_version (cyclomatic 16): impeccable_skills::providers::extract_version has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/providers.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"e807b2020fdfe7e8a43d9294f14f3a5d627cad4e613917ed5d5c0159510db6a8"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapRenderedFaces (cyclomatic 16): 15-snapshot.__snapRenderedFaces has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b4276e97800a5fef5ef563c96fee073ede940d433fef509556d8c34a796310"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapConditionalCssRuleIsActive (cyclomatic 16): 15-snapshot.__snapConditionalCssRuleIsActive has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eb3e033cf4b137d2b03f7cb6c986f85c3203ff056ae8083baa4fe4d9e83424"}},{"ruleId":"D1","level":"warning","message":{"text":"15-snapshot.__snapKeyframes (cyclomatic 16): 15-snapshot.__snapKeyframes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad92feb6f35d3bbada823f42a88a48ad4c18af2c42ebb456e807a38af6b7deb1"}},{"ruleId":"D1","level":"warning","message":{"text":"40-overlay.createImpeccableOverlay.highlight (cyclomatic 16): 40-overlay.createImpeccableOverlay.highlight has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 325, enableCycleMode, a function literal at line 317, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ff483a9a5cc418159cc5aefc2bcaba8d31d77f26ad0275ff84cb5d4cb25758"}},{"ruleId":"D1","level":"warning","message":{"text":"svelte_bridge_helper.rl.on(\u0022line\u0022) (cyclomatic 16): svelte_bridge_helper.rl.on(\u0022line\u0022) has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_bridge_helper.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eeecaae04ede09af5802323e3874b5faba4be8feec4993dc0ef933b32d6e27"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser-dom.createLiveBrowserDomHelpers.syncTopLayerHost (cyclomatic 16): live-browser-dom.createLiveBrowserDomHelpers.syncTopLayerHost has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-dom.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3d513a3b622488b80e998adcd4373b09ce6881af3dee3fae67f7ff936f18e7"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.contextElementForManualEdit (cyclomatic 16): live-browser.contextElementForManualEdit has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71db944180e73ffbb9e2ae3347477ca02864bd7f02b12cad36f2e0c75c78e0a"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.buildInsertConfigureRow (cyclomatic 16): live-browser.buildInsertConfigureRow has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 2582, 2560, 2611, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda951c7b491798fabe1e289ce5f074bb9a366a02310d10a5dbde8b734045a35"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.wrapMixedContentTextNodes (cyclomatic 16): live-browser.wrapMixedContentTextNodes has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3aecaf83af03de0386e9490ec2f7b77397ee8a2aecba646e44dcda171a8340"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.renderEditBadge (cyclomatic 16): live-browser.renderEditBadge has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4961}}}],"partialFingerprints":{"codehealthFindingId/v1":"07987f0b9e307dd8e81bedee56f1f671cea1d12e7522025a63a1ad0999d42b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.cleanup (cyclomatic 16): live-browser.cleanup has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10047}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec764456510c1165b23b9d2ecd77df8de44f3b3f526cbb753116d8b76e579223"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.syncVoiceUi (cyclomatic 16): live-browser.syncVoiceUi has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8b98be0938e19609d192e9f69eb0f060bc473bb3093db1c3d95c5636196416"}},{"ruleId":"D1","level":"warning","message":{"text":"live-browser.teardown (cyclomatic 16): live-browser.teardown has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":12566}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c7d95f5bde4b5c1d3123a4eba847751120b0c625379b437faeb914bba8c18b"}},{"ruleId":"D1","level":"warning","message":{"text":"review.mountComponentReview.render::resizePreview (cyclomatic 16): review.mountComponentReview.render::resizePreview has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (review.mountComponentReview.render) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"446316737c58bce9e14eb9a1999342d5f0d3133a47806bba5d1db758eef99a07"}},{"ruleId":"D1","level":"warning","message":{"text":"createImpeccableOverlay.highlight (cyclomatic 16): createImpeccableOverlay.highlight has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 12 function items inside it that branch (a function literal at line 325, enableCycleMode, _checkLabel, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e4f55bbf0f381f2524ceec16577a8d75a609d316957e5bec4d3d59f37954b"}},{"ruleId":"D1","level":"warning","message":{"text":"ensureOffscreenDocument (cyclomatic 16): ensureOffscreenDocument has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 126, 161, 166, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc81cad60f7d4b6fa3947544ccb6772227c9e22591c701ba76b0fb93e08658f8"}},{"ruleId":"D1","level":"warning","message":{"text":"sendScanToTab (cyclomatic 16): sendScanToTab has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c4471bc6cdb68467ec2659fb888c8cd5f18d1a6bcf4160b200fab94be22434"}},{"ruleId":"D1","level":"warning","message":{"text":"ai (cyclomatic 16): ai has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 1521, a function literal at line 1521, a function literal at line 1521, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5fb63bf57be5ba95dcb5e48620d714d383928bc93f7fec9dd098594207b74f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::check_quality (cognitive 423): impeccable_core::browser::quality::check_quality has cognitive complexity 423 (threshold 15). Drivers by points: if/else 108 (287 pts), boolean chains 98, loops 10 (34 pts), match/switch 3 (4 pts) (nesting depth added 204). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"155bb44c93d5b6d61d1f47371956cb181798da84dfe3785d314ff212bff4b55b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::serve_question::run (cognitive 363): impeccable_context::serve_question::run has cognitive complexity 363 (threshold 15). Drivers by points: if/else 120 (296 pts), boolean chains 39, match/switch 10 (20 pts), loops 4 (8 pts) (nesting depth added 190). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"411cc9c23b19e8afcec9c0c3f1246c25dc237c7e1d18b8266b3659824e045f04"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_text_occlusion_dom (cognitive 253): impeccable_core::browser::page_checks::check_text_occlusion_dom has cognitive complexity 253 (threshold 15). Drivers by points: if/else 95 (185 pts), boolean chains 41, loops 14 (21 pts), match/switch 2 (6 pts) (nesting depth added 101). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee6500d88a56490274940ba377d73ed41f52301cd6645d147e2a6bf56c23440"}},{"ruleId":"D2","level":"warning","message":{"text":"_n::H (cognitive 246): _n::H has cognitive complexity 246 (threshold 15). Drivers by points: ternaries 173, boolean chains 46, if/else 15 (16 pts), other 11 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1023fe246528d97ad7f3e03f9dbb3b32b9f8c02e329fe893a237b09b0e79aea"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_hero_inner (cognitive 220): impeccable_comp_verbs::build_phase::gate_hero_inner has cognitive complexity 220 (threshold 15). Drivers by points: if/else 84 (149 pts), loops 22 (48 pts), boolean chains 20, match/switch 2 (3 pts) (nesting depth added 92). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f03c2272efbc76b23ab9fe3183e784366bc83f1d7eb36347ad6feae7930baf"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::scan_markup_context (cognitive 212): impeccable_detect::regex_matchers::scan_markup_context has cognitive complexity 212 (threshold 15). Drivers by points: if/else 52 (170 pts), boolean chains 25, match/switch 6 (16 pts), loops 1 (nesting depth added 128). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd6127d665559b6c65d0d318f1bf6bbad0bd31fa1a559c12a589438503cef52"}},{"ruleId":"D2","level":"warning","message":{"text":"review.mountComponentReview.render (cognitive 209): review.mountComponentReview.render has cognitive complexity 209 (threshold 15). Drivers by points: boolean chains 80, if/else 66 (78 pts), ternaries 37 (49 pts), loops 2 (nesting depth added 24). Of this number, 106 points are the body\u0027s own statements and 103 belong to 44 function items inside it that branch. 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":"ui/component-review/review.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbc7b9453c50a47368b0cc84ad3c5c9ae4aa101627880a71fd6bbad89005167"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 186): (anonymous) has cognitive complexity 186 (threshold 15). Drivers by points: if/else 42 (69 pts), boolean chains 59, ternaries 22 (34 pts), loops 7 (9 pts), other 9, error handling 4 (6 pts) (nesting depth added 43). Of this number, 80 points are the body\u0027s own statements and 106 belong to 42 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/raster_coverage.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca644fc01a6f544e8797148755f2beb2eccbc7e2af11527998bbefb2f01ea6a5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::quality::check_quality (cognitive 182): impeccable_html::quality::check_quality has cognitive complexity 182 (threshold 15). Drivers by points: if/else 50 (127 pts), boolean chains 49, loops 2 (6 pts) (nesting depth added 81). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6eb07f3e4b0b115252043e217f9664096f6ec7afb8a3df7989230a0948804a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::session::apply_event (cognitive 175): impeccable_live::session::apply_event has cognitive complexity 175 (threshold 15). Drivers by points: if/else 45 (118 pts), match/switch 17 (43 pts), boolean chains 12, loops 2 (nesting depth added 99). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5a26b869eb6569ee12f75ca958ad241505bba2b88cf89908a64bcda203bc76"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::run_with_renderer (cognitive 174): impeccable_comp_verbs::build_phase::run_with_renderer has cognitive complexity 174 (threshold 15). Drivers by points: if/else 64 (133 pts), loops 8 (23 pts), boolean chains 11, match/switch 4 (7 pts) (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed258c42e7f109f479efa9a2e29841de40e029ee8196a4ad777eaab42054232a"}},{"ruleId":"D2","level":"warning","message":{"text":"capture (cognitive 164): capture has cognitive complexity 164 (threshold 15). Drivers by points: if/else 41 (91 pts), boolean chains 25, loops 12 (23 pts), ternaries 8 (17 pts), error handling 3 (8 pts) (nesting depth added 75). Of this number, 162 points are the body\u0027s own statements and 2 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"747e62a1c630aeb449448967911ca523dd72bc804f909876c13f82039f251107"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_colors_dom_in (cognitive 162): impeccable_core::browser::element_checks::check_element_colors_dom_in has cognitive complexity 162 (threshold 15). Drivers by points: if/else 59 (92 pts), boolean chains 50, match/switch 10 (14 pts), loops 2 (6 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6329a68a9b54e253ebad20a59bc4bb6cc978de7cb4cfae1b78ea09a9e305e1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::measure (cognitive 161): impeccable_comp::font_fingerprint::measure has cognitive complexity 161 (threshold 15). Drivers by points: if/else 47 (82 pts), loops 27 (65 pts), boolean chains 12, match/switch 2 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c900655f44bf23e28316b4a13af5c84cda732315d2ba5ac637aa402dc7518c3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::engine::detect_html_source (cognitive 142): impeccable_html::engine::detect_html_source has cognitive complexity 142 (threshold 15). Drivers by points: if/else 41 (115 pts), loops 9 (19 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/engine.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf9cd3b9577c67835befe5443959c4a065073f390cfddf921b68008eb3711e2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::manifest::freeze (cognitive 141): impeccable_context::component_review::manifest::freeze has cognitive complexity 141 (threshold 15). Drivers by points: if/else 44 (95 pts), loops 14 (26 pts), boolean chains 13, match/switch 2 (7 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/manifest.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac95374c82cd78e03437fb3cbf4eeda15274625e7739af45aaf27fc49caf4907"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_heading_rhythm_dom (cognitive 138): impeccable_core::browser::page_checks::check_heading_rhythm_dom has cognitive complexity 138 (threshold 15). Drivers by points: if/else 50 (110 pts), boolean chains 18, loops 8 (10 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc91487418b092abc49309be3cb00820e2d7a1696d22f0541d5431e09ed7336"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::cli::detect_cli (cognitive 134): impeccable_detect::cli::detect_cli has cognitive complexity 134 (threshold 15). Drivers by points: if/else 61 (95 pts), boolean chains 17, match/switch 8 (13 pts), loops 5 (9 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a70023cc3d186ea4276ceb54a03237b3d58e050c3e63fba68506d2c2e994d5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook::run_hook (cognitive 128): impeccable_hook::hook::run_hook has cognitive complexity 128 (threshold 15). Drivers by points: if/else 59 (104 pts), boolean chains 17, match/switch 3 (6 pts), loops 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ced984340e619129845164d97130e1b6b7f36bd947b37d74d5c4da708919238"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::strip_js_comments (cognitive 124): impeccable_detect::detect_text::strip_js_comments has cognitive complexity 124 (threshold 15). Drivers by points: if/else 41 (87 pts), boolean chains 27, loops 3 (10 pts) (nesting depth added 53). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29476299bfa0b31068551f8239bed10b69cf5e7d69632764b4ab8cd34781fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook::run_stop_hook (cognitive 121): impeccable_hook::hook::run_stop_hook has cognitive complexity 121 (threshold 15). Drivers by points: if/else 57 (89 pts), match/switch 6 (12 pts), boolean chains 11, loops 6 (9 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"937d2955abfa0ba4a9ec93d3f95dc70b72b9aea01c394a8de8ebed8bc065fa02"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerState::page (cognitive 119): ServerState::page has cognitive complexity 119 (threshold 15). Drivers by points: if/else 78 (83 pts), boolean chains 25, match/switch 7 (10 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df3de0e35f27ead160720f00439c0c6122fdc2e89971480a3a8ebb16c70ed08"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_generate::run (cognitive 117): impeccable_live::live_generate::run has cognitive complexity 117 (threshold 15). Drivers by points: if/else 48 (85 pts), match/switch 13 (20 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b61cf6067b5cdcdd03510d79332cd07afd0aaed435234e459c94ec0168a39d8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::cli::scan_targets (cognitive 112): impeccable_detect::cli::scan_targets has cognitive complexity 112 (threshold 15). Drivers by points: if/else 22 (68 pts), loops 8 (27 pts), match/switch 4 (13 pts), boolean chains 4 (nesting depth added 74). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90300a2fcb4aa0f4b362bfb6a02d1bd67b81ca83893e6f2bfa84a542621d87c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::fdlibm_trig::kernel_rem_pio2 (cognitive 103): impeccable_foundation::fdlibm_trig::kernel_rem_pio2 has cognitive complexity 103 (threshold 15). Drivers by points: if/else 27 (52 pts), loops 20 (44 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e8e83bbb812e69c612cdf1a46febb955c360883e28c7692619f092e0f9bef0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::config::glob_sync (cognitive 99): impeccable_live::config::glob_sync has cognitive complexity 99 (threshold 15). Drivers by points: if/else 24 (67 pts), loops 5 (13 pts), match/switch 4 (13 pts), boolean chains 6 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/config.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62c44bb30a5244d86c4d12af94a22b178827525965133d0a773756328fe480c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::catalog::validate_concept_catalog (cognitive 97): impeccable_context::catalog::validate_concept_catalog has cognitive complexity 97 (threshold 15). Drivers by points: if/else 43 (80 pts), loops 6 (7 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/catalog.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b748d34e15485b48c16de503a05cbe50edf95fbaede8474a835c12a15baffdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::csstree::tokenizer::tokenize (cognitive 94): impeccable_html::cascade::csstree::tokenizer::tokenize has cognitive complexity 94 (threshold 15). Drivers by points: if/else 34 (70 pts), match/switch 4 (10 pts), boolean chains 7, loops 4 (7 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/tokenizer.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1d22f347919e31bd6ea1ab72ed76f7020d894ea551a1b917e7cc3ef7dbcd2d"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.handleKeyDown (cognitive 92): live-browser.handleKeyDown has cognitive complexity 92 (threshold 15). Drivers by points: if/else 35 (59 pts), boolean chains 21, loops 3 (9 pts), ternaries 2 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fa36c08d54b848960eb29a71aa3f91bd60e650398a77dc1b0df582944b59b8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::concept_seed::render_roll (cognitive 89): impeccable_context::concept_seed::render_roll has cognitive complexity 89 (threshold 15). Drivers by points: if/else 53 (65 pts), boolean chains 10, match/switch 8, loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa36034dbe8b83a7a770e930bd8a61215bfa1e8d586472769027742b1a5d912"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::analyze_node (cognitive 89): impeccable_live::svelte_ast::analyze_node has cognitive complexity 89 (threshold 15). Drivers by points: if/else 34 (78 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"125c5f910cc6180ca0644e6f0c3f572d101222ca8505c605f51016b81ebeeb1a"}},{"ruleId":"D2","level":"warning","message":{"text":"Page::on_event (cognitive 86): Page::on_event has cognitive complexity 86 (threshold 15). Drivers by points: if/else 33 (75 pts), boolean chains 6, match/switch 3 (5 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"3335b5eefd16ab25332659172d9b69b8358df74f49795cbf145c155d87ae954f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::count_repeats (cognitive 82): impeccable_core::browser::driver::count_repeats has cognitive complexity 82 (threshold 15). Drivers by points: if/else 18 (50 pts), loops 17 (25 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1113ea4e99037fe32e59e72153845421bfdba94495e88ffb1cb83bcb792b27b4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::unpainted_walk (cognitive 82): impeccable_core::browser::painted::unpainted_walk has cognitive complexity 82 (threshold 15). Drivers by points: if/else 38 (62 pts), boolean chains 14, match/switch 2 (5 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0cea86d955af0a330a26c5f706d70803a4181db238d97516597e1a69301ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::path_is_rounded_rectangle (cognitive 79): impeccable_core::checks::css_scan::path_is_rounded_rectangle has cognitive complexity 79 (threshold 15). Drivers by points: if/else 29 (51 pts), match/switch 7 (15 pts), boolean chains 7, loops 5 (6 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eef009aeca22355fe740d523d68694ca567652a49a1cadee33df4c76efc036"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::http::read_request (cognitive 78): impeccable_common::http::read_request has cognitive complexity 78 (threshold 15). Drivers by points: if/else 20 (45 pts), loops 7 (17 pts), match/switch 4 (10 pts), boolean chains 6 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/http.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00bb87d22918db1406ea1c956b600af78ca7cc1c3f90f408769346eb6297d91"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::apply::push_batch_in_chunks_and_wait (cognitive 78): impeccable_live::manual_edits::apply::push_batch_in_chunks_and_wait has cognitive complexity 78 (threshold 15). Drivers by points: if/else 17 (33 pts), match/switch 9 (32 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f4355ae169f1cdadd2523e9beee6a3ed414aca2ac7b66c983724ed4d74757c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_pseudo_stripe (cognitive 77): impeccable_core::checks::css_scan::scan_css_text_for_pseudo_stripe has cognitive complexity 77 (threshold 15). Drivers by points: if/else 29 (59 pts), boolean chains 12, match/switch 2 (5 pts), loops 1 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df38c9c621f6431465675d6da4482cde96745493cd7a9c76a30787981ffe42b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::handle_poll_post (cognitive 77): impeccable_live::live_server::handle_poll_post has cognitive complexity 77 (threshold 15). Drivers by points: if/else 38 (58 pts), match/switch 5 (9 pts), boolean chains 6, loops 1 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a03356f43f39fa8b79f43203c37059ba5b763ba2ab0baff7fef8048df9fcb5f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_accept::accept_cli (cognitive 76): impeccable_live::live_accept::accept_cli has cognitive complexity 76 (threshold 15). Drivers by points: if/else 32 (47 pts), match/switch 8 (18 pts), boolean chains 8, loops 1 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"775fa4351745a8489f9e8b1316da0cbbb70f447e5e6c6be02271f258fde14958"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::read_pseudo_gradient_face (cognitive 75): impeccable_core::browser::element_checks::read_pseudo_gradient_face has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (53 pts), loops 5 (12 pts), boolean chains 7, match/switch 1 (3 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"1859808a2a030967756014c8bdfe7e11853a18cfc1aec8f49fe6fccd6c3f032d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::analyze_attributes (cognitive 74): impeccable_live::svelte_ast::analyze_attributes has cognitive complexity 74 (threshold 15). Drivers by points: if/else 19 (62 pts), loops 3 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8b233f6421e7b42510a0d4148a7356c8d676e23ccc5f678021a4e47b36e772"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::restore_svelte_markup::walk (cognitive 74): impeccable_live::svelte_ast::restore_svelte_markup::walk has cognitive complexity 74 (threshold 15). Drivers by points: if/else 15 (50 pts), loops 7 (21 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3eaeec3e3f7f19f5904cf50ec8b9627dbbd45c32af7012ed3784dbeeed9e92"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::collect_repeated_container_text_findings (cognitive 73): impeccable_core::browser::text_collectors::collect_repeated_container_text_findings has cognitive complexity 73 (threshold 15). Drivers by points: if/else 21 (54 pts), loops 7 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53a54df450a8eabdfb84e5f890a13e58aa712bb550c00c60d3d30798fb6aaf9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::css_plan (cognitive 73): impeccable_core::browser::visual::css_plan has cognitive complexity 73 (threshold 15). Drivers by points: if/else 25 (57 pts), match/switch 2 (8 pts), loops 1 (5 pts), boolean chains 3 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"67833be622ce81f3a2e811f646b7bde861c5e9bb9472c02318567c45bc3458c3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_wrap::wrap_cli (cognitive 72): impeccable_live::live_wrap::wrap_cli has cognitive complexity 72 (threshold 15). Drivers by points: if/else 41 (57 pts), loops 3 (7 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_wrap.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e753f2bf60729459cb67720ce1631b689353cf8a5c794cf1e16f76344d10c607"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.resumeSession (cognitive 72): live-browser.resumeSession has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (40 pts), boolean chains 22, ternaries 5 (7 pts), error handling 1 (3 pts) (nesting depth added 16). Of this number, 61 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6af00d12a348d439d0964f86ed939636f09bf5b19cb68a6a6993c34cf8b2bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::handle_manual_edit_route (cognitive 71): impeccable_live::live_server::handle_manual_edit_route has cognitive complexity 71 (threshold 15). Drivers by points: if/else 21 (45 pts), match/switch 10 (24 pts), loops 1 (2 pts) (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":"crates/live/src/live_server.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bfd9681f304b84092cc486d5b633d710af86c3a1332cef9cc7a5e0c6674216"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::commands::install (cognitive 71): impeccable_skills::commands::install has cognitive complexity 71 (threshold 15). Drivers by points: if/else 32 (51 pts), boolean chains 12, match/switch 5 (8 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6aec89969292705fa06857c0dc0b6ce27a0a6f313b1e711c4bd89f9675eb4b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::collect_browser_findings (cognitive 70): impeccable_core::browser::driver::collect_browser_findings has cognitive complexity 70 (threshold 15). Drivers by points: if/else 27 (49 pts), boolean chains 12, loops 7 (9 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc5328939fe76a7d67e693be78074f5ed85c8e0a613f00c378ce111f569ff6f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_inject::inject_cli (cognitive 70): impeccable_live::live_inject::inject_cli has cognitive complexity 70 (threshold 15). Drivers by points: if/else 32 (58 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_inject.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d61bb9da890e1afc99b19f28314a9536d948fe4857077bdd5e6470efe99d6e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::slot_keys_of::visit (cognitive 70): impeccable_live::svelte_ast::slot_keys_of::visit has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (57 pts), loops 3 (8 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8c7da9731cfb1f5700c88cd0cb92f0277c2f948eef4f4c3642740f55429a88"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::font_match::run (cognitive 69): impeccable_comp_verbs::font_match::run has cognitive complexity 69 (threshold 15). Drivers by points: if/else 34 (62 pts), loops 2 (3 pts), boolean chains 2, match/switch 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/font_match.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdaf11e7c44a7e0d834f945ffd0582367b2273458171a518c99f56cec597e91"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::mask_alpha_at (cognitive 68): impeccable_core::browser::painted::mask_alpha_at has cognitive complexity 68 (threshold 15). Drivers by points: if/else 34 (44 pts), loops 5 (9 pts), match/switch 5 (9 pts), boolean chains 6 (nesting depth added 18). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad33fa62994be59f33e73f90f73724cfabc14e8237f056dea335c166ae2dd28"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_radial_halo_with (cognitive 68): impeccable_core::checks::css_scan::scan_css_text_for_radial_halo_with has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (44 pts), match/switch 6 (18 pts), loops 3 (6 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1c09d7bbc442b9d04491037d1ca1314723efeb07583dd3f6af08f86591426a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::critique_storage::run_with_saved (cognitive 67): impeccable_context::critique_storage::run_with_saved has cognitive complexity 67 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 7 (16 pts), boolean chains 10 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8758642e97881fdab0fb474988f7e32e557ddf8e6ac3fd70c19de1daefbd1085"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::unpainted_root_reads_light (cognitive 67): impeccable_core::browser::page_checks::unpainted_root_reads_light has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 17, loops 5 (6 pts), match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d744b17b61ea16b652db95298d1c4bb3d276eca453fa8e198ec3815a921561"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::wrap_common::find_closing_line (cognitive 67): impeccable_live::wrap_common::find_closing_line has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (50 pts), boolean chains 9, match/switch 1 (5 pts), loops 2 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/wrap_common.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5958c0536093d4e1ab082a32f6eb4545f66ee3b835de96ef0c86a132571aa8"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.startVariantObserver (cognitive 67): live-browser.startVariantObserver has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (46 pts), boolean chains 12, ternaries 3 (6 pts), loops 2 (3 pts) (nesting depth added 24). None of this is in the body itself: all 67 points belong to one function literal inside it that branches (line 7258). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7255}}}],"partialFingerprints":{"codehealthFindingId/v1":"04845b111a907b15afdb1b64e114fe846e597c1a7cfe3ebe4df7b2b4c84590b7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::find_lines (cognitive 66): impeccable_comp::font_fingerprint::find_lines has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 14 (22 pts), boolean chains 7 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"405312296ea58391d70d89f2e7244b7516860fe1bcbe42bbd4734b4f7993f4c9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::generate_image::run_with_api_base (cognitive 66): impeccable_context::generate_image::run_with_api_base has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (43 pts), match/switch 8 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcc2b98405e75cd3b79b5dfb01dd7304779c471a0622350fe9fa4ed6c53bc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_edge_flush_cards_dom (cognitive 66): impeccable_core::browser::page_checks::check_edge_flush_cards_dom has cognitive complexity 66 (threshold 15). Drivers by points: if/else 24 (50 pts), boolean chains 8, loops 4 (8 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3810}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7386abbd4dc48b3dc38ade067a13fb89b2a6a71adfb0ee6e826d418f085c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_first_viewport_column_overflow_dom (cognitive 66): impeccable_core::browser::page_checks::check_first_viewport_column_overflow_dom has cognitive complexity 66 (threshold 15). Drivers by points: if/else 24 (52 pts), boolean chains 8, loops 3 (6 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":5516}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb36958a2eb264d23dd71a1bb685ed3e26372b43c5e0946d1fe21bd16910803"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::scan_inset_stripe_css (cognitive 65): impeccable_detect::detect_text::scan_inset_stripe_css has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (52 pts), boolean chains 7, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93f3287c375b9fb49d69682ea61e95c5e26efd05c67288fe477814926876bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::adapters::check_element_colors (cognitive 65): impeccable_html::adapters::check_element_colors has cognitive complexity 65 (threshold 15). Drivers by points: if/else 33 (53 pts), boolean chains 10, loops 1, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"78289664110ed85dac8942b1812130e3f1839cbef382bf1e5c12d2792c370a42"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::resources::apply (cognitive 64): impeccable_agents::resources::apply has cognitive complexity 64 (threshold 15). Drivers by points: if/else 28 (54 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd024e6b160dd81084115f2005d08e0405d7a893b6073c0b39f37453d2eb4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::page::check_repeated_container_text_from_doc (cognitive 64): impeccable_html::page::check_repeated_container_text_from_doc has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 6 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"9563fa39e0f2bc88447f851f7ad76bfb30270e9048f44772e3cfb0e41bd3dd47"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::run_commit (cognitive 64): impeccable_live::manual_edits::commit::run_commit has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (32 pts), loops 10 (18 pts), match/switch 8 (10 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb9ce01342aa8eefc8a3fda493c0325b83fc323c3cf9bc1a29f17da7834d955"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::map_inspection::inspect (cognitive 63): impeccable_comp_verbs::map_inspection::inspect has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (41 pts), loops 10 (14 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/map_inspection.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"7518c1c92e50d9a97cf90aadbaba5ab547c2ddf879ade644e6983e5f4e0cdf40"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::text_descendants_flush_sides (cognitive 63): impeccable_core::browser::quality::text_descendants_flush_sides has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (36 pts), boolean chains 19, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad17741addce8e529ebd27465a2cc75916baf2648b9aa8229a6e3b9acd41acaa"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::html_patterns::check_html_patterns_picking (cognitive 63): impeccable_core::checks::html_patterns::check_html_patterns_picking has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 9 (11 pts), boolean chains 9, match/switch 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f197415f9d93fef1db5a7cabc5aa9a0c32847dbb2a73565f7a1b68ecdc6907"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::event_validation::validate_event (cognitive 63): impeccable_live::event_validation::validate_event has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (45 pts), match/switch 10 (18 pts) (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/event_validation.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09d2c591eb77fdd1b6b0b8181abb3c3ec3a7bd8225de4684cadcab9b486d9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::run (cognitive 63): impeccable_live::live_server::run has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 7 (14 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce71de47de511e129c72f0e3ba9389da3a273598f190f00854c671eca150eb90"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::embed_prompt::run (cognitive 62): impeccable_context::embed_prompt::run has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (42 pts), match/switch 4 (11 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/embed_prompt.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5280338b9e6b96316e52fe88c49f0b6ac8ed7a76d80f4ef0df6652d6b2f89e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::check_source_design_system (cognitive 62): impeccable_detect::design_system::check_source_design_system has cognitive complexity 62 (threshold 15). Drivers by points: loops 11 (32 pts), if/else 10 (28 pts), boolean chains 2 (nesting depth added 39). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bcf92c6807710d832230d4bc2dc3f489ce952b58d85fa6d52d56d7d3590a34"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::color::parse_any_color (cognitive 62): impeccable_foundation::color::parse_any_color has cognitive complexity 62 (threshold 15). Drivers by points: if/else 38 (59 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1562e452c72e950678acd915b40d08ab6f91069f7b2c99b38b6245598aaacb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::blended_echo_over (cognitive 61): impeccable_core::browser::visual::blended_echo_over has cognitive complexity 61 (threshold 15). Drivers by points: if/else 14 (43 pts), loops 5 (13 pts), boolean chains 5 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb23ad41bb12ede505cb84fdb973f65799bc1e56b12da5a8ae8fc685e402432"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::jsx_expression_end (cognitive 61): impeccable_detect::detect_text::jsx_expression_end has cognitive complexity 61 (threshold 15). Drivers by points: if/else 21 (56 pts), boolean chains 4, loops 1 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e757bb9bf4a02d8dd3da3b487e51b1c42a8aa6e00d42ca2dc5752a77fd61b0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::image_source_is_missing (cognitive 61): impeccable_detect::regex_matchers::image_source_is_missing has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 20, loops 7 (15 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7855beca5615ed31b357a7ef1620c4af1b481464a0123273666520dccd21e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::describe_each_item::walk_for_slots (cognitive 61): impeccable_live::svelte_ast::describe_each_item::walk_for_slots has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (42 pts), match/switch 3 (10 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (impeccable_live::svelte_ast::describe_each_item::collect_statics) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4306a5e8d1923e7bfe144f0bd0f36e09a7df52008cd05f9dcb67ab99cba104"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::scan_loaded (cognitive 60): impeccable_browser::scan_loaded has cognitive complexity 60 (threshold 15). Drivers by points: if/else 26 (40 pts), loops 7 (12 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fb8d870c8b41c0cd1f189cf89af0d976b109f7797dcf3eb4b96393ccc4747a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context::has_visual_implementation (cognitive 59): impeccable_context::context::has_visual_implementation has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (41 pts), boolean chains 12, loops 4 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fd3e113d9bcb07d10139ad87c0ee40dfb67e566dd5e60006812c6b07f46f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::staleness_deep::check_hook_installation (cognitive 59): impeccable_context::staleness_deep::check_hook_installation has cognitive complexity 59 (threshold 15). Drivers by points: if/else 22 (47 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness_deep.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"da730161e9f30e60338911f982aa89e7c2813a00bcc7cbd2b7f9d04016202c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::measure_hidden_text_dom (cognitive 59): impeccable_core::browser::page_checks::measure_hidden_text_dom has cognitive complexity 59 (threshold 15). Drivers by points: if/else 32 (64 pts), loops 6 (11 pts), match/switch 3 (8 pts), boolean chains 4 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (impeccable_core::browser::page_checks::measure_hidden_text_dom::state_of) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15a2a035834dd4d04817230b5caf247424881f292131262ec008fe5c7b2a60b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::mask_js_literals (cognitive 59): impeccable_detect::detect_text::mask_js_literals has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (42 pts), boolean chains 8, loops 5, match/switch 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03a5870859e9dc56913779194b62d9064cdf916b1f941ef6e134eefb562fd9b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::js::number_to_string_radix (cognitive 59): impeccable_foundation::js::number_to_string_radix has cognitive complexity 59 (threshold 15). Drivers by points: if/else 18 (39 pts), loops 6 (12 pts), match/switch 1 (6 pts), boolean chains 2 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e04327a1ed356d3c5f91b216de2baffac7c728553c47661afba79814442e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::dirname (cognitive 58): impeccable_common::jsp::win32::dirname has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 4 (13 pts), boolean chains 7 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d610631e97c4d63421d1293ea4abd9d1c720c3a4f857b6b7c6be0789c84cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::advance (cognitive 58): impeccable_comp_verbs::build_phase::advance has cognitive complexity 58 (threshold 15). Drivers by points: if/else 30 (50 pts), boolean chains 8 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"86439a84dbaaeea4f709c240ec9b805c866ecacce39caf599d9d369bcaa3dfa1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::commands::update (cognitive 58): impeccable_skills::commands::update has cognitive complexity 58 (threshold 15). Drivers by points: if/else 29 (43 pts), match/switch 6 (8 pts), boolean chains 7 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8422b4090e4d026c40fc39a392c29e1c98cf9afa9e4aeea2dc7e5bf4725b0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::normalize (cognitive 57): impeccable_common::jsp::win32::normalize has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (35 pts), loops 3 (12 pts), boolean chains 9, match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93db87df17659e2964c1332b4ccf18e17fa2f5b16c1efd199ea260c2bea9b46"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::side_meets_same_fill (cognitive 57): impeccable_core::browser::quality::side_meets_same_fill has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 4 (11 pts), boolean chains 6, match/switch 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd0a9f07f50450dc85aaf1f6985cd19206b1a1317425623e96b91b7096c5073"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_pulsing_dot (cognitive 57): impeccable_core::checks::css_scan::scan_css_text_for_pulsing_dot has cognitive complexity 57 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 5 (8 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"389ff3e3d74b01c47cd1ba83bd08fed5b9355a8e2a317b53efc4397126f8a998"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::merge_level (cognitive 57): impeccable_live::accept_css::merge_level has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (38 pts), loops 5 (13 pts), match/switch 2 (6 pts) (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8585b243ffe64e0b01ec750ee38bb3be22f1735c09696513570579e1732511"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::resources::build_resource_records (cognitive 56): impeccable_agents::resources::build_resource_records has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (34 pts), loops 6 (13 pts), boolean chains 6, match/switch 1 (3 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":"crates/agents/src/resources.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f673e0eef7b247be7f35c45aa38f86e05a59344bb9af45caadc49050522dff"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::signals::git_signals (cognitive 56): impeccable_context::signals::git_signals has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 6 (11 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/signals.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"665d85f1111525a486d2d6cfe3b08fe2fac6cefa2a7f9862c7111813cdff6888"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_inset_stripe (cognitive 56): impeccable_core::checks::css_scan::scan_css_text_for_inset_stripe has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 4 (11 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c015584cf3e51687f7dc96dc6d253215b41e5a2afae2dd881ed8e374cf5723"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::static_engine::collect_static_design_system_findings (cognitive 56): impeccable_html::static_engine::collect_static_design_system_findings has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/static_engine.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70e580973ef216c10445e1deb7a4b20fd2160b95a1135d532a063a3f11d8bae"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::scan (cognitive 56): (anonymous)::scan has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 7 (24 pts), boolean chains 14, if/else 4 (10 pts), loops 4 (8 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e350dd536b740c9961b07565c683973e3957c3bab4b085af78b88768f8a217c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::fullpage::stitch (cognitive 55): impeccable_browser::fullpage::stitch has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (40 pts), loops 3 (7 pts), boolean chains 6, match/switch 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f3343289a3fc5629dde0841bb332ef0d1ca7f729fe6eb8a03b6e557d357cb8"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeComponentCapturer::capture (cognitive 55): NativeComponentCapturer::capture has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 4 (8 pts), boolean chains 7, match/switch 1 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_capture.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"805ba95eeb2f2856b2c76eacc78d0c6f21a13be973e84cd80daf0433a1e956d8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::hero::text_region_check (cognitive 55): impeccable_comp::hero::text_region_check has cognitive complexity 55 (threshold 15). Drivers by points: if/else 25 (48 pts), boolean chains 5, match/switch 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2944c1ef72acab2da86462f328a13b8a6a812116a01f522be5095e99519c0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::pin::run (cognitive 55): impeccable_context::pin::run has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (45 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/pin.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aff5f477c72e11681217436c135d64de535c9109ca92aab4ca77982d7ab097"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::handle_manual_edit_commit (cognitive 55): impeccable_live::live_server::handle_manual_edit_commit has cognitive complexity 55 (threshold 15). Drivers by points: if/else 26 (36 pts), match/switch 9 (13 pts), boolean chains 5, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5f0c284740a2ba5026608b05b6ea451dd912d7f35246702ee3d7f06ac7a795"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::url::parse (cognitive 54): impeccable_context::url::parse has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (38 pts), match/switch 8 (10 pts), boolean chains 5, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/url.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"60763dfb6455d989d90a56dff9937508c2aeba0b6239855f643605cc7a709242"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::pseudo_element_host_selector (cognitive 54): impeccable_core::browser::driver::pseudo_element_host_selector has cognitive complexity 54 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6c5b7728e4583de1f9ed3732e4b981d7c9e90fdfe4f0d1ed50c9b0e8072a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::collect_visual_contrast_reasons (cognitive 54): impeccable_core::browser::visual::collect_visual_contrast_reasons has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 12, loops 3 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"292a73e46f2b3af9498a31d710fafbbb1de1e00d3d799448cc7d3d6e9247e708"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::adapters::check_element_stripe_child (cognitive 53): impeccable_html::adapters::check_element_stripe_child has cognitive complexity 53 (threshold 15). Drivers by points: if/else 30 (43 pts), boolean chains 10 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"aabb79901475de9faa4fd011bc37cfc96d75c69817c5027f6661e97455fb530c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::shorthand::expand_static_declaration (cognitive 53): impeccable_html::cascade::shorthand::expand_static_declaration has cognitive complexity 53 (threshold 15). Drivers by points: if/else 32 (48 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/shorthand.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc48b171db476c0dabd6649be0c02e89924c4e6363c8ab130759a542b8beced"}},{"ruleId":"D2","level":"warning","message":{"text":"Xn::ot (cognitive 53): Xn::ot has cognitive complexity 53 (threshold 15). Drivers by points: if/else 26 (31 pts), boolean chains 22 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3da7fadb231b82c9604178b23691dffc042ec7c78c4a7bb40ffdba93879d5d4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::background::walk_surface (cognitive 52): impeccable_core::browser::background::walk_surface has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (35 pts), boolean chains 8, match/switch 3 (8 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51b2da57edfd0eb56d2d6cf0b4057c1eab3b121ec79c9683d914efb08878886"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_pseudo_stripe_dom (cognitive 52): impeccable_core::browser::element_checks::check_element_pseudo_stripe_dom has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 8, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ae9575b5470acda2f570d077b4d2019fbcc1e98a8ed4bb4e1e2c86c71ff883"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_text_overflow_dom (cognitive 52): impeccable_core::browser::element_checks::check_element_text_overflow_dom has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 7, loops 4 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":6038}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6fd17ae467a52def79ca7c7802025b9ea1ca59cca2d1a51924a33e05ac716e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::handle_connection (cognitive 52): impeccable_live::live_server::handle_connection has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 5 (11 pts), boolean chains 5 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90268a4da256f33184b0c3ad236ccbb2b8422527abc8627c4ee9e6092b0569d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::isolate_dominant (cognitive 51): impeccable_comp::font_fingerprint::isolate_dominant has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed56edf3a1eade9b6e4bee1df517d3337a8f4e333f52f1a50332f02976fb3da"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-review.mountPlanReview.onKey (cognitive 51): plan-review.mountPlanReview.onKey has cognitive complexity 51 (threshold 15). Drivers by points: if/else 26 (31 pts), boolean chains 20 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc3863df826ddd910088788bb37f5e3856f5b0339f24fc9eb75bdce9de21cf55"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::html_patterns::scan_html_for_shape_assembled_illustration (cognitive 50): impeccable_core::checks::html_patterns::scan_html_for_shape_assembled_illustration has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 5 (13 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d233259dd3ba40579cda534fe6d7e2708a42cf831191c0b173870a7e5d7b32"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::css::measures::resolve_var_refs (cognitive 50): impeccable_foundation::css::measures::resolve_var_refs has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/measures.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ebb6c0ac4c4519cd2750e7c09a664678cdef7c673950e5853abefcc3cd06cc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_accept::read_source_shadow_preview_meta (cognitive 50): impeccable_live::live_accept::read_source_shadow_preview_meta has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (34 pts), loops 3 (12 pts), boolean chains 4 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c74d714fee4d4a6efe38672dfbfcfd980951145c6515b3edb04d75e54dbd88"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.injectVariantsFromSource (cognitive 50): live-browser.injectVariantsFromSource has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 9, ternaries 1 (nesting depth added 21). Of this number, 21 points are the body\u0027s own statements and 29 belong to 4 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb5d85381aa0badcc11fbe0d483825f38e907f72ba7b594b44b8f7fcc92f35d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::collect_root_identifiers (cognitive 49): impeccable_live::svelte_ast::collect_root_identifiers has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 4 (11 pts), match/switch 2 (3 pts) (nesting depth added 32). Of this number, 48 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7127d9bc37fad3eca8bf0b9a07e7ac4d8536c6d74cfea2c8d000082a37803f3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::pseudo_paint_placed (cognitive 48): impeccable_core::browser::visual::pseudo_paint_placed has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 11, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92498520473ff596615245003f78e96440d80428a87a73ee49ddeb072ae3860"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::collect_visual_contrast_candidates (cognitive 48): impeccable_core::browser::visual::collect_visual_contrast_candidates has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2430}}}],"partialFingerprints":{"codehealthFindingId/v1":"817cd00bd5e67a67f33d66d917ec464f4c56f725d1cec1bc0ef4dae87c8ff303"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::read_workspace_pattern_groups (cognitive 48): impeccable_detect::design_system::read_workspace_pattern_groups has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (36 pts), loops 4 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a480e80bd65c8d090e99e165b0fdece121c0025811e2aceaf68ddf3975ad86c6"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.buildSveltePropValuesV2 (cognitive 48): live-browser.buildSveltePropValuesV2 has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 16, if/else 7 (14 pts), error handling 3 (11 pts), loops 3 (7 pts) (nesting depth added 19). Of this number, 47 points are the body\u0027s own statements and 1 belongs to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5744}}}],"partialFingerprints":{"codehealthFindingId/v1":"256dd4dff71e681e3ab15fb00860c9e3e6d8314144e737a6050481b1c2e400e4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::basename_ext (cognitive 47): impeccable_common::jsp::win32::basename_ext has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e01a0563566a980d971880b051a4a82b6d50b180dfc66b018037944de0d54a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::store::prepare_bound (cognitive 47): impeccable_context::component_review::store::prepare_bound has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 6 (9 pts), boolean chains 6 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/store.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bfc2883afb4bfab3c07bcd596e22a8cb81244e3da1e5c9b8c548acc9aabac4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::admin::repair_hook_manifests (cognitive 47): impeccable_hook::admin::repair_hook_manifests has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (40 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c3afa4b1ec179934df99e69767156eea113a74ef266a1ad3c2aeb614ba6df6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::util::date_parse_ms (cognitive 47): impeccable_live::util::date_parse_ms has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 3 (9 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/util.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f4a502a1f794adce7f11f9ce40819b9538b751aea23378fe62ee981be7e554"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::asset_capture::capture_page (cognitive 46): impeccable::asset_capture::capture_page has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 10, match/switch 2 (4 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"798fa0c4d8c45bea7de6b6420e0b69dfbfded9f741d7414941e9a912a5dacab2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::write_scaffold (cognitive 46): impeccable_comp_verbs::build_phase::write_scaffold has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (44 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2ea21110b612e754b8c480947853d5e4551494a78b7cc2f2909a1f5bf5395c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_boot::run (cognitive 46): impeccable_live::live_boot::run has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (30 pts), match/switch 6 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_boot.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b66cb38dba6ffe63391d8cf076623d6321b814222f7102a90c8a53f8d0d622b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::collect_free_identifier_ranges::visit (cognitive 46): impeccable_live::svelte_ast::collect_free_identifier_ranges::visit has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 3 (8 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7ba50ffb9508c0504c57c0abc242d561f259afaeda9d5abccc57b1fcb0a9b8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::hook_manifest::copy_provider_hooks (cognitive 46): impeccable_skills::hook_manifest::copy_provider_hooks has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (34 pts), boolean chains 5, match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6be12b5e387e92de248ad1e6971253ed81e5150d318a069656b5bc1a7f83fee"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::relative (cognitive 45): impeccable_common::jsp::win32::relative has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (34 pts), loops 6, boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"499f2dad0d3b5a0707c3576141271320ea7eb8f835769da2d35c072beca0aaea"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::unreferenced_plates (cognitive 45): impeccable_comp_verbs::build_phase::unreferenced_plates has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dab1c710a4538abd567361887945a632bfcc0494877525f6daa06038f23e21"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::verify::capture_intact (cognitive 45): impeccable_context::component_review::verify::capture_intact has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 12, loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/verify.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3d361533699757b7bd0bdb193d0c717caa87e1cd787dc93351609e99603d0e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context_cli::automatic_hook_mode (cognitive 45): impeccable_context::context_cli::automatic_hook_mode has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9ceeeb2177251ae8a8094ea3cdcadd5ef7368a2612cc325ca4420948d7f07e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::roll_selection::select_approved_compositions (cognitive 45): impeccable_context::roll_selection::select_approved_compositions has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 4 (8 pts), match/switch 3 (7 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/roll_selection.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06e4dcf6b3b9fdd2d6b1e9d27d84de3a10d2bc259afc9561ffc228643e1058b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::row_stripe::border_stripe (cognitive 45): impeccable_core::checks::row_stripe::border_stripe has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 4 (8 pts), match/switch 2 (7 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/row_stripe.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"011422a2602a0a3b15a40d866ad86346d0b9f16654f6d509b81151e7ed88fcfd"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::stop_discovery::changed_since (cognitive 45): impeccable_hook::stop_discovery::changed_since has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (38 pts), boolean chains 4, loops 2 (3 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":"crates/hook/src/stop_discovery.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c29f2b7c87e81a86609208c6c901e5be51be1fc99feaf1f691cd3264f667546"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::line_has_object_key (cognitive 45): impeccable_live::manual_edits::commit::line_has_object_key has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (12 pts), boolean chains 9, match/switch 2 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"746e466317d500949e3ef541232440eac277a7bf41dcbcc9d478d259ab99ca97"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::parse_css_rules (cognitive 45): impeccable_live::svelte_component::parse_css_rules has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 4 (7 pts), boolean chains 6 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4071cbce3a88faa2a2f46eed3d49483db706871f463cd1ffde48623208225f3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_responsive_inner (cognitive 44): impeccable_comp_verbs::build_phase::gate_responsive_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 11, loops 3, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cb3157ae1998e33179836c342c298ba72631797c951c7df7b27368363ad648"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::ink_paint (cognitive 44): impeccable_core::browser::element_checks::ink_paint has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (15 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c863e36f32b6831e4ec29c6365972f7c6aeaa8df031da435f8992aac667586"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_context::read_transform (cognitive 44): impeccable_core::checks::text_context::read_transform has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 5, match/switch 1 (2 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":"crates/core/src/checks/text_context.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f21414abf65065c83fac8d0d169888cc96e0ba2d03d6a9191f3cf58617aab18"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::run_regex_matchers (cognitive 44): impeccable_detect::detect_text::run_regex_matchers has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (10 pts), boolean chains 8, match/switch 1 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00bb854011b7237755f620ecd7094de65f6ff30e7f55cfe81cbfe9af78a5519"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::rules::walk_list (cognitive 44): impeccable_html::cascade::rules::walk_list has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (32 pts), loops 3 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/rules.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d01c549151294c084f1e1a1848baf15764b2652f97a080acb7dc5129286578"}},{"ruleId":"D2","level":"warning","message":{"text":"Prompt::checkbox (cognitive 44): Prompt::checkbox has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/prompt.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9060140c54ec8ed93d5695f5322bcee964f7e3cec96dda2e517276f66cd731ae"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::roll_selection::select_approved_challengers (cognitive 43): impeccable_context::roll_selection::select_approved_challengers has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 6 (8 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/roll_selection.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfc3b7924c042cb20cb51f0074c5990d94c451d9b0e06da03a5143433b088c7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_typography (cognitive 43): impeccable_core::browser::page_checks::check_typography has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 2, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61a5658e33d40d3885ae0bb37a7d31417cd4dfe291459802d08c5f17b8ecdc8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::fill_covers_ranked (cognitive 43): impeccable_core::browser::text_layers::fill_covers_ranked has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e3c6cbf3cfe0781ed7754249da908efd2040f2c0fc0dc49358f6794dddd5b9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::scan_js (cognitive 43): impeccable_detect::regex_matchers::scan_js has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 3, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56aba0428676637d7d6116a1e6c7db4b2f5cfa794ac174e164b66ec0f69afd9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::background::gradient_stops_walk (cognitive 43): impeccable_html::background::gradient_stops_walk has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (39 pts), boolean chains 3, loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/background.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f24de93b696f1538b9ca59b30d03ec56094adf9644aabd0047306b71017c81"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::run_agent_process (cognitive 43): impeccable_live::copy_edit_agent::run_agent_process has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 5 (10 pts), loops 3 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5391375745d9807f8215992f1a2cc95bc34edd29e2a0d6e035ae1bb68235ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::handle_events_post (cognitive 43): impeccable_live::live_server::handle_events_post has cognitive complexity 43 (threshold 15). Drivers by points: if/else 27 (38 pts), boolean chains 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c99de2174ee73b54eac3ce632bae3e0f0ea2f7a1297684bbbca825f7861aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::apply::validate_manual_apply_result_message (cognitive 43): impeccable_live::manual_edits::apply::validate_manual_apply_result_message has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 7, boolean chains 6, match/switch 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"620591ae660b16f6a1c7fabf9e5b549a293e330c619db863d113a2f60bbd83ab"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.injectSvelteComponentsFromManifest (cognitive 43): live-browser.injectSvelteComponentsFromManifest has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 22, if/else 12 (14 pts), ternaries 5 (6 pts), error handling 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6052}}}],"partialFingerprints":{"codehealthFindingId/v1":"45386024d28d11d5d96cfe97c1992817af39b9333b1ddbdca0fdf96705c77e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::staleness::check_native_platform_evidence (cognitive 42): impeccable_context::staleness::check_native_platform_evidence has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 3 (5 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91aa12d2ac9e7c3f10292adb4ba3c2fa39d6032fd15368510fdbd0f68666c23"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::brand_surface_colors (cognitive 42): impeccable_core::browser::driver::brand_surface_colors has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 8, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c09cee1f38798d47070a7027b95a23e43629fe15a867212761b1fbae1cfa307"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::run_copy_edit_post_apply_checks (cognitive 42): impeccable_live::copy_edit_agent::run_copy_edit_post_apply_checks has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5842fdeb40e98d42282f664b7046533921e06d9aca3fb1dcaf57c8c71b008e"}},{"ruleId":"D2","level":"warning","message":{"text":"Page::goto (cognitive 41): Page::goto has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 3 (5 pts), boolean chains 2, loops 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"512992193caf44fe70825e9cc4db01afd98259df53193458053161bb71f05674"}},{"ruleId":"D2","level":"warning","message":{"text":"CssHostIndex::new (cognitive 41): CssHostIndex::new has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 4 (8 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"460b8e3138605afa67b949373e63f239b1b210639192ffff545ce0c693487735"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::bundle::is_up_to_date (cognitive 41): impeccable_skills::bundle::is_up_to_date has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 4 (9 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51bebabbc8d6ae483e1ce15c6ecaffba0960a893b093ee17b07f2b8f2a2ebc9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 41): (anonymous) has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 11, loops 5 (6 pts), ternaries 3 (nesting depth added 6). Most of this is not in the body itself: 13 of the 41 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 43, include, a function literal at line 21, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_isolation.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a314f99518a0cdd1b2b5e4de86230d04ff7002f4148a8cd3332d3ad21bdd64"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::parse_root (cognitive 40): impeccable_common::jsp::win32::parse_root has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3 (12 pts), boolean chains 8 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9622fe9f7c71500eff0f583ce348397d7b88c26f96b32a49ba2451c5307e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::finish_native_capture (cognitive 40): impeccable_comp_verbs::build_phase::finish_native_capture has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1f6f93e29b536eebdb7ef4c573516d256a74ba049405b3b4d16887cecf1e07"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::store::submit (cognitive 40): impeccable_context::component_review::store::submit has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 13, loops 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/store.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1df3d1cbaa41a23661ed11d70f17fe0bbd9dd700aaab3e7f36fe84c56c787eb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::page_paints_stock_violet (cognitive 40): impeccable_core::browser::driver::page_paints_stock_violet has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b746a3aa7d9fa6903e376f39c68449c4d20179d538e0164c6a88da056ba500"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::at_point (cognitive 40): impeccable_core::browser::text_layers::at_point has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b60c47596a88ec992922d131f79e0d1750f34f5d5769c9089dd18b9097376b1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::check_borders (cognitive 40): impeccable_core::checks::rules::check_borders has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba18c6b6fd6dbe721221b2dcb7e7e9fb9dd088ceddf690550dd66478833cbc16"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::bake_param_values::transform (cognitive 40): impeccable_live::accept_css::bake_param_values::transform has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 3 (8 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (impeccable_live::accept_css::bake_param_values) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03a2cd1954f86fdbc1b6ca5278e9383e7edc5decd74a81c636aad650eadda8f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::buffer::stage_entry (cognitive 40): impeccable_live::manual_edits::buffer::stage_entry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (29 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/buffer.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6709470fd42d47d77acc2e190db3204dd9e41248a113782f687e55fa9643b2"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-review.mountPlanReview.summary (cognitive 40): plan-review.mountPlanReview.summary has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 21 (35 pts), boolean chains 3, if/else 2 (nesting depth added 14). Of this number, 35 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d9c4fe5dedcf51a68e9f12c2076be9036174979c4fab27708a180ec31ec05c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::server::serve (cognitive 39): impeccable_context::component_review::server::serve has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (7 pts), boolean chains 5, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/server.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"396900825929496cff632c828a76e3f84a029b5e3e9040ed9cd1ba92859be184"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::visual_approval::identity (cognitive 39): impeccable_context::component_review::visual_approval::identity has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/visual_approval.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ade3563f8418255b72cac3fe327ca30639f15de1600a5190bd6bf049e3347"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_inset_stripe_dom (cognitive 39): impeccable_core::browser::element_checks::check_element_inset_stripe_dom has cognitive complexity 39 (threshold 15). Drivers by points: boolean chains 22, if/else 12 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6a300eac41b06d3dd88880e31bf0e623c84658e23433a252ed5d37ac234e92"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::visible_y_extent (cognitive 39): impeccable_core::browser::quality::visible_y_extent has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 5, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"893233e53bb27939fc77c63abe505ce8a0ff87199ffdf8f19d6fcb0f75b54e51"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::blank_css_line_comments (cognitive 39): impeccable_detect::detect_text::blank_css_line_comments has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfd72fdfbc479c6291317b9916f201de4fdb1c30ced38b5cafeab582e37d25a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::find_css_in_js_templates (cognitive 39): impeccable_detect::detect_text::find_css_in_js_templates has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 7 (14 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbe6018d18c5f12b85fe510b18f24f3f1af796d76bf2352506c3abb0a107a87"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::extract_runner_error_message (cognitive 39): impeccable_live::copy_edit_agent::extract_runner_error_message has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 2, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d367c109e5490325acec93723ec8dd8d3f74f663182e1feac683fd721728ff"}},{"ruleId":"D2","level":"warning","message":{"text":"15-snapshot.__snapLastWordRects (cognitive 39): 15-snapshot.__snapLastWordRects has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 8, loops 4 (5 pts), ternaries 1 (nesting depth added 15). Of this number, 26 points are the body\u0027s own statements and 13 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073941328e6dfd29f019880916e5ba5f01c1361231c15227fb6ea9c0b846c48"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.handleManualEditActivity (cognitive 39): live-browser.handleManualEditActivity has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4531}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19c7dc510e76b33c6854c2cbf3e1e81df6425f361342a46bf97355c14de508f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::resolve (cognitive 38): impeccable_common::jsp::win32::resolve has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (35 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca41822dceae7b29f1fa5a66e8edb872bc66ec9db68579d8ab6997b520f51973"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::hero_readings (cognitive 38): impeccable_comp_verbs::build_phase::hero_readings has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (10 pts), boolean chains 5 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5a12e10b45d889dfa92b87001e648b6ea225dff810fd4c5d12c66fb7dbe42f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::run_with_capturer (cognitive 38): impeccable_context::component_review::run_with_capturer has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 10, match/switch 2 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cd603bd817d3f79c0745e4e055920b5c9c8022248f6f51e78e6ffd5e6f1dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context_cli::run_with_hook_repair (cognitive 38): impeccable_context::context_cli::run_with_hook_repair has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (29 pts), match/switch 3 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"96590a0c7324ded4d29a43cc848ad9b095eb5c0480fc78bd79874a218463aa69"}},{"ruleId":"D2","level":"warning","message":{"text":"SafeTagTextSeen::keep_first_keyed_claiming (cognitive 38): SafeTagTextSeen::keep_first_keyed_claiming has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 5 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b436064cc9a6c4df71babd600fc99e3734e25744367d1a40d1f3b3aa53b49162"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::check_element_design_system_dom (cognitive 38): impeccable_core::browser::driver::check_element_design_system_dom has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b886bb01ae9038a8fe56ac603988970738798658c480124fde5591e6acab74"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::config::normalize_ignore_value_entries (cognitive 38): impeccable_detect::config::normalize_ignore_value_entries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f48cbda13b0661cf1ad8314d49a5dd2615126ddafe000387b21d7d02ee5a12"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::an_plus_b (cognitive 38): Parser::an_plus_b has cognitive complexity 38 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"957ee1644b65cf63211236d381511064b3b738a59854987713dcb38d17704155"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::background::walk_surface (cognitive 38): impeccable_html::background::walk_surface has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 9, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/background.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1e5da150209f58ef3f49139647635e3159a8e11f97222ebbcc6eda9064ee08"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::inject::tag_strategy::read_reference (cognitive 38): impeccable_live::inject::tag_strategy::read_reference has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/tag_strategy.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1794146bf0a9a9f0561af43aa0f1597787ae8cfb6113450d9787e81bd7ff50ee"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::hook_manifest::repair_stale_hook_manifests (cognitive 38): impeccable_skills::hook_manifest::repair_stale_hook_manifests has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fcb3443d92cba31fc3d83a2961cd6de8789af1bbce5362c82bf2d07ec31349"}},{"ruleId":"D2","level":"warning","message":{"text":"createImpeccableOverlay (cognitive 38): createImpeccableOverlay has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 6, loops 4, ternaries 1 (nesting depth added 13). Most of this is not in the body itself: 6 of the 38 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 260, 305, 224, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289e1186fdd06491fe501734ec0769a53286d6470e3381baec8e2013250dfdb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::doctor::apply_fixes (cognitive 37): impeccable_context::doctor::apply_fixes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (32 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/doctor.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e03be645b339f8c12b785ef67b147ea412c8bf7e5bdf136c669e75bf795607d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::unread_reading (cognitive 37): impeccable_core::browser::visual::unread_reading has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 5 (6 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6c12d795659abdddd6a092b175d8db3f859cb20f018df2c9c6c60478f124e6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::js::shortest_digits (cognitive 37): impeccable_foundation::js::shortest_digits has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2 (10 pts), boolean chains 3 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5de8a88b8b44cac16d28a27e20ce835a8f6da54dd557c95ab5a02896e46662"}},{"ruleId":"D2","level":"warning","message":{"text":"15-snapshot.__snapPseudoElementHostSelector (cognitive 37): 15-snapshot.__snapPseudoElementHostSelector has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 5 (11 pts), boolean chains 6 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (15-snapshot.__snapPseudoElementHostSelector::consumeFunction) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec28b9b7d6f8a2f9cf10d16033dd16ef2106ff5d0473301e359ac13bb690086"}},{"ruleId":"D2","level":"warning","message":{"text":"component-review.Xn::Dt (cognitive 37): component-review.Xn::Dt has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 16 (33 pts), boolean chains 2, if/else 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (component-review.Xn::it, component-review.Xn::At, component-review.Xn::Ht, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"7628e95c98b46592f9dd2a6189382ed9892394273afbd058556be09b20e06f97"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.cleanup (cognitive 37): live-browser.cleanup has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 1 (4 pts) (nesting depth added 19). Most of this is not in the body itself: 14 of the 37 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 10071, 10097). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10047}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1ae3c4fd0db66184ab1840b79a6633e4e7a8e242bcb1495c4304e82a241fef"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-review.mountPlanReview.decisionBar (cognitive 37): plan-review.mountPlanReview.decisionBar has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 16 (33 pts), boolean chains 2, if/else 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1782ed65a4a6f33856c8c021ebf709a62de909dbefddb2dea19b83fafb104fca"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 37): (anonymous) has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 14, error handling 3 (6 pts), loops 1 (2 pts) (nesting depth added 7). Of this number, 29 points are the body\u0027s own statements and 8 belong to 8 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdce01d9da689d22841f1ec845263fea1663c2919a2cf9eac77970d422c303eb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::component_capture::render_page (cognitive 36): impeccable::component_capture::render_page has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26 (31 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_capture.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b29b0fd213918ae720ea1f447b0a3dece3795868015ca7753020a30f3790c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::spill_meets_another_box (cognitive 36): impeccable_core::browser::element_checks::spill_meets_another_box has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 11, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74264955bc991459ec6a960434688d6e89eea0fea26b853a473bab10be9000c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::closed_container (cognitive 36): impeccable_core::browser::page_checks::closed_container has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 12, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41b8ed80e6719ec61f9ac1a23b92a3b019a3c65cd9c0fa2887914d73249e5a0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::body_text_edge_span (cognitive 36): impeccable_core::browser::quality::body_text_edge_span has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 14, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc98f9df1e8a0abe54d49163f82e45ca36ea788c0279cbacf97f5985646591d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::css::scan::step_translation (cognitive 36): impeccable_foundation::css::scan::step_translation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (12 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec29b9db3310599840ab07923c9b95440609c24fc0fab27268973032204d802"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::css::scan::attr_tag_match_starts (cognitive 36): impeccable_foundation::css::scan::attr_tag_match_starts has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (6 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01ff265701c41de7dbc19ffc1a49e36d6bc9b1ecf3adcc42912dd572a9ee1c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Generator::node (cognitive 36): Generator::node has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 7 (14 pts), boolean chains 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/generator.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6823291924f7850e35414cdf216b18d8b5f0d7bf3575d5947c447e3fe52e09"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::rollback_changed_files (cognitive 36): impeccable_live::manual_edits::commit::rollback_changed_files has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (6 pts), loops 4, 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":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4611f9b64cfecea29fd55b2d6684c42f19383a31ed21f47857f4aea1784dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.resolveBarAnchor (cognitive 36): live-browser.resolveBarAnchor has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 9 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb5d9c9731d7f09789f0f7586075c4bc74e52a54fd23f5b0e0b2d76b7f29239"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.findLiveElementForOriginalMarkup (cognitive 36): live-browser.findLiveElementForOriginalMarkup has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5390}}}],"partialFingerprints":{"codehealthFindingId/v1":"eead5c09e7bf215c5fac2c5335ae97b5e136d34285c11607fb74ef9f986ebf35"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-review.mountPlanReview.sidePanel (cognitive 36): plan-review.mountPlanReview.sidePanel has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 12 (28 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 18). Of this number, 35 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e052a7c176588a55027e1f89075d38246f195d47e7522d71efad9da7f4af8a3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_plates_for (cognitive 35): impeccable_comp_verbs::build_phase::gate_plates_for has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c5cfe03d9c3ed670470be534f65eae41774c9d7bda3a0914268aac6f7b9efa"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::finish_analysis (cognitive 35): impeccable_core::browser::visual::finish_analysis has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":4374}}}],"partialFingerprints":{"codehealthFindingId/v1":"50971b7496d77c4d7e3e34daf75d82151ea9c17c676b4bfc1cc629c16d0a9fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::strip_param_selector (cognitive 35): impeccable_live::accept_css::strip_param_selector has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 1 (5 pts), loops 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"d303c80b304ba020d0790716c0d8472501df91d3e8628109c038905672be8a61"}},{"ruleId":"D2","level":"warning","message":{"text":"KeypressSession::next_key (cognitive 35): KeypressSession::next_key has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 5 (12 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/prompt.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cce7c281081a2b8a255df1b772835ab524fa0c4f185c89bd9349d979d8629a6"}},{"ruleId":"D2","level":"warning","message":{"text":"15-snapshot.__snapRunningAnimations (cognitive 35): 15-snapshot.__snapRunningAnimations has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (7 pts), error handling 3 (5 pts), boolean chains 4 (nesting depth added 15). Of this number, 32 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a2c14d72204ea0eeba1e5474a873d647132f4132ea8de99c83255384e5bb6e"}},{"ruleId":"D2","level":"warning","message":{"text":"component-review.Xn::Ht (cognitive 35): component-review.Xn::Ht has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 12 (28 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 4 other methods here (component-review.Xn::Dt, component-review.Xn::it, component-review.Xn::At, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a8dd1d5e5a6573ea4afe0416d1c0aa04c3f7c662677b4dd551b86945705bd"}},{"ruleId":"D2","level":"warning","message":{"text":"component-review.Xn::ct (cognitive 35): component-review.Xn::ct has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 19 (33 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (component-review.Xn::Dt, component-review.Xn::it, component-review.Xn::At, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb91c2a040748c527255dfb81dcbe03d0d7c86b4f11884fd59f739010d1070f"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.extractContext (cognitive 35): live-browser.extractContext has cognitive complexity 35 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (7 pts), boolean chains 5, error handling 2 (4 pts), ternaries 3 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b13915049d5d21d87c8daa7ca2728a523850b20d903210ab9f717924670fdc5"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-review.mountPlanReview.wire (cognitive 35): plan-review.mountPlanReview.wire has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (26 pts), ternaries 4 (5 pts), boolean chains 4 (nesting depth added 5). Most of this is not in the body itself: 2 of the 35 points are its own statements and the rest belongs to 19 function items inside it that branch (a function literal at line 543, a function literal at line 511, a function literal at line 541, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbf2d018ccfc9fd50edf8278b7febb18f093adfa8668fb1311eeb2a671b9d29"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 35): (anonymous) has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 8, loops 1 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 9 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/60-offscreen.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7f6f1938dbddd3d76a3313b56ac0fecf0f41c22d844ba97e67a0e5cf211cd3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::design::after_scan (cognitive 34): impeccable_account::design::after_scan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 28 (33 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/design.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3cbe19598a0aaad5433adf3193ea98b5813d01b80fd61f6beb4d8050dd27a4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::loop_install::run_inner (cognitive 34): impeccable::loop_install::run_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 6, match/switch 3 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_install.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb8fe16d4a90424d34e642910bea5ced347fcd8e5e07c1005c660fe802573f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::check_layout (cognitive 34): impeccable_core::browser::page_checks::check_layout has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 8, loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"274fcd08b25657d96482fbd41bc3a3f042cc207b56560ff3e7e279ceaaf523de"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::unread_paint_layers (cognitive 34): impeccable_core::browser::visual::unread_paint_layers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab38fe7da36d0324ae6a1b1169dc6df0e0621c88636d561693510fc1d9b68617"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::check_colors (cognitive 34): impeccable_core::checks::rules::check_colors has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 12 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffacf91554f31d633027570b29c746ec1a7d9f18781772200cd1c4a48c10456"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::evidence::find_object_key_matches (cognitive 34): impeccable_live::manual_edits::evidence::find_object_key_matches has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 4 (11 pts), boolean chains 4 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/evidence.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef06015b928758e24d7de9f197b8a6fbca14200f2dbccdc72c7212aa031a00ab"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::rewrite_param_selectors (cognitive 34): impeccable_live::svelte_component::rewrite_param_selectors has cognitive complexity 34 (threshold 15). Drivers by points: if/else 4 (17 pts), match/switch 3 (15 pts), boolean chains 1, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad06492bf5034b9f00d03e44ac10a2350710c3463f811e06ba8187da8988bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.applyEditing (cognitive 34): live-browser.applyEditing has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 6, loops 3 (5 pts), error handling 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":"skill/scripts/live-browser.js"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f693b2c860f92d8cbf568db8a403a61c212fa256a2e0068d495d984059a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::critiques::after_save (cognitive 33): impeccable_account::critiques::after_save has cognitive complexity 33 (threshold 15). Drivers by points: if/else 25 (32 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/critiques.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"094e68bef3cbad8e67b3ca132b7f3039490e35841949b993a40753d91eecc78e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::resources::undo (cognitive 33): impeccable_agents::resources::undo has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (9 pts), match/switch 1 (3 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":"crates/agents/src/resources.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e94e051e5abf97b1b8ac5b55788a750892fce4ccedf2f5652a899ca0c7091b"}},{"ruleId":"D2","level":"warning","message":{"text":"Page::native_pseudo_boxes (cognitive 33): Page::native_pseudo_boxes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5564fe9b2bcb44730b05362fb1c4931daa0a30d00ae406c40d42281e0447534e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::run_visual_contrast_fallback (cognitive 33): impeccable_browser::run_visual_contrast_fallback has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 8, loops 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1000b61f018538e400213e938a2556cc00799f517bdc0ef7a6fd69a1bc00e1e7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::fullpage::capture_element_shots (cognitive 33): impeccable_browser::fullpage::capture_element_shots has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"54009dc73d4439aa47b3467c094be82a995fbd7908e3f9cc49d7cbb6b7077394"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::concept_seed::run (cognitive 33): impeccable_context::concept_seed::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 7 (10 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6844a153225af254f09038cf8dd659c8747e43262cbdcc220b9206c5d033231b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::critique_storage::write_report (cognitive 33): impeccable_context::critique_storage::write_report has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 3 (4 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dabb4c6c8460c7843ed59dd6fc82cedf8bf9cfd1a11f628c58ac12661c7c88a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::surface_briefs::parse_surface_brief (cognitive 33): impeccable_context::surface_briefs::parse_surface_brief has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 3, loops 2 (3 pts), match/switch 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e6dbe651800261759b31b8da8a2c5d435ba53cc32cbe222d0a188a7a659f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::layer_entry_fills (cognitive 33): impeccable_core::browser::element_checks::layer_entry_fills has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 11, match/switch 3 (5 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa17ff2001b723665a6a9492c5c7fbd2361122d8a7fb46044184c9ce13766700"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::buried_by_an_opaque_sibling (cognitive 33): impeccable_core::browser::painted::buried_by_an_opaque_sibling has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d5c83b285e74dba732d31f28e2e12959434b3c770d9368e54591ef5e658771"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_context::fine_print (cognitive 33): impeccable_core::checks::text_context::fine_print has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 13, loops 2 (nesting depth added 6). Of this number, 31 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e30d34f939e93f3b45d956588418124a634ddb8026f30487325b93e6d00dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::sass_scope_statements (cognitive 33): impeccable_detect::regex_matchers::sass_scope_statements has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (7 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":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da9ac0fb1f5648902a6df9a78733cfab13487c1a44f9fa62065d9e580458b46"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::js::scan_decimal_prefix (cognitive 33): impeccable_foundation::js::scan_decimal_prefix has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 12, loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f634657cf59f7944cf620a46294ce50fd1464df0af4cc8f051180cc48c471ba"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_poll::run (cognitive 33): impeccable_live::live_poll::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (11 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c26531959076c0729772573e6c86f843f4dadfbd96e715a9290b2669b67736"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::merge_failed_entries (cognitive 33): impeccable_live::manual_edits::commit::merge_failed_entries has cognitive complexity 33 (threshold 15). Drivers by points: loops 4 (12 pts), match/switch 3 (11 pts), if/else 3 (10 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e827be5c7f5dc125250ddf594b86bca25aa468919e43f61c8c888c78a0a1433"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.buildCyclingRow (cognitive 33): live-browser.buildCyclingRow has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 5 (12 pts), boolean chains 3 (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26974cfaaf53a17747561235ec1071a0f55337aa6edbbb9aa47fb1cc17352b6"}},{"ruleId":"D2","level":"warning","message":{"text":"renderFindings (cognitive 33): renderFindings has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 3 (12 pts), if/else 4 (10 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/devtools/panel.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38347514a55f22e80b73dcaf7ac82ec86497514e687264168c89fff48f91c83"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::validity::classify_with (cognitive 32): impeccable_browser::validity::classify_with has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/validity.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd3a1ab01184985b1d7024b6f20eab686a80d3de00aa8d25db1f2f9f54e14b7"}},{"ruleId":"D2","level":"warning","message":{"text":"CdpAssetRenderer::capture_batch (cognitive 32): CdpAssetRenderer::capture_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, loops 4 (6 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e08996055cf4112618ac0d0f3f17efd5d7715821d82c959d2124eeca5cbc9f2"}},{"ruleId":"D2","level":"warning","message":{"text":"CdpEntryRenderer::capture_at (cognitive 32): CdpEntryRenderer::capture_at has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, loops 3 (4 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/entry_capture.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d131d525a914d7aea695f1c718ae06621c796e253c3968059bba80524532275"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::fingerprint (cognitive 32): impeccable_comp::font_fingerprint::fingerprint has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ecd645c4af2845d49ef361cbd92587cda827cb710fc9f0d3dc0a191ec03fef"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::background::gradient_stops_walk (cognitive 32): impeccable_core::browser::background::gradient_stops_walk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5e6b8c78cf4825a8bc202d8ec4edf365181b5859612ba6c7c8bc54d898e916"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::ai_palette_gradient_hit (cognitive 32): impeccable_core::browser::element_checks::ai_palette_gradient_hit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":3940}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d76f49cf92a281646ce87576da1fba92b825ed8f93b5ffa8af17b305291c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::drawn_inner_edge (cognitive 32): impeccable_core::browser::quality::drawn_inner_edge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (9 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2779155abffecbb06c07e7e6fd7fc7e822fa47de44ee62e992e040d91b8a81b2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::covered_by_a_later_picture (cognitive 32): impeccable_core::browser::text_layers::covered_by_a_later_picture has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 13, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e095f256363177b9fba553dd3e793dd543c969c142d4d833205f503b3c6706"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::stop_baseline::capture (cognitive 32): impeccable_hook::stop_baseline::capture has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/stop_baseline.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43b904829e9ab4b503f8906cda85c510d2f391216a2a102a3453f8c1cb08cea"}},{"ruleId":"D2","level":"warning","message":{"text":"15-snapshot.__snapKeyframes (cognitive 32): 15-snapshot.__snapKeyframes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (10 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c770ae11ef6f25679890c4eece454fe10a2e32f6e1be6143b2a3604b2cb6c0e"}},{"ruleId":"D2","level":"warning","message":{"text":"60-offscreen.chrome.runtime.onMessage.addListener() (cognitive 32): 60-offscreen.chrome.runtime.onMessage.addListener() has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 8, loops 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/60-offscreen.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"896b2f4b1fffdc359bffff8704d14fe8cc7d6af6d2f50b235dca680b75f2b078"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.handleClick (cognitive 32): live-browser.handleClick has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 10 (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":"skill/scripts/live-browser.js"},"region":{"startLine":8212}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a5775da82029d1d21626f9ea7f66ee4fc9bba8d19020627c4b8f4c1c327117"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::capture_service::parse_capture (cognitive 31): impeccable::capture_service::parse_capture has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 7 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bece88b6458317cd342c3c6b9584dfed795030cce5e71d471b4748db9c01bc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::review_groups::issues (cognitive 31): impeccable_comp::review_groups::issues has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/review_groups.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cba3d420d9533bc2a247439758f00f5cf25724739f0040b349717d2b4e7679"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::covering_ground (cognitive 31): impeccable_core::browser::page_checks::covering_ground has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, match/switch 3 (6 pts), loops 4 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf96810691df4ebc90470c3e99da77cf35554d30e073456e7e98f8e82f375e1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::svg_text_scale (cognitive 31): impeccable_core::browser::quality::svg_text_scale has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 6, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56ad5d53e0b7b42a904cb1821908f1130d362f851416c28253dd5872d6a118b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::covered_by_a_later_fill (cognitive 31): impeccable_core::browser::text_layers::covered_by_a_later_fill has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e64d1848682490c9ebface23c6b40896028be4dc5400b458fe2e5127f3c650"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::gradient_geometry::gradient_paint_under_text (cognitive 31): impeccable_core::checks::gradient_geometry::gradient_paint_under_text has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/gradient_geometry.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6157a131a89d99d2b768ae1f7665f8cf3479d44fe5ffde754b4ffe9bed618966"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::vectors_b::call (cognitive 31): impeccable_core::checks::vectors_b::call has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 14 (30 pts), if/else 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_b.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb56a2799ec38715aa7fbf0e9863652b4d95d842e0b60bcd880c3f425bab112"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::config::glob_to_regex (cognitive 31): impeccable_detect::config::glob_to_regex has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (5 pts), match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"1656be53908f8f1fed40b31a5a2792b0399711a46a9fca51c4b3cb10e1a0823e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::find_astro_frontmatter_close (cognitive 31): impeccable_detect::detect_text::find_astro_frontmatter_close has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1670622db52c59bed75336a104a2df5056858ada1d4cff143c64919d4485202"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::fdlibm_trig::rem_pio2 (cognitive 31): impeccable_foundation::fdlibm_trig::rem_pio2 has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cb8827d5b87909f29bba56731265bc5c73a87ff145f34dedae1e0b79d2dbcc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::before_edit::main_flow (cognitive 31): impeccable_hook::before_edit::main_flow has cognitive complexity 31 (threshold 15). Drivers by points: if/else 22, match/switch 4 (6 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb53aaf9b84c65d022b81cc4eb56f6fe4cb7df70fece42108131be548d4e166a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::page::check_page_layout (cognitive 31): impeccable_html::page::check_page_layout has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"79719014da4c770787aeffe6fa1563f2719400cb6a8cffb74769ccb6da69879b"}},{"ruleId":"D2","level":"warning","message":{"text":"service-worker.chrome.runtime.onMessage.addListener() (cognitive 31): service-worker.chrome.runtime.onMessage.addListener() has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 14, loops 1 (2 pts) (nesting depth added 4). Of this number, 25 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"541ab2f97e7b45bb52315e614813f8dd1e9e12fbd8094a3d1ede0ee0e2058679"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.hitSiblingInsertGap (cognitive 31): live-browser.hitSiblingInsertGap has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 9, loops 3 (4 pts) (nesting depth added 11). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"112f34e4fe43424f4e95dec3988427c2d8d90e3e75efae29ffa1d2602c30753f"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.buildSvelteExpressionTextMap (cognitive 31): live-browser.buildSvelteExpressionTextMap has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 13). Of this number, 29 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf6b90878066bf99133957b1e907c0a64173f2aec819f67f11f7f836f4d3abc"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 31): (anonymous) has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), error handling 3 (9 pts) (nesting depth added 14). Most of this is not in the body itself: 11 of the 31 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 385, 358, 397, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c383319f7ba437fb59a9630ef4f4c656d9ab3a2d79cde956b5275a32edbedf40"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::suppressMany (cognitive 31): (anonymous)::suppressMany has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 6, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6018f1e5f6857a3bdf78700b9a086c1a7f78019bb69a9ec8726b81add3610137"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::setup::payload (cognitive 30): impeccable_account::setup::payload has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/setup.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"952d578ef79b4ac3239c7bf7a7ba4345295481ddc141157b64832242807858e6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::render::render_codex_features (cognitive 30): impeccable_agents::render::render_codex_features has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"f932cde195798a7607631de52fe18e6e9066f7a2120fefd04e8bc555dd77b8a9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::gate_spec (cognitive 30): impeccable_comp_verbs::build_phase::gate_spec has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"edac2c229610636bb9e237922eefc43358994c2de8889ff94ea7b662f6e562b3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::concept_seed::ping_chosen (cognitive 30): impeccable_context::concept_seed::ping_chosen has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2abaf946a86fc964ad90d9341b889e5cfc5a2bf753f7ddd0039ce020bb681fa"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::staleness::check_config (cognitive 30): impeccable_context::staleness::check_config has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1969976bccdb8283ed2a10ad8d712dea0792b1902ed396cecf3278bf2893320"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::painted_descendant_extents (cognitive 30): impeccable_core::browser::element_checks::painted_descendant_extents has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 6, match/switch 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5493}}}],"partialFingerprints":{"codehealthFindingId/v1":"77be25ad138ca9aeb7ddf921f773a49cbefcdd14a5fa42dc14312d84c51db13a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_blinking_cursor_dom (cognitive 30): impeccable_core::browser::element_checks::check_element_blinking_cursor_dom has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 11 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":6205}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cfad9c00ac6b4501c1eb6b4cabcb598ed6d2b6a74f2d7d306e44076f0b3d8c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::measured_through (cognitive 30): impeccable_core::browser::visual::measured_through has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 5 (11 pts), boolean chains 1 (nesting depth added 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2917}}}],"partialFingerprints":{"codehealthFindingId/v1":"061438e7885bd0a8526f12a3a4a2d9160694d9beaebc487c576c1a9255041f22"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_glow_with (cognitive 30): impeccable_core::checks::css_scan::scan_css_text_for_glow_with has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f5682f92af9ec45943e422cf718dd31fa501c0192e1df81f078a97ddf8edba"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::scan_css_text_for_buried_raster (cognitive 30): impeccable_core::checks::css_scan::scan_css_text_for_buried_raster has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcad5c5feab7831327c188ca0ced07fdda0a193c54d668d4e2ec723a93309da4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::event_validation::validate_manual_edit_event (cognitive 30): impeccable_live::event_validation::validate_manual_edit_event has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/event_validation.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ce17bf05f731cc60af3d4a1ca1b7242d94b9b05de4f9e9ff2e121384081d08"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::static_classes_of (cognitive 30): impeccable_live::svelte_ast::static_classes_of has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (11 pts), boolean chains 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"366c7502c801c4f7106eadb7aaca2524fe6d84ac7146198349322299c0b62a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::bundle::download_file_capped (cognitive 30): impeccable_skills::bundle::download_file_capped has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bccdb81430fff1df0889e25b4fb5e143ac49b5933d37e0b57ccb2fe60ab266"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::bundle::copy_provider_commands (cognitive 30): impeccable_skills::bundle::copy_provider_commands has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9998c43cada3503c01fdee3c5f4f97cf3e35c0fce496fa2b4a1ac9e3299aaa"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.restoreSessionWithoutWrapper (cognitive 30): live-browser.restoreSessionWithoutWrapper has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 17, if/else 7, ternaries 5 (6 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9885}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b233cd3a984e09c51bde801f55a186eb65a76f36b90b2cd38cf79655ca39a4"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.renderMarkdown (cognitive 30): live-browser.renderMarkdown has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, ternaries 1 (3 pts), loops 1 (nesting depth added 12). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e5b6019860a26eacb898f1ae5649cac95aa1cc9f4809453e4f8c48d304067f"}},{"ruleId":"D2","level":"warning","message":{"text":"__snapResolvedAnimationKeyframes (cognitive 30): __snapResolvedAnimationKeyframes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, error handling 2 (3 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 12). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e9d07570e721b95fbc569e113022f08a2ac6b351f53e6dda9ec6181d87e3f4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::pro::refresh_with (cognitive 29): impeccable_account::pro::refresh_with has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 8 (11 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/pro/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34814af235bb6f16848471499e955eb564cd6f77a6770a18cbd12a6bfbed5a6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::capture_service::serve (cognitive 29): impeccable::capture_service::serve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 4 (9 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15fb67fe7ada2979d22a97e76349ad0117d06d4b9d83ed2732dd5f0ee10b226"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::comp_diff::verdict_for (cognitive 29): impeccable_comp_verbs::comp_diff::verdict_for has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 9 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2449ee173929d904d9e7ee7c43f27d002c43abd03842a11cf412656989cab841"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::critique_storage::parse_frontmatter (cognitive 29): impeccable_context::critique_storage::parse_frontmatter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 2 (6 pts), boolean chains 4, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56089362430236e625118e9dde0c78f1b3d9e2d8e71da22997243c4cccbe606"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderedTextCount::feed (cognitive 29): RenderedTextCount::feed has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 6, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fa7cf7ad2e23507cdca2078808bc4f4afa2d908b3991afcdb612e93d22be42"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::serialize_findings (cognitive 29): impeccable_core::browser::driver::serialize_findings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d23a9043a0681a9dfd9447b1e8eec622b915aa785f8af9570d2536c24fd533f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::browser_color_ignore_key (cognitive 29): impeccable_core::browser::driver::browser_color_ignore_key has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"92aaff8924d28f39ef24143a6ef5a95d40ac4e0745cf3698472b88af77760e85"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::row_stripe::scan_css_text_for_row_stripe (cognitive 29): impeccable_core::checks::row_stripe::scan_css_text_for_row_stripe has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 8, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/row_stripe.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"0279e0234a4aaff162a0854cfe874e4228521d02d50778c47810b0e7c49660a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::consume_b (cognitive 29): Parser::consume_b has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e81ba799795e27b64e0b2c9a3bf86b39b74c88c52bf8c85f4b90919c2dbb661"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::strip_editing_style_attrs (cognitive 29): impeccable_live::copy_edit_agent::strip_editing_style_attrs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (20 pts), match/switch 1 (6 pts), boolean chains 2, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9fffcc65862b403ddba16ade62be4a021bbde9291e9a703acccadd20094e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::design_md::extract_colors (cognitive 29): impeccable_live::design_md::extract_colors has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe02171f794b256f5b12ec437af6df12e0f423e463684343f7b46390fd440a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::matches_id_attr (cognitive 29): impeccable_live::manual_edits::commit::matches_id_attr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"011d79229a20a5f27e9f41709d1a64bf4b8fcd6c9723c6fd1c69948675b915ad"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::extract_matching_source_css (cognitive 29): impeccable_live::svelte_component::extract_matching_source_css has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 5 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"c695ee67340aea8253385f7f8b5e809c12cc7831b3a461cbad446aa412504582"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.onAnnotDown (cognitive 29): live-browser.onAnnotDown has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 5, error handling 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a987f91e3b7eb0e5b23625c03b9a7d00e5af74d1413cf0c8b2e073518dd36173"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.mountSvelteComponentVariant (cognitive 29): live-browser.mountSvelteComponentVariant has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 11, error handling 1, ternaries 1 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef1718f4edf5dab8dee05fd78671a87951f0b7fffe0b3edaea7094923c4c667"}},{"ruleId":"D2","level":"warning","message":{"text":"keyframes (cognitive 29): keyframes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (10 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a193e2c8550290d8781f3fdf4502dab7b7391115e330942fc6561db6abdacb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::render::render (cognitive 28): impeccable_agents::render::render has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c4b5ebd5519a84aec0a0669b45f91f01078ecdacd7a97aed37698391d81e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::line_metrics (cognitive 28): impeccable_comp::font_fingerprint::line_metrics has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d7dea50251aab42b08cfe91903cfc73c93b2b6d0f6bd6be33bd1e8fbdbbdef"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::completion::report (cognitive 28): impeccable_comp_verbs::completion::report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/completion.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f239a8b063816d4ed86066c0b8c364dd48e615342322efac4f7f85ddf0646f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::catalog::validate_concept_entry (cognitive 28): impeccable_context::catalog::validate_concept_entry has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/catalog.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9dc3ad8bc4f3e46297b2c36914e707877758d4ecc47ce710d1d49d7e451c61"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::plan::build (cognitive 28): impeccable_context::component_review::plan::build has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/plan.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4887707b8380dfb2aa10a894962b603d6ced93124769df3f571564894f5cd118"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::html_pattern_items (cognitive 28): impeccable_core::browser::driver::html_pattern_items has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec1131233f662bff7d3520f69f18937a0659290cb927b66e62dea471d38a24d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::measure_hidden_text_dom::state_of (cognitive 28): impeccable_core::browser::page_checks::measure_hidden_text_dom::state_of has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (impeccable_core::browser::page_checks::measure_hidden_text_dom) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3528}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a0b31009b57ddb9432f94573cce0765f358767f7e659148ac23d572fc9915a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::hit_test_layer (cognitive 28): impeccable_core::browser::visual::hit_test_layer has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92b37a7496be42a0dc2b8b26a31e463118aa225094a24fa9f585d76bcbbb326"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_context::framed_walk (cognitive 28): impeccable_core::checks::text_context::framed_walk has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 9, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"da84fa53ccd6999f838320add872965c30581f40b2895352adab2602c4dbba12"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_insert::insert_cli (cognitive 28): impeccable_live::live_insert::insert_cli has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 4, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d435285420d9acc8775191eda6edb834a156de296ab3ee0ae064808ddd7a8f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::inline_svelte_component_accept (cognitive 28): impeccable_live::svelte_component::inline_svelte_component_accept has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 4 (5 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eea8dcfb3e8c511d7e922fa3809155c85c352230538cb44e8b87e3d5e63f35e"}},{"ruleId":"D2","level":"warning","message":{"text":"ext-diff.scanWith (cognitive 28): ext-diff.scanWith has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 8, ternaries 3, loops 1 (nesting depth added 8). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 83, 79, 89). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ext-diff.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"910880a88767a7eb3c089dc63c4ac91d9446cd21fece21274c00d8a0cb5d3d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.drive (cognitive 28): content-script.drive has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (27 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":"extension/content/content-script.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d78ec112b0fae9551c26ecf6772f52e72bdc841d488007d52241328adf8a8e2"}},{"ruleId":"D2","level":"warning","message":{"text":"running_animation_properties (cognitive 28): running_animation_properties has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts), error handling 3 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"73265eeb87b9f8e17fc7631c98e52c9e9e940ac4e3219932a04efb48cbad4a20"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::health::run (cognitive 27): impeccable_account::health::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 6 (10 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/health.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"300eddf9c7c2f451ef873b1c236397c9f896f5299dae088ed209f74f5fcb7d01"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::cli::validate (cognitive 27): impeccable_agents::cli::validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 7, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/cli.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f157086040c3e7d4b100e48c71698c56cab89b9d3f597216922e127056324bfb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::comp_diff::resolve_regions (cognitive 27): impeccable_comp_verbs::comp_diff::resolve_regions has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"338ead9094dfae83c95c59a9e12660b3606e8b92de6b47af2601537bc8bcbcaa"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::doctor::render_text (cognitive 27): impeccable_context::doctor::render_text has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 5 (12 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/doctor.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff47aaf603cc8f244102733c57c76c12cfc4f4c4933780252d27999fd0844364"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::spill_past_painted_box (cognitive 27): impeccable_core::browser::element_checks::spill_past_painted_box has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18, boolean chains 9. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5623}}}],"partialFingerprints":{"codehealthFindingId/v1":"46cbb55b90db1ba7325a387371d0baff8cf366ac716960471760b338aef4b745"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::is_scroller_arrow (cognitive 27): impeccable_core::browser::page_checks::is_scroller_arrow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4454}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7fb4808d1cd3df9047e383ee23498de56a2a5656b6b2b03c5f06537b167f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::clip_outcome (cognitive 27): impeccable_core::browser::painted::clip_outcome has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 12 (13 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1747dc2fdeb7e2083557c537e88d3dacee6d948f2b0b5ae5f7a765b324733aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::declaration (cognitive 27): Parser::declaration has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 1 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"329e127ab115ee4a5dccc4ecfa6c120faab9b73cdd7488c9263d4cede7437b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::adapters::collect_numbered_section_label_candidates (cognitive 27): impeccable_html::adapters::collect_numbered_section_label_candidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b17bc24038ea5cb6aaf5e716e542e95345bc5972649b01ffef8cf46e539851"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::values::normalize_static_css_value (cognitive 27): impeccable_html::cascade::values::normalize_static_css_value has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/values.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c21a11071d873e20f72d8647de294501842b727a840a14fe0b9b340d3e2f0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::project_ignores::collect_project_detector_ignores (cognitive 27): impeccable_live::project_ignores::collect_project_detector_ignores has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/project_ignores.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b833608622db1e3d7c6cd41dc8cfa9dff10ec635bf7892400330e48d516fc8b"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.completeSourceInjection (cognitive 27): live-browser.completeSourceInjection has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 7, ternaries 2 (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6572}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d91e42968b7aceca6da729c9eb7db880d60690e9dbdd5414a78d8d5be9c0f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 27): (anonymous) has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 3 (7 pts), boolean chains 3 (nesting depth added 10). Of this number, 22 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f0d390b31793db6060c3635d13c773118ae71c5d5ac0f762a447aed4c33d4c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 27): (anonymous) has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 2 (7 pts), boolean chains 6, error handling 3 (6 pts), if/else 5 (6 pts), other 2 (nesting depth added 9). Of this number, 26 points are the body\u0027s own statements and 1 belongs to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_bridge_helper.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"085e12ec0c36b0c87c0201db37c13d6175b38f86e0fb8b22af626783de7bc320"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::design::metadata (cognitive 26): impeccable_account::design::metadata has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 9, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/design.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef170247c2a80e2271c659297508ec051c2424d74c2736026d8bddafec5dc118"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::segment (cognitive 26): impeccable_comp::font_fingerprint::segment has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 5 (12 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"920a1eda2172c19324612426ff7066b79c8c5581d2942ecec56a24e73e1fa494"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::source_pixels::is_transformed_copy (cognitive 26): impeccable_comp::source_pixels::is_transformed_copy has cognitive complexity 26 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 4 (8 pts), boolean chains 3 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/source_pixels.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"09615ca7d0344fbbcc6c669ef4781b06202866ad4bd865287e01e8818994568d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::comp_diff::run (cognitive 26): impeccable_comp_verbs::comp_diff::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 6 (10 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"819e768e4fe3de5a012a343c82eb12db19a2b98b8db2411e359c0ed4d1b07d15"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::decorative_text::site_names (cognitive 26): impeccable_core::browser::decorative_text::site_names has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/decorative_text.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69911075e4b03f86e1c1e581c95d1582650d739b865166d9e739b049a0775fc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::ink_plateau_share (cognitive 26): impeccable_core::browser::element_checks::ink_plateau_share has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (7 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51be5014ec9b4feff2b0e1eef57b0c256af3f977506dd05958944e550fcc856"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::scroller_page_insets (cognitive 26): impeccable_core::browser::page_checks::scroller_page_insets has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 10, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3763}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aec7ae3ba6eec22d03a25278450bafa3f53cb3e96a3827472ccdb1ef5001140"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::collect_kicker_candidates_with_elements (cognitive 26): impeccable_core::browser::text_collectors::collect_kicker_candidates_with_elements has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 7, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21bd7c14f22f3b34e6625bda64cef9d8eac2dff559f7c4b0de7bf3ac4f481d8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::covered_by_a_higher_sibling (cognitive 26): impeccable_core::browser::text_layers::covered_by_a_higher_sibling has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"41963022116206c9ad3e96f657f0c86277a394223fc4ebcbe2d0163f08ffe008"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::add_sidecar_radii (cognitive 26): impeccable_detect::design_system::add_sidecar_radii has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"55786508971003160ed961070ae0fd26e1ca3228a311f1325faf96f07b2116e7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::find_design_root (cognitive 26): impeccable_detect::design_system::find_design_root has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"0febb24dbca1ab6999235bce72a5a87c64427bf484143e2dd7acd21e56249ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::admin::add_ignore_value (cognitive 26): impeccable_hook::admin::add_ignore_value has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"43141a463968cccb63154d3404b9e30f2c2c2ad871100fd6a128175e0bc1ff8b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook_lib::expand_scan_targets (cognitive 26): impeccable_hook::hook_lib::expand_scan_targets has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dac660f01a51faef76cb10d88e86a6535c8ab9acf582ed69c81f6e474a62692"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::config::segment_regex (cognitive 26): impeccable_live::config::segment_regex has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/config.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec51845a6819455536cf81e1f47c5970f82ff0efafaef6bacc9f297d1de4452"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_complete::complete_cli (cognitive 26): impeccable_live::live_complete::complete_cli has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (5 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_complete.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6a6f097095d3b9b230f3429285ca38053cc5fa2114f06358b3929d5af8f04a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::stop (cognitive 26): impeccable_live::live_server::stop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fca0c2bbb148e58e539ed9ea3302f3c1a0c27776f8b2c0977bb4a2f64ddc561"}},{"ruleId":"D2","level":"warning","message":{"text":"15-snapshot.__snapLinkedStylesheetText::appendRules (cognitive 26): 15-snapshot.__snapLinkedStylesheetText::appendRules has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, loops 2 (5 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1faba56d07b1124fe8cef4680d218c25b5a18c4d4e549ae8a6f699b01ba4c4"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser-ignores.pageCandidates (cognitive 26): live-browser-ignores.pageCandidates has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (6 pts), boolean chains 5, ternaries 3 (5 pts), error handling 1 (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee794cbb0f0594f493b13e3d2031226392ef48468fcc094f2b37831413c2b97"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser-ignores.resolveDetectIgnores (cognitive 26): live-browser-ignores.resolveDetectIgnores has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 9, ternaries 3 (4 pts), loops 1 (nesting depth added 7). Of this number, 23 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e883503a8599fabee6073835e76d9912707f426106b0db438531ba6d8058451"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.buildParamsPanel (cognitive 26): live-browser.buildParamsPanel has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 4 (6 pts), boolean chains 4, loops 1 (nesting depth added 12). Of this number, 17 points are the body\u0027s own statements and 9 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3902f4c51e8f27c171b5fbf310b5031cf76fa5ea31086c9bfdca70ee437abb"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.stripSvelteBlockRegions (cognitive 26): live-browser.stripSvelteBlockRegions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5834}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e367c66ad465c16152a2fc717c1290e4ee3b96087366b4545452504cd1d0f91"}},{"ruleId":"D2","level":"warning","message":{"text":"keyframe_keys (cognitive 26): keyframe_keys has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d995697ffb247c349b8435fb84715238cb12733d13d3014e9ca0f6f0234859c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::mcp::preflight_mcp (cognitive 25): impeccable_agents::mcp::preflight_mcp has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/mcp.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce3f147a7e6c5eefd2d2cf870372a4b37d79daa85686a1aae3b1d5bbab69587"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::entry_capture::capture_text_only (cognitive 25): impeccable::entry_capture::capture_text_only has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/entry_capture.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"146e45929d4ce64aceea10d3c881101de41703acf5328187c572a0234227d02a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_fingerprint::binarize (cognitive 25): impeccable_comp::font_fingerprint::binarize has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8aae4eb06dfcba3b7d2001ff0c77f7b6279047e2fdcdf6e77d8a38432ef0a35"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::design_parser::unescape_yaml_double_quoted (cognitive 25): impeccable_context::design_parser::unescape_yaml_double_quoted has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfa4ee7b68a6c65263423cb775d183ea32e87ecb667201dc5e3006022178d50"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::hook_markers::strip_json_comments (cognitive 25): impeccable_context::hook_markers::strip_json_comments has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/hook_markers.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b50ff3183e3606414a5762392a340a6c93c64e62fc8ffb1e84c23ac79d123f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::widest_holding_text (cognitive 25): impeccable_core::browser::quality::widest_holding_text has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":3460}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9190d8bb7ad199c43692bbae00ade45f7a31eb99779622c8ad1dd4b1abfc11c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::check_page_overflow_dom (cognitive 25): impeccable_core::browser::quality::check_page_overflow_dom has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 2 (3 pts), match/switch 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf4a7613e69deafccc210b5d1dfd5417faf7b6501458fe66f10fc938843a579"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::collect_numbered_section_label_candidates (cognitive 25): impeccable_core::browser::text_collectors::collect_numbered_section_label_candidates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff75d0a73fa854cd61375a31a892491f767c7776364e6829c6d8df39f1e3ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::hard_offset_shadow::parse_layer (cognitive 25): impeccable_core::checks::hard_offset_shadow::parse_layer has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/hard_offset_shadow.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b28b3fc6f70923c382a990035d24df0a6468a34fc9665a3bd7a78e5cddea95"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::html_patterns::repeating_gradient_repeats (cognitive 25): impeccable_core::checks::html_patterns::repeating_gradient_repeats has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (6 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a43246da3f1a5781e6f00580d10eb211f8830990d3f2dadb0623252ad7204a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook::run (cognitive 25): impeccable_hook::hook::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 3 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"477c7040253fb18e5b75789b687a6a1c16ffe43d48907efaea1297f55034c0c4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::remove_selector_at (cognitive 25): impeccable_live::accept_css::remove_selector_at has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcaf19e8031c353014ed02c62e08e7aa57ea6f44549a099d215579cf5417afb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::collect_all_selectors (cognitive 25): impeccable_live::accept_css::collect_all_selectors has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (16 pts), match/switch 3 (8 pts), if/else 1 (nesting depth added 15). Of this number, 18 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"30264eb9bb7ef64a1c99efe1a9c7c1c1df2dbd63c447df7eb239af612144f77e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::bake::compound_parts (cognitive 25): impeccable_live::bake::compound_parts has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/bake.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68a7d6b3ed9fb1746fbe918308d442265a646df33e1ebd7b9fd3f0a62fc37ee"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::design_md::unescape_yaml_double_quoted (cognitive 25): impeccable_live::design_md::unescape_yaml_double_quoted has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6aa662e049a7af54029c1d92831b0ce789afa37f3160439a9e3924ca7c3eed9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::design_md::extract_named_rules (cognitive 25): impeccable_live::design_md::extract_named_rules has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 4 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07d0ea0c9b7d6fa42ed5b2d86aa12ef93cdf1d2352a404ffbdf4c8289c74e1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::roots::resolve_roots (cognitive 25): impeccable_live::roots::resolve_roots has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 5, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/roots.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b2c096af2d34ca7cd089884411bc26aa20a2060096c7a24cad5235cfa97046"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::source_search::walk (cognitive 25): impeccable_live::source_search::walk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/source_search.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6067cb12eb434f21b972cf4bc3fbbc753e8189fc9ed71471fba55cec16bd02b"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.buildDots (cognitive 25): live-browser.buildDots has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 9 (20 pts), boolean chains 2, if/else 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a01048dc1eb546b53d36cd9a0ec285202f596c44c7a52b481dbf7f4b7e1fb9"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.showShaderOverlay (cognitive 25): live-browser.showShaderOverlay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), error handling 4 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 4). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9342}}}],"partialFingerprints":{"codehealthFindingId/v1":"009d15adee89fcd0ebac9a2f96c5c5472f08025857bad42c5c53dc2bd7463a97"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::layers (cognitive 25): (anonymous)::layers has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"15922d0f1bdafe4653b5a563cb4a74c7d48e3d291c234f85e72ca6e97b1ef2dc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::targets::resource_matches (cognitive 24): impeccable_agents::targets::resource_matches has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/targets.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a3237a131952e0eb4c9160e50777173ea954a3f3461ee8243146a19237236a"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlayReport::merge (cognitive 24): OverlayReport::merge has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/overlays.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28385c1c842aacd5be20579bd3cd64d5ca9758014c05854f99c3cb4e87076cc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::join (cognitive 24): impeccable_common::jsp::win32::join has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d488bea268b329e0a8d1aa1162e97160a0ec44ba82ddc9897bfdf887c382a2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::raster::resize (cognitive 24): impeccable_comp::raster::resize has cognitive complexity 24 (threshold 15). Drivers by points: loops 7 (20 pts), boolean chains 2, if/else 2 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/raster.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"78968b80d9c9511e29c2ce24b9444e372923016c995e93f9c3054a0dad1eec18"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::raster::blit (cognitive 24): impeccable_comp::raster::blit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/raster.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e926a55c3d88ebb80638eab7fefb21efb5522f6cf0d0d39a7502c0a2547e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::background::layered_gradient_stops (cognitive 24): impeccable_core::browser::background::layered_gradient_stops has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c8045bf74875d8be83dd4ba623d87b06cbfdc8a84ae97a056c3453d2d2a47d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::inset_stripe_detail (cognitive 24): impeccable_core::browser::element_checks::inset_stripe_detail has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0a5dfcd3f5f4b4e5fd74a01d88efab47775359c91bf6733715070310fdd804"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_stripe_child_dom (cognitive 24): impeccable_core::browser::element_checks::check_element_stripe_child_dom has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"153cabdb45c21e8f0ece926a82d5df61af166b7d30e8f626599d40f46f4b0f51"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::read_pseudo_surface_dom (cognitive 24): impeccable_core::browser::element_checks::read_pseudo_surface_dom has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a27157e95ea72ace37c539729dbe21cbfe6e8b7405289c93682edfcb495714"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::check_element_glow_dom (cognitive 24): impeccable_core::browser::element_checks::check_element_glow_dom has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8e581a545f78c25ce0e9894af1440ba4fcc241b827a95fad8cc824c14b3b96"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::canonical_design_finding_key (cognitive 24): impeccable_detect::design_system::canonical_design_finding_key has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":2094}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7d8fc1ba1d192c3ac61b3d845b8991acfd9eb9b3a42ccfe71d899f8a3e178a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::parse_jsx_tag (cognitive 24): impeccable_detect::detect_text::parse_jsx_tag has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"acde6cd4a95803cfd38a77b813c236c8d5f5194d1f08773f01ffb38d51c18bd1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::ignores::parse_value_args (cognitive 24): impeccable_detect::ignores::parse_value_args has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1e2f1c29c3dd3c5da07f18de2819b6cc3e7173ae7b1cb431ee3477a2268181"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook_lib::ensure_hook_git_excludes (cognitive 24): impeccable_hook::hook_lib::ensure_hook_git_excludes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"f717c1974990c9054fa10f0014581ced6fcec9abae5073337f5d6ea49c0cca79"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::page::is_output_block (cognitive 24): impeccable_html::page::is_output_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"183ba7bbf66106234f98676529273b2097c5e52c11c4d4c99113c376cdf2ac4d"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerState::record_generation_checkpoint (cognitive 24): ServerState::record_generation_checkpoint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e8cd58808b21d8a3cb39494bcc452e934c301f19d64941590c03ac58687490"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::parse_chars (cognitive 24): impeccable_live::accept_css::parse_chars has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d95e5c2e6473a613be2d6bd41704168378a6e90776ba66d88c0515a19e7186"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::design_md::find_character_capture (cognitive 24): impeccable_live::design_md::find_character_capture has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2033fee9bb3a83af526a19c0db014148efc6bac8b0ed0aaba448c420eda93328"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::journal::heal_artifact (cognitive 24): impeccable_live::journal::heal_artifact has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/journal.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d220437571727411663356d209bb4b7eebb6f5b0dc87fa88aa53a1c01c20b789"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.onPendingPillClick (cognitive 24): live-browser.onPendingPillClick has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 9, ternaries 1 (2 pts), error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"528e24d8d2cb4eac2dcd7dcfa10909fac0da20a96d9f540dcf3a255169ec454f"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.maybeWarnConditionalAncestor (cognitive 24): live-browser.maybeWarnConditionalAncestor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc40ece76fb55931b7aad337e227a38012a5c58f8b0ef4e5fe776fa84af1ea6e"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.initPageChat (cognitive 24): live-browser.initPageChat has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 7 (nesting depth added 1). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 11757, 11749, 11714, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11592}}}],"partialFingerprints":{"codehealthFindingId/v1":"637c316b12a32153897728f7592afc2a99cefbd55c55b201e25133e20c45c6ca"}},{"ruleId":"D2","level":"warning","message":{"text":"ensureOffscreenDocument (cognitive 24): ensureOffscreenDocument has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, error handling 2 (3 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 126, 161, 166, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7ea10723dc2677205db0233ba4af8231ef74f3ae69a3d9cf1978a4de22fde1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::render::remove_codex_hooks (cognitive 23): impeccable_agents::render::remove_codex_hooks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0706d0615e41c5ea17cf199e497e692e473fbb8b5fa50c48557949e54976b975"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::hero::invented_ink (cognitive 23): impeccable_comp::hero::invented_ink has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc4d23eb2f1bbc805ba924e5145afc01cc0e3dbce40950a718aefd533026c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context::discover_candidate_roots (cognitive 23): impeccable_context::context::discover_candidate_roots has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (8 pts), boolean chains 3, match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3d6f5e7d9adb13790ec84fc7fd6cb85142e9a73d2e5699191ccb829ddc8ef9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::target_args::parse_target_path (cognitive 23): impeccable_context::target_args::parse_target_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/target_args.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34dba7fff56fb513688fbf693f81fd04b2503119485aaf7b311876e7e1a365a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::share_left_by_covering_media (cognitive 23): impeccable_core::browser::element_checks::share_left_by_covering_media has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4483}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bafb6176c96f5db6ebb09fb8b3ca1b8dec4d21e9195c327190b5141c37d943"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::hidden_mockup::subtree_text (cognitive 23): impeccable_core::browser::hidden_mockup::subtree_text has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/hidden_mockup.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5400abdc7849b4f92b394acffd88d3131d609607450e3e6ad548a0003b1960"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::is_field_box (cognitive 23): impeccable_core::browser::page_checks::is_field_box has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 8, loops 2, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d83ef07078afb35a59761ecf63ffbacaba5d9cb814bef717651037e1fe40fac"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::turned_away (cognitive 23): impeccable_core::browser::painted::turned_away has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"de003b4aa5ff44e7c9b25f685203bfe122ee9ad017ec542a5c8836219b201250"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::in_an_unpainted_article (cognitive 23): impeccable_core::browser::text_collectors::in_an_unpainted_article has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdeab89d0f7c10d7b05a3a2b108579e4ed82052f1e331719fdf3573cbebcb8e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::background_images (cognitive 23): impeccable_core::browser::text_layers::background_images has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a6486df719f70a5518e5e6b371d66304b1bf2b24a2c7011592b5f03eba34fa"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::layer_in_box (cognitive 23): impeccable_core::browser::visual::layer_in_box has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cebd72147bc858a642838aacd79ad68da1b3e50849ec393b1b68eb634efcb9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::check_hero_eyebrow (cognitive 23): impeccable_core::checks::rules::check_hero_eyebrow has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12, boolean chains 9, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba76aa971685df02b8ee6e54cd159cc386ae74547bc7192ced58f2ce931045c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_rules::count_em_dashes (cognitive 23): impeccable_core::checks::text_rules::count_em_dashes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_rules.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41986ef9262f8789d84e3bfa864d16b8cdc66b0be6733754d61ba0efa75fab8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook_sessions::sweep_expired (cognitive 23): impeccable_hook::hook_sessions::sweep_expired has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_sessions.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34bedf5c0ab39866963f2dd706c1cd70c7064921c3f6bb778d763c50c2818a3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_accept::expand_replace_range (cognitive 23): impeccable_live::live_accept::expand_replace_range has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"de59ba7e2cb96537308568502bfcf4d2e5cc5f12413f651ef40d3aaca3c1185a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::scan_rollback_dir (cognitive 23): impeccable_live::manual_edits::commit::scan_rollback_dir has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1306b5294ee58ab8b35d52c971957509739214ef1d422fdbc2dd70b19a1e6187"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::roots::resolve_live_roots (cognitive 23): impeccable_live::roots::resolve_live_roots has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/roots.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"207a42ce43f82080d6e6b1a30bd5bb9b3cf3016ffc5ca17dc4a8e70e3b0c2861"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::collect_pattern_names (cognitive 23): impeccable_live::svelte_ast::collect_pattern_names has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce0cb65e6c71b21da5c0412564dce2357c03117c7554a39056d535573963c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::tail_identifier (cognitive 23): impeccable_live::svelte_ast::tail_identifier has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, loops 3, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27edf835d4d7a615ef961ec520922e842206e8abb0dcaa5256efa79ccea172e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::sweep_inactive_svelte_component_sessions (cognitive 23): impeccable_live::svelte_component::sweep_inactive_svelte_component_sessions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6c059b6d54a4ba90ea0f3d7c5c1cea953e7e167477c08d37034b3d29c5d1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"component-review.Xn::At (cognitive 23): component-review.Xn::At has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 13 (20 pts), boolean chains 2, if/else 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 4 other methods here (component-review.Xn::Dt, component-review.Xn::it, component-review.Xn::Ht, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d237eccf1314f6f6339d298d770e08d378455568fcfef2e49a751f31a745d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.runScan (cognitive 23): content-script.runScan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6 (nesting depth added 4). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 236). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa4e38e585961289f01c4d6b583af6faccc64c6ecc4331dd2133983f97ba10f"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.renderEditBadge (cognitive 23): live-browser.renderEditBadge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4961}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0664bba8f64d1e3eca1656084c76e014879b2fb4bf913774b1db0574d140a54"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.findLiveElementFromAnchorSnapshot (cognitive 23): live-browser.findLiveElementFromAnchorSnapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 8, 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":"skill/scripts/live-browser.js"},"region":{"startLine":5367}}}],"partialFingerprints":{"codehealthFindingId/v1":"572bd8f5d38283e104508648c3dd9175b95ff8b52966df9e8be66aa51305945a"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-review.mountPlanReview.stage (cognitive 23): plan-review.mountPlanReview.stage has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 13 (20 pts), boolean chains 2, if/else 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"796ad0cef1a198f4ad53d8f76641f194ad8b15280f7187114413e4d3d0559cef"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduleLazyVisualContrast (cognitive 23): scheduleLazyVisualContrast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 7). Most of this is not in the body itself: 10 of the 23 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 230, 241, 240, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"264e1e519c0d0aea7d27a5ce70be83bbe81b8da7b76c674635041159cec7fed6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::render::set_approval (cognitive 22): impeccable_agents::render::set_approval has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f374be87ea930408df71ef9ea5c569a4128338d973e9cde47a70e6f58ffc8458"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::capture_post_scan (cognitive 22): impeccable_browser::capture_post_scan has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce5eb74afca1ef5a7982d93d60a3b9b0ec49da9b5df6cf08fd38262e6dc39d0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::fullpage::capture_with (cognitive 22): impeccable_browser::fullpage::capture_with has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0d3aaf1d8226c636422856871a04bb6909b1f8c269f22e3b871646c3010c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::capture_service::request (cognitive 22): impeccable::capture_service::request has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"677d1857f0ccf551313adff829fcd7dbf7897c9b95868164af170f60962c3894"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::history::inputs (cognitive 22): impeccable_context::component_review::history::inputs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/history.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda486caeaf3c60bdac30b7e93e58b191987aefd7232d89477d0f551bcbc6d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context_cli::hook_enabled_at (cognitive 22): impeccable_context::context_cli::hook_enabled_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5796ef2a52572a54451dcbcf05e150a6e228873a306d1b90cd8c396d7d82a5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::surface_briefs::resolve_surface_brief_from (cognitive 22): impeccable_context::surface_briefs::resolve_surface_brief_from has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9a575baf525a36035d8ede43dccd8757ef11fe72124185b40ed56849e9594c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::field_label::text_label_above (cognitive 22): impeccable_core::browser::field_label::text_label_above has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/field_label.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f537c06235370ea6f3694f948df5c22b2256e72fa68a39fde6fc724bd31829ef"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::drawn_enlargement (cognitive 22): impeccable_core::browser::painted::drawn_enlargement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f8199baf32f0cb22930135605867a4f2f897277c1804a1ddcb2ec151ba9541"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::visible_through_clips (cognitive 22): impeccable_core::browser::text_layers::visible_through_clips has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ee06dad287c20020219475cb097e3aaa78dbf3214b8cc10716aa1da3eb7040"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::resolve_painted_image_rect (cognitive 22): impeccable_core::browser::visual::resolve_painted_image_rect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71aedd78911b706f03ce47f37cccb039287eaa74401b59132461d917077bb69"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::gradient_geometry::parse_radial_spec (cognitive 22): impeccable_core::checks::gradient_geometry::parse_radial_spec has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/gradient_geometry.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"49968660d0e5a9e926a3b746609d3bade8671cfafe90cb61f79ae8513bcc00b0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::check_flat_type_hierarchy_samples (cognitive 22): impeccable_core::checks::rules::check_flat_type_hierarchy_samples has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (4 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":2513}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e24afdf5b68dcd9162bfae0c3f02b424b840676027c672364fe9bd6d2f1c33"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::file_system::is_port_listening (cognitive 22): impeccable_detect::file_system::is_port_listening has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (7 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/file_system.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4654bf8e603d3c7e6677542e3a34a33e1a913f3ba3fd271c4d83078362b4bce"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::admin::reset (cognitive 22): impeccable_hook::admin::reset has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb50a9ecfe66554fc21a8f0633cbe9dcf72c366d7cfc7a7f601c6c313146732"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::adapters::collect_kicker_candidates (cognitive 22): impeccable_html::adapters::collect_kicker_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"797f7d75153723c8d30c09ff9de0513b3df3b0ab61eb1da04c8b9f2da7947f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::values::split_css_tokens (cognitive 22): impeccable_html::cascade::values::split_css_tokens has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 4, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/values.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a736a441d112c73f66550b91d3d5b0fbcfbffeb49c48f10488e12733dcba5771"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::quality::insulates_side (cognitive 22): impeccable_html::quality::insulates_side has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 5 (8 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2d1c38395e6e3128b1383a2c37f6298af55c1178b0c58ca48e55deb62445a7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::instructions::accept_instructions (cognitive 22): impeccable_live::instructions::accept_instructions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/instructions.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69453766fd8f41839ebd83b18ba06c8fd5c767b37dd107639527a0c5a038d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::summarize_repair_failures (cognitive 22): impeccable_live::manual_edits::commit::summarize_repair_failures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee3c3f05190c243be69fabcf79a7c10263a573b8e476d26ec4fd6054f2c2743"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::changed_files_since_snapshot (cognitive 22): impeccable_live::manual_edits::commit::changed_files_since_snapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2, match/switch 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b275140f75c8a8c2b845a28e0f7987d5d7a4758a50895f2b09ec2843d613fd79"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::preflight::build_generation_preflight (cognitive 22): impeccable_live::preflight::build_generation_preflight has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/preflight.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae17be49eb6c1e99d2ed554e32b84c7be42466651253c74cf133b2193437ccc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::find_svelte_component_manifest (cognitive 22): impeccable_live::svelte_component::find_svelte_component_manifest has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d22e6fb529db984bfb8dcbae215938de28ae1b109654aa4f3448f8653007bb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::bundle::link_provider_skills (cognitive 22): impeccable_skills::bundle::link_provider_skills has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ad018ca8fb365afbd88722f3d5af84d06e14d36f3a760bb2dcc9ad6d78811c"}},{"ruleId":"D2","level":"warning","message":{"text":"service-worker.chrome.runtime.onConnect.addListener() (cognitive 22): service-worker.chrome.runtime.onConnect.addListener() has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (22 pts) (nesting depth added 8). Of this number, 11 points are the body\u0027s own statements and 11 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee00f7172fff9a6ae4675a106c9978e2add7fe323adb55a9080166c905f3e17c"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.analyzeCandidate (cognitive 22): content-script.analyzeCandidate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7 (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":"extension/content/content-script.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64605acd59636d14ea034b563b6019809465471f8a4410d41baacf8359dde2d"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser-dom.createLiveBrowserDomHelpers.syncTopLayerHost (cognitive 22): live-browser-dom.createLiveBrowserDomHelpers.syncTopLayerHost has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-dom.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a901abb365dab6323a27c994b0e533dad58f7e0c2e0285317d07f831b70e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.captureAndEmit (cognitive 22): live-browser.captureAndEmit has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9002}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaea3423bed3ab7eb941c963a43428c7e4cd2fcab91d9f656305d20385b19913"}},{"ruleId":"D2","level":"warning","message":{"text":"Browser::launch (cognitive 21): Browser::launch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (7 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7204cccb4127ffc6a5df1eb4fbf24629c36b4bf197465656b134966347dd3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"HtmlSnapshot::capture_regions_at_viewport (cognitive 21): HtmlSnapshot::capture_regions_at_viewport has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_snapshot.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc7c405a3e584ddd188fc1a3a4702456592a592edd05b5790a0bfc4ef6fc527"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::loop_connect::connect_one (cognitive 21): impeccable::loop_connect::connect_one has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_connect.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a6ba515e2c6865bab82ee6d2cce1f7815b3391c6d80a8ba3ed72689cb6e70b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::loop_connect::disconnect (cognitive 21): impeccable::loop_connect::disconnect has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (6 pts), loops 5, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_connect.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"882337bc3359f50480b1cdaac5cc116938529f919d5aa8c7d408e5c0af993c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context::resolve_project (cognitive 21): impeccable_context::context::resolve_project has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee3174697e23f93667457d4dd5b36ddb70a2427dcde342b0d98520b09e2bc73"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context::has_ui_signal (cognitive 21): impeccable_context::context::has_ui_signal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"887265f3a634edfefb4019eac08dff2a22694e536e6624a7263ddfecd6950ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::critique_storage::is_snapshot_name (cognitive 21): impeccable_context::critique_storage::is_snapshot_name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"9467d913d733d07dc47d51581d688f26c2c57011d536c814fd75328d537e3e38"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::staleness_deep::check_detector_ignores (cognitive 21): impeccable_context::staleness_deep::check_detector_ignores has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness_deep.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ca54bfb333d330a43c1a6627f3bc5a0ab3e1eead82954f685cf15d60c9ae9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::surface_briefs::split_frontmatter (cognitive 21): impeccable_context::surface_briefs::split_frontmatter has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4297855bd315d317bf89e6f519bd3531403f99125067df9f15755aeb41911158"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::hidden_mockup::has_content_peer (cognitive 21): impeccable_core::browser::hidden_mockup::has_content_peer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/hidden_mockup.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3fd6a1b12feb1d9821697631303fdb90b69ce73e1c3e8c1d95cc852cca23cc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::rhythm_reads_as_eyebrow (cognitive 21): impeccable_core::browser::page_checks::rhythm_reads_as_eyebrow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec62bb22d40f9ad71c4339a9ae0a759ad0083d99c14ec5843dc1af5ad49234d0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::is_transparent_shell_for_flush (cognitive 21): impeccable_core::browser::quality::is_transparent_shell_for_flush has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"492c7750bbade24ecf81e070392fefcd8b8665a041ac89d89ed0c5987258819d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::decorative_text::classify_decorative_text (cognitive 21): impeccable_core::checks::decorative_text::classify_decorative_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/decorative_text.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"751d7b182b236c8ae5279075069af39b2236a36c6f20ddca2b5ed46242741fed"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::gradient_stops_all_readable (cognitive 21): impeccable_core::checks::rules::gradient_stops_all_readable has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 2 (6 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea5a062c45c99c86e734a26f805cd1b13b28c267cbfeed06d0472b1f60bdd1c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::contrast_findings (cognitive 21): impeccable_core::checks::rules::contrast_findings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"42661cb72ba028491b12d40fcf6da1e17928b934ae0e0d040e8be8f55d45ed21"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_context::holds_status_clock (cognitive 21): impeccable_core::checks::text_context::holds_status_clock has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (3 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":"crates/core/src/checks/text_context.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fae9eeadf025d83feefe893d71ddd9e3ced5cbe06893b21cff7b9037b9cc158"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_context::fine_print_marker (cognitive 21): impeccable_core::checks::text_context::fine_print_marker has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"103acc0b0a64b532304906c810d76fcc4d2c3da8b9c7ceba950252751345101c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_rules::is_kicker_candidate (cognitive 21): impeccable_core::checks::text_rules::is_kicker_candidate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_rules.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd9a31656e2337abbd838f357313cfd8c94842fbfc2c7a4035af4bbf3fa9766"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::detect_text (cognitive 21): impeccable_detect::detect_text::detect_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84d369cf593bc33d303ff6c70c52d5b6e8a28b2bc0278495dac54e27169bf52"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::find_ternary_split (cognitive 21): impeccable_detect::regex_matchers::find_ternary_split has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 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":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c10f095823067ad3682a9d95023a172976d798e9e7d8f1b879758c0912fad55"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::css::scan::infinite_animation_names (cognitive 21): impeccable_foundation::css::scan::infinite_animation_names has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9734969a08cdbd1361986fd7cc486c8642521a8bb33bf416b139eb1acf6099cc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::fdlibm_trig::scalbn (cognitive 21): impeccable_foundation::fdlibm_trig::scalbn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (21 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8451265b159a744900765bd27a55e29b5368ae3816ffc54bf45e39cfa4f692"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::run_copy_edit_batch_agent (cognitive 21): impeccable_live::copy_edit_agent::run_copy_edit_batch_agent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b8b03f7edf4a629da724580c457f3884fcbe3cb9bbd7b2848a9beafa7a80ee"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::instructions::instructions_for_event (cognitive 21): impeccable_live::instructions::instructions_for_event has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 5 (10 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/instructions.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b796d45280b49689d287abcc9afca6da4a4345924f65d61d445069debfb74f0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_accept::read_html_attr (cognitive 21): impeccable_live::live_accept::read_html_attr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"300a3a4942af16384be1322d38495f040758369cb28ad3fc679fb977d69b8c43"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_accept::extract_css (cognitive 21): impeccable_live::live_accept::extract_css has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a5dc43aa14686a5f56de0ac8b60506ab1e4b9878a830bd3ab60a8c06492ba"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::bundle::copy_provider_skills (cognitive 21): impeccable_skills::bundle::copy_provider_skills has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"854bbbc544f5be93b1b16984db58b507669d75c4d834ec1033976300e53b4ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::commands::link (cognitive 21): impeccable_skills::commands::link has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5345a8e10c4d9f279c28e1d647bc4ce982e1f3df637b3d5303ce2a133d1bde77"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::providers::extract_version (cognitive 21): impeccable_skills::providers::extract_version has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/providers.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd59a69e6690fdc49d2384f5e637096e7b3ed8034cb2e876c713bda4cb6dd104"}},{"ruleId":"D2","level":"warning","message":{"text":"component-review.Xn::it (cognitive 21): component-review.Xn::it has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: 4 other methods here (component-review.Xn::Dt, component-review.Xn::At, component-review.Xn::Ht, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 5 times rather than 5 independent problems. Splitting this body alone leaves the other 4 exactly as they are. Where these are variations on one operation, the change that clears all 5 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cc415e0482cb62d83cee3d27cbb687729cbd8404f0a0c434fbb011cccc367b"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.collectEditableTextRows::visit (cognitive 21): live-browser.collectEditableTextRows::visit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0ca50bc51129d2661b168ea525038d25b41de11d49ab3144408f365fa6546c"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.connectSSE (cognitive 21): live-browser.connectSSE has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 21. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7806}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c53ca54b85ee1f4abbe3418dc8ee843a7fd476b99d90753a003c6827416fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.captureElementToBlob (cognitive 21): live-browser.captureElementToBlob has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 3 (5 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8931}}}],"partialFingerprints":{"codehealthFindingId/v1":"172f413ebf22bb667bf0acd2d13c7ff5a10ceedd091c27e22611e0ade52ada55"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.syncVoiceUi (cognitive 21): live-browser.syncVoiceUi has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8754c3d5f1c91afc950ea676aa8d11c55a920c21a602004ca5448bd4c1f10e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"plan-review.mountPlanReview.stageFigures (cognitive 21): plan-review.mountPlanReview.stageFigures has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (16 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9645de95051d75ae19d967050feaea333128ca3a38a3c977552be26d67768b0"}},{"ruleId":"D2","level":"warning","message":{"text":"scheduleLazy (cognitive 21): scheduleLazy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 8). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 151, 163, 168, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1bb45c260e07fb2398a4e79f34e11b35cf65a7218c21a67ad1742d975888f9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::discovery::standard_candidates (cognitive 20): impeccable_browser::discovery::standard_candidates has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 4 (5 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/discovery.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f0eee876e0c9326947786c60dd9f58e5c1e9d04fdd1da1dbcd23abe8186770"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::win32::extname (cognitive 20): impeccable_common::jsp::win32::extname has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3199e181b33e3ae5e85fdab415d4d9d01401ddc08c2b4a5058ca5a814f3b2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::source_pixels::area_reduce (cognitive 20): impeccable_comp::source_pixels::area_reduce has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (18 pts), boolean chains 1, if/else 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/source_pixels.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b7006a08a17fe2c4382d2f7ab8e6f68e4f83d57527a2c815524425725f615c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::util::parse_f64 (cognitive 20): impeccable_comp_verbs::util::parse_f64 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 7, loops 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/util.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd4d9985bfe197e771a02f24f99591b6fd0de10e088b3065a888b859363ddd1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::generate_image::png_fake_background (cognitive 20): impeccable_context::generate_image::png_fake_background has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da67965df99d1658ba99c6924b6fd88650c6fc3e614d5b446173d1256eb53ad"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::serve_question::read_hand (cognitive 20): impeccable_context::serve_question::read_hand has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65165f2b253cd25ebc32ff7d64e4ce15b4f9dd348eec4bd59c33bf5e3c2ca8d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::cream_band_shows (cognitive 20): impeccable_core::browser::page_checks::cream_band_shows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2963}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad1a900d37989053fbf590ecdf52c8680540efd3277bc8f265102d5d8af939a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::visible_x_extent (cognitive 20): impeccable_core::browser::quality::visible_x_extent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83971c471c5cca0be8c83612e5755d31efc04ff0cefece3ba34b879eb5ed274"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::overflow_element_name (cognitive 20): impeccable_core::browser::quality::overflow_element_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":3564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4bf33821d4131d3af5d529ee1586ab27a344ff973348d1549c843f76b1e28d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_collectors::list_separator_dashes (cognitive 20): impeccable_core::browser::text_collectors::list_separator_dashes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"872d0a28a4ca01063249ebbbc1aaddbc9e8ff9f90574b038554e6a5c8d2ee28e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::rotate_scale_linear (cognitive 20): impeccable_core::browser::visual::rotate_scale_linear has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"2095ccfff49854b8be97281ca713be5770b8de900d816eadb50d6931ac395a12"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::text_outlined (cognitive 20): impeccable_core::browser::visual::text_outlined has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c767fa7046393eb72b67b13ebbc53dc0a0d8bf24e00402dc48dbfbd2b565819"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::html_patterns::context_gradients_are_one_colour (cognitive 20): impeccable_core::checks::html_patterns::context_gradients_are_one_colour has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa496f06b0b923a9d9fdc3386532a21677a40b583026e15087e43c003fc354cb"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::check_icon_tile (cognitive 20): impeccable_core::checks::rules::check_icon_tile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10, boolean chains 9, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"58961ab634d5a486857f665c9cfebd475bbeea90845afdab626c3a64900f0bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::check_motion (cognitive 20): impeccable_core::checks::rules::check_motion has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"951edc03c023ba3010a99ea787f1d845ccb477a31ca4172fb2678dd2264c5eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::file_system::http_get_localhost (cognitive 20): impeccable_detect::file_system::http_get_localhost has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (8 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/file_system.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"5373a48387b7e0c05e503709cacc61424b92bf8e6499759efda3b9b6c56b7e77"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::css::scan::keyframes_move_or_resize (cognitive 20): impeccable_foundation::css::scan::keyframes_move_or_resize has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c868df88f5f70fcf7c385afa966f462eb3a715e14b29f01f153cbabd882eb4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::js::number_to_string (cognitive 20): impeccable_foundation::js::number_to_string has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6afd5474c378e7db0ea4830d2ced1437b9b96f0e09a44faa21e689bbb575c1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::before_edit::python_string_arg (cognitive 20): impeccable_hook::before_edit::python_string_arg has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2348bedf181f076c6ed37bc0e852e355f62ca35d9ad6141271bee64de15803c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook_claim::sweep_old_buckets (cognitive 20): impeccable_hook::hook_claim::sweep_old_buckets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_claim.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"269652630a46050c860c6b689e1da72fb897999536f61c431cbc26e1c51738ad"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::adapters::check_element_italic_serif (cognitive 20): impeccable_html::adapters::check_element_italic_serif has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"208ce21b2c88f23c71c16757014d54f3a6c3ea615a029d38f925b85c22002b9e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::bake_param_values (cognitive 20): impeccable_live::accept_css::bake_param_values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 4 (12 pts), loops 6 (11 pts), boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (impeccable_live::accept_css::bake_param_values::transform) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68f0ed0a58222607dda8741684594d43894c43896c75c6ee18c6a261e4ec1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_generate::parse_flags (cognitive 20): impeccable_live::live_generate::parse_flags has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4af92335ca73e45c1e5d22984462f7e68e88b26d430a7524581a8a889410b20"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_poll::post_reply (cognitive 20): impeccable_live::live_poll::post_reply has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (10 pts) (nesting depth added 12). Of this number, 11 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab7152679ea8c03e4c6cd57a7c7c2d358f1cb220caa7f7b900a53090cc19ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_server::validate_agent_target_request (cognitive 20): impeccable_live::live_server::validate_agent_target_request has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":2751}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b53db50927198ec386a1a593b2025b23e1699c90afc49bdc6dc1db9333badf"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::apply::compact_manual_apply_batch (cognitive 20): impeccable_live::manual_edits::apply::compact_manual_apply_batch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdde68e17ff906d126d59fa1176da53b0a4297f813cfbac2ee8bdd9b865b57f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::apply::rollback_manual_apply_transaction (cognitive 20): impeccable_live::manual_edits::apply::rollback_manual_apply_transaction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d2a64e36ba101c19e89b24281d46c747425c638001c00fa6c50f112c0ae6e0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::collect_apply_owned_files (cognitive 20): impeccable_live::manual_edits::commit::collect_apply_owned_files has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1710db5095f11183e5f1eed350052750383a1d73d0eba3a6813daf887c613"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::evidence::build_context_hints_by_ref (cognitive 20): impeccable_live::manual_edits::evidence::build_context_hints_by_ref has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/evidence.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7a28638a1d0fe0510bc6567684a4542d3a4c36ed45d73a82b5d6648b0e57df"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::server::spawn_detached_with_args (cognitive 20): impeccable_live::server::spawn_detached_with_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d60578697883ad7d2fbd353d2d726f47773601c23c36bfdaf6acb2d299ea4e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::server_state::select_available_pending_event (cognitive 20): impeccable_live::server_state::select_available_pending_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1799f7564631a68029b76fe44a88d7bcbf82a77d2f880481c1ddf1767f9776d3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::describe_each_item::collect_statics (cognitive 20): impeccable_live::svelte_ast::describe_each_item::collect_statics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (impeccable_live::svelte_ast::describe_each_item::walk_for_slots) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"086656ccfe3e49c6de4bdbbe97a091a50bdd546af633132a42e349f9807b3c7d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::class_attr_values (cognitive 20): impeccable_live::svelte_component::class_attr_values has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (impeccable_live::svelte_component::class_value_of) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6409f31f1df9870b4e7b0cf15651efb64cfa336c5c10d1cdc019cca72c1e632d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::class_value_of (cognitive 20): impeccable_live::svelte_component::class_value_of has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (impeccable_live::svelte_component::class_attr_values) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d90c1d26dc4b907f7a01f1a2abc62f4e26607db14cd0a2a2c0ac60a85982ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Sys::migrate_unprefix_impeccable (cognitive 20): Sys::migrate_unprefix_impeccable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/providers.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1906ad469db0b3b3b3afc54c5c17c4d5665eba640c43e2cbcad7a0a4ab996f60"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.startScrollLock (cognitive 20): live-browser.startScrollLock has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 6 function items inside it that branch (correct, a function literal at line 7189, schedule, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7085}}}],"partialFingerprints":{"codehealthFindingId/v1":"03816093e829e28f906cdd50b581f84df021ff0f0903514518c83026e0c127bb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 20): (anonymous) has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 1 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 2 belong to 9 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_fonts.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b066523d3f304f762f5ef42dd84167ead18a9e612b96d44cae62573082d48fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::run_whoami (cognitive 19): impeccable_account::run_whoami has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba1b1d78cc90025b48ae6d68d37bcd162372704c9ee31f3f1e136ee3eaef252"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::mcp::sync_mcp (cognitive 19): impeccable_agents::mcp::sync_mcp has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 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":"crates/agents/src/mcp.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcb29aed5c0b89c4bdba19c138167568418dd13632c60a535027eb103ba67f6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::remeasure_drifted (cognitive 19): impeccable_browser::remeasure_drifted has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"31504d288e0258920c43fe5ea32e27a947e748bf3efa1c8114a5b40cf8417e1b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::snapshot_engine::recapture_geometry (cognitive 19): impeccable_browser::snapshot_engine::recapture_geometry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/snapshot_engine.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc597ce04dbb5d55d01eda2f7c08200b0576554556c376bf5be753669364d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::snapshot_engine::analyze_visual_contrast (cognitive 19): impeccable_browser::snapshot_engine::analyze_visual_contrast has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/snapshot_engine.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"996a10f29086cafcf0d89ea4484fc1695945dc05f6a2c3eb0ab5b8760af0bc11"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::loop_install::download (cognitive 19): impeccable::loop_install::download has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_install.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f487e3af054576ba2ccebe9bc8d0002a45d7d8c487213c19bc0104af0f1130"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::metrics::ssim (cognitive 19): impeccable_comp::metrics::ssim has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/metrics.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3af560862a60b2fc6ff3dad649fd25962a2e1b3734ea13d9c242616a13a5b05"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::signals::git_run (cognitive 19): impeccable_context::signals::git_run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/signals.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f2a9e36973bc5d3751a48b26727772a21001d57175b8be816418982212c1e1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::selector_list_pseudos (cognitive 19): impeccable_core::browser::driver::selector_list_pseudos has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59816d8afc1d1f794aa92025df7ae17843f131c5e7533ab721990de05d441d1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::gradient_surfaces_under (cognitive 19): impeccable_core::browser::element_checks::gradient_surfaces_under has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4754}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f287b40e3d9cb416c5838b3b771f6b795572f75f4d0446da83e9e202fda8eee"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::line_breaks::lines_run_past_a_clip (cognitive 19): impeccable_core::browser::line_breaks::lines_run_past_a_clip has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/line_breaks.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"93253a2eb675281d50204ee4b432bed549bd588774a9a7b0dfbd11b463ce69b1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::is_output_block (cognitive 19): impeccable_core::browser::page_checks::is_output_block has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff25e049be937112ddf5a3317c65eb0c6e5651a7c533e4bda7c80fc1c7815a2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::rhythm_block_separates (cognitive 19): impeccable_core::browser::page_checks::rhythm_block_separates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e0bc74bc8768722bcbeaae0690716a0fe91575f1180406928b680286ef2edc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::backdrop_layer_matches (cognitive 19): impeccable_core::browser::quality::backdrop_layer_matches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2659bf525359f4d4a54cc3dc3c9fca47bf0d4014ad9b79b1baa289d8aff42fa"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::raster_is_state_layer (cognitive 19): impeccable_core::browser::quality::raster_is_state_layer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"88982436d599bdc8d68cebf58c88326694018ac1e41b91410eee3ad04f856d5d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::covering_layer_holds_text (cognitive 19): impeccable_core::browser::text_layers::covering_layer_holds_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"c162b75d44d7d01588342a2213a0057c29756cc192814f116e9c68b593f442fe"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::css_text_has_dark_root_bg (cognitive 19): impeccable_core::checks::css_scan::css_text_has_dark_root_bg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee64ecde5295a70d4853ff9ede1029067aeae59f9bf07ad2115142c8c39b050"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::measures::gpt_border_shadow_cell_row_mates (cognitive 19): impeccable_core::checks::measures::gpt_border_shadow_cell_row_mates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/measures.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"84968bccfad52779db974b523cb7140aa60b32ae6406c1a40213a889f1fc1e56"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::cli::file_url_to_local_path (cognitive 19): impeccable_detect::cli::file_url_to_local_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ff2f9964ec7b9a642ed7bcd2c139e750d06ba3deb25aeae41521426047299c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::split_top_level (cognitive 19): impeccable_detect::design_system::split_top_level has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"f670e597b40286aacc06c834470849c1ace738dde7cb5c8f63797f8c930e2f69"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::monorepo_owns_path (cognitive 19): impeccable_detect::design_system::monorepo_owns_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c78ef2350df12d2d1bf4b9fbfd73c124fe8546d1169e9aa6f76809552cd5c69"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::analyze_monotonous_spacing (cognitive 19): impeccable_detect::regex_matchers::analyze_monotonous_spacing has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6, boolean chains 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64a4f5b8ea6224088041a3d430825f36ba8b8cc2143323883a67860a23d8b8a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::admin::parse_ignore_value_args (cognitive 19): impeccable_hook::admin::parse_ignore_value_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7cfbb65ed3d0eb2d850878244414cee58c9affbd0eb94336bec331bc1821e4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::build_completion::reminder (cognitive 19): impeccable_hook::build_completion::reminder has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/build_completion.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b95f1be76763e326e188d2043616e9c81f17867675dd1530d6485f288586e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::values::split_css_list (cognitive 19): impeccable_html::cascade::values::split_css_list has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/values.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc91e8496b0e4d01085f95b5be7f815bb0df3a6e0f743d0d6b1853ad485b04b3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::scan_block_end (cognitive 19): impeccable_live::accept_css::scan_block_end has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a419f159102ac4284dc5b7cc3d36f14fb6a3b6a65fe02aebf8f27ee79170f9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_boot::scan_for_drift::walk (cognitive 19): impeccable_live::live_boot::scan_for_drift::walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_boot.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21b0d7bcb618439f24beaa0366afded8c7046c3af72d3dfc91f8470ac60d620"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::apply::split_manual_apply_batch (cognitive 19): impeccable_live::manual_edits::apply::split_manual_apply_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d32ead7d31ec00555c6a6932ffd1eadf02a210f2bfd818c248497b35ba1e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::bundle::extract_zip_from (cognitive 19): impeccable_skills::bundle::extract_zip_from has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc82a75aeb2147a38f6abf7eb9e92d9699fd6a0dcb6a7ede64c5715c418d5da"}},{"ruleId":"D2","level":"warning","message":{"text":"content-script.chrome.runtime.onMessage.addListener() (cognitive 19): content-script.chrome.runtime.onMessage.addListener() has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"8098003df9672dc5c0592453b382ecf92d1671958886af1db455ea55ccf3b4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser-ignores.globToRegex (cognitive 19): live-browser-ignores.globToRegex has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8ab0190c62dcaeae498bce6bac075d0f1bd16298c0fdabb73760abb8adafd1"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.wrapMixedContentTextNodes (cognitive 19): live-browser.wrapMixedContentTextNodes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3523}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f09a149a33d8200cc6403d45b5d6abdc8cef1c3edf11e8e70e9c52df16d025"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.unlockSteerChat (cognitive 19): live-browser.unlockSteerChat has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 4, ternaries 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd19aba57b99512861422325d3ca00fb3a1c2458cd2bb55a6e94be997986a63"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.initGlobalBar (cognitive 19): live-browser.initGlobalBar has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 5, ternaries 2, error handling 1. Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 10 function items inside it that branch (makeIconBtn, makeIconBtn::collapse, makePendingDecisionBtn, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11923}}}],"partialFingerprints":{"codehealthFindingId/v1":"f001ce4702de8b35481e14c6d294555a3391bbe3ac8e05ec540dfb6fd09a599e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::setup::run (cognitive 18): impeccable_account::setup::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/setup.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3c1d92f5732441f416dc5fbb6bc1edc85ee98edb6a3f61c4776fe7989af1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_agents::mcp::parse_mcp_observation (cognitive 18): impeccable_agents::mcp::parse_mcp_observation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/mcp.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b1fba7d205a696885f66c7c0b69313efd263014b58243d529937745229355d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_index::candidates_from_index (cognitive 18): impeccable_comp::font_index::candidates_from_index has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2, 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":"crates/comp/src/font_index.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"015ea7231d24e6d75cc9a945ef35122d608f6a53ef8462947b0a76ed57a7b418"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerState::load_round (cognitive 18): ServerState::load_round has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, match/switch 2, loops 1 (nesting depth added 1). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8a7e8fdf9457810941230f3fad7ba6ba14a62d4e632566ddd0fc1542b775ec"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::detect_csp::walk (cognitive 18): impeccable_context::detect_csp::walk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/detect_csp.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cf2691f85b89ab5af94d937f6874800dbf762c284f12ee55791198d8803c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::serve_question::print_answer (cognitive 18): impeccable_context::serve_question::print_answer has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"691f3b1a7de68a0d6aad3a5596585502cd5e70656aed94da588087f10306538e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::util::to_fixed (cognitive 18): impeccable_context::util::to_fixed has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"742a1d224003310c68a953a4b17ee72f1e318e0c2373f3eebf790f8f36822d72"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::visible_text_is (cognitive 18): impeccable_core::browser::element_checks::visible_text_is has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"41247217764631a177822a11bc48737b7f860bbbb7aaf989aada2c980532f48c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::keyframes_toggle_visibility_dom (cognitive 18): impeccable_core::browser::element_checks::keyframes_toggle_visibility_dom has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":6178}}}],"partialFingerprints":{"codehealthFindingId/v1":"901dce179f0d8dd6d9ded8717ef94d9ddbb13859d4166607e471e8fd9f3ec2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::rhythm_image_band (cognitive 18): impeccable_core::browser::page_checks::rhythm_image_band has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd8e2cbbd32c7d4f7733480158d23ff4807f674a2abdee55b2fb06022dec093"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::ancestor_turns (cognitive 18): impeccable_core::browser::painted::ancestor_turns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2384}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7122f2802552ce56fe059e38be414ce8a5d2b5f91973ece48f45fa272bd303"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::keyframe_x (cognitive 18): impeccable_core::browser::painted::keyframe_x has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"95483df3106f0d3a16a11c3a1ade38d57c8f1d9d4b21c9e4258820dc127412cd"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::parked_outside_clip (cognitive 18): impeccable_core::browser::painted::parked_outside_clip has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64a18b94a77a4f8cd7fe7330eafadaf7cb39460c5b6ad03acb8203b208f8be1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::is_visually_hidden (cognitive 18): impeccable_core::browser::quality::is_visually_hidden has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e3f395af0b2bb19e346b9da88ae0ad8d2a286063db69eefacec46f920629fe"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::widest_past_edge (cognitive 18): impeccable_core::browser::quality::widest_past_edge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":3415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d38b362638ee279c833a7a3b37ea525855bf81e0481d0cfba49a888167ad9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::detached_paint (cognitive 18): impeccable_core::browser::text_layers::detached_paint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"7086daebcc129db3f9c54f4c218e9bcd4dc0d7ff109b022b34f064aca7947254"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::rules::tailwind_declared_corners (cognitive 18): impeccable_core::checks::rules::tailwind_declared_corners has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (7 pts), match/switch 3 (6 pts), if/else 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"131a8bf40239e7049f35485370251a206927c0b07f8aeb0904236b87fa8917d8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::unescape_yaml_double_quoted (cognitive 18): impeccable_detect::design_system::unescape_yaml_double_quoted has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"332ffe03e200c3e4fd55110099065c6e82f4baa39868a1c2bdf80a24a5a9e916"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::project_tokens::stylesheets (cognitive 18): impeccable_detect::project_tokens::stylesheets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/project_tokens.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4f1f51af6622051c518a8c6853b470cdf7089a2e44b9180d9c4d8e2e2b02c5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::split_statements (cognitive 18): impeccable_detect::regex_matchers::split_statements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878a9b2ea67b218d479509e36578c966169cb05a61319d7821ca3ab2ce11a35"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::brace_scope_statements (cognitive 18): impeccable_detect::regex_matchers::brace_scope_statements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfa826728c460781d9bb9ac7631b783fa704b21482d44cccb007e08e14b0469"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::vectors::checks_a::call (cognitive 18): impeccable_foundation::vectors::checks_a::call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (4 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/checks_a.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fa35f56cd7a62c90fa560a30c82c6f331ab440782b1cbfec712ff1144c3303"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::admin::merge_detector_config (cognitive 18): impeccable_hook::admin::merge_detector_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5562040fdabc05b2b5a1c9135239cb392f34b3d088846e14504b9e5ff56b2812"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::before_edit::projected_edit_content (cognitive 18): impeccable_hook::before_edit::projected_edit_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa659c341f989a4b70f68dcecd146c4d24856190f692be7775e47f6802a9b453"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook_lib::extract_finding_ignore_value_raw (cognitive 18): impeccable_hook::hook_lib::extract_finding_ignore_value_raw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a11f3c9636dcc883101d5b757b8dc55b5877c2e931c56cb99edee122166f95"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::on_white_space (cognitive 18): Parser::on_white_space has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"df90c937657aa0710542b6f3638b17d680e1912bb4214d486c58b5c39c80a062"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::fn_var (cognitive 18): Parser::fn_var has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (4 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2013c158a75454220e627b118b925e9e213cf4fe33af6432ffc554a1012645"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::engine::count_colour_pairs (cognitive 18): impeccable_html::engine::count_colour_pairs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/engine.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"73af2ea83c9dc7f63022d4bd546d97ef5fa1feb1cb32a3fdaaeb8d22e13b6fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::quality::is_visually_hidden (cognitive 18): impeccable_html::quality::is_visually_hidden has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4c6b0c1ebbdb593bdf06e84388abc6c8a65dfa82ec9e70e43cb56900766171"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::quality::is_transparent_wrapper_static (cognitive 18): impeccable_html::quality::is_transparent_wrapper_static has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (8 pts), loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"52fe4c30f5b6970028c7c4357e2f6dbaefca3711913ce517ab25c000099000ec"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::normalize_failed_entries (cognitive 18): impeccable_live::manual_edits::commit::normalize_failed_entries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f53a9c1c143729d1f9cc4c6a9de02967942ae6649121ca1027b8f259aea223b"}},{"ruleId":"D2","level":"warning","message":{"text":"Sys::resolve_update_target (cognitive 18): Sys::resolve_update_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/providers.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cadd74bc9fb83eec8f4a67679b391c360b59a9d15d1eef94464472685bbe70f"}},{"ruleId":"D2","level":"warning","message":{"text":"35-visual.createVisualContrast.analyzeVisualContrast (cognitive 18): 35-visual.createVisualContrast.analyzeVisualContrast has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/35-visual.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b1acca519659951b978e6b681b18203b8e1c7fb2ae53cf5846a9ca3dc558fb"}},{"ruleId":"D2","level":"warning","message":{"text":"map_inspection.html.renderList (cognitive 18): map_inspection.html.renderList has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/map_inspection.html"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9db99ba5cbb9f00688d77d8f65d2938f812dc37cec2e86a26ffdfe6da56f00"}},{"ruleId":"D2","level":"warning","message":{"text":"svelte_bridge_helper.rl.on(\u0022line\u0022) (cognitive 18): svelte_bridge_helper.rl.on(\u0022line\u0022) has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, error handling 3 (6 pts), if/else 5 (6 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_bridge_helper.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefdc5ccd1de9765c99ceffbc26a8af1006f3015e51aa818eb02d939d1b251dc"}},{"ruleId":"D2","level":"warning","message":{"text":"service-worker.sendScanToTab (cognitive 18): service-worker.sendScanToTab has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5, ternaries 2 (5 pts), boolean chains 4, error handling 3 (4 pts) (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a4def472b233f8f070c732b35d14592df5d71ae26bf1ff612c81598e13ef1b"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.restoreDiscardedManualEdits (cognitive 18): live-browser.restoreDiscardedManualEdits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4607}}}],"partialFingerprints":{"codehealthFindingId/v1":"450ebe0a38383fa4781834aae98d2e88217af5dde5c5eb4ed71f09fbfbadb722"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.collectFontFaces (cognitive 18): live-browser.collectFontFaces has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, error handling 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6aae353a57ca47d5c81c307b1cac175f699236e5f27f7c87cc3548060027a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.startVoice (cognitive 18): live-browser.startVoice has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 1 (2 pts), error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11399}}}],"partialFingerprints":{"codehealthFindingId/v1":"1417962fb7e685bade7f4342107906b67d03ebec66ce1c234e735d0ac068b4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"__snapConditionalCssRuleIsActive (cognitive 18): __snapConditionalCssRuleIsActive has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (6 pts), error handling 2 (4 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"144dbfe377ca652289a7d855235370dcffc53c869757ca908df9bcf321ab24c9"}},{"ruleId":"D2","level":"warning","message":{"text":"createVisualContrast.analyzeVisualContrast (cognitive 18): createVisualContrast.analyzeVisualContrast has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/35-visual.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3eec0efffc3bebb0382bf6034330ab7ce079c25791091f69b73a68593764be1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::critiques::run (cognitive 17): impeccable_account::critiques::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/critiques.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e03b3628d318940d11c32da3b43ee3fc81523a9ca3fef86e40498926a3e2511"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::cdp::typed_page_error_message (cognitive 17): impeccable_browser::cdp::typed_page_error_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6113e55c249318e1cd3a0d47daacce2017f3e0cf46dfd480c0b39104722307"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_browser::cdp::client_error_message (cognitive 17): impeccable_browser::cdp::client_error_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1d17c3c46f8f9ca6d316023f438da03988e3c665bba1a14688b9ceb068110b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::jsp::normalize_segments (cognitive 17): impeccable_common::jsp::normalize_segments has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f0195748f2060abf1ea999402e4a650db65d98f5589928b07c402b769fc7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::hero::svg_illustrations (cognitive 17): impeccable_comp::hero::svg_illustrations has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), loops 3 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"0493d0a1946caf34eca610d0b663e2ddacdba8b449ee4bbc7e2d98ee3b05921a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::font_match::with_weight_variants (cognitive 17): impeccable_comp_verbs::font_match::with_weight_variants has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/font_match.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ede8ffc1d19b1de5eae04b6a90e73a8022e5e3654d94808c33a567e20e1b110"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::map_inspection::geometry_error (cognitive 17): impeccable_comp_verbs::map_inspection::geometry_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/map_inspection.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3310843a57d9b95a4774117ad36cd23da7d081582f9aa17e5ea22e5ce22f21"}},{"ruleId":"D2","level":"warning","message":{"text":"Ledger::prune (cognitive 17): Ledger::prune has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/telemetry.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"708db92196d5857f9aeeb359597dd8bec9727f94d676b9e283ec008ac6f49195"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::history::between (cognitive 17): impeccable_context::component_review::history::between has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/history.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9e0ff1009411e40f6d6e2504b98dcf898bcefb1985a62e8ba62cef2027ce6c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::visual_approval::carry (cognitive 17): impeccable_context::component_review::visual_approval::carry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/visual_approval.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1674e07c1bf1f9526892c28aa5f986c335d5a4a8f7eed6d45e0480c7100075b1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context::read_pnpm_workspaces (cognitive 17): impeccable_context::context::read_pnpm_workspaces has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb741c1fdfd1dda9de71427db223163a1819bc125e1ab39ce87a6bdf28e228c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context::parse_yaml_flow_list (cognitive 17): impeccable_context::context::parse_yaml_flow_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd148cd254d76d0a8e736c698cbb898c5348f9b6c0dd63d3c91c826a45c1d3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::serve_question::card_identity_problems (cognitive 17): impeccable_context::serve_question::card_identity_problems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de336b6507e0c823f137ff57b3ba2685593f5933e17317bc2d381f9e5c674c7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::surface_brief_cli::run (cognitive 17): impeccable_context::surface_brief_cli::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_brief_cli.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aed55fefd447b34365dd816eed6ba69e833e880a34f2377372ebff6823ff748"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::surface_briefs::normalize_surface_target (cognitive 17): impeccable_context::surface_briefs::normalize_surface_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb93662d8fea5f878afdb130916ca408f26e7af290afffc25234de0e451beda0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::driver::generate_selector (cognitive 17): impeccable_core::browser::driver::generate_selector 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":"crates/core/src/browser/driver.rs"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fd53563cfab2cd8c6230c28ab4264055ff1218d8a5558063b8b0fd3566f46a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::element_checks::painted_overflow_extent (cognitive 17): impeccable_core::browser::element_checks::painted_overflow_extent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5549}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b17ffed69e80049a2c70697f68ebbcf81a6be0834c2e1f551faca886ecd33"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::laid_out_apart (cognitive 17): impeccable_core::browser::page_checks::laid_out_apart has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 5, match/switch 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4284}}}],"partialFingerprints":{"codehealthFindingId/v1":"02741ca05f077c34c2130df692613ea95d524896e4556d046eb5633f5d2d796e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::content_runs_past (cognitive 17): impeccable_core::browser::painted::content_runs_past has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a2462cb531803353a3579408ebff5adb5ec93094f287f803285482ad6c1735"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::awaits_class_reveal (cognitive 17): impeccable_core::browser::painted::awaits_class_reveal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"68dfa9f375129838a7c7a385fd9997762721489616d751994cf0404c4ee02cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::shown_line_count (cognitive 17): impeccable_core::browser::quality::shown_line_count has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba559e98ead0e64f4cdf41fd47700a72112c61fd3c5b1c50d92facde81c22a9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::text_layers::radial_dot (cognitive 17): impeccable_core::browser::text_layers::radial_dot has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"0344dd6e18d85506ea6ea4d4c28eb969ab0341e7a626d4815fab8b4e55bb5dcc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::base_candidate (cognitive 17): impeccable_core::browser::visual::base_candidate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c64863b2880feae515587255830ca4a46163000f935646b2b55d308eff08c92"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::polygon_is_zigzag (cognitive 17): impeccable_core::checks::css_scan::polygon_is_zigzag has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c811dae1554ed1844e4d25e168a7b7c873ab302ee2e8f42749d8152bd7baae"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::row_stripe::inset_stripe (cognitive 17): impeccable_core::checks::row_stripe::inset_stripe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/row_stripe.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce76f9ff51dc0bcbe4e3ca8f195882d04430cb9ab892cfc64fe216e6afc9ccf2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_context::is_sample_caption (cognitive 17): impeccable_core::checks::text_context::is_sample_caption has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fae237f94718d8b1d8c5a8a86301fabbf5d1f19a902400d3f454149d7e0e8b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_context::is_chart_label (cognitive 17): impeccable_core::checks::text_context::is_chart_label has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29d9287533a7207fb72701aa825dbb35992885bf7c2e754186998eeff197865"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::split_layers (cognitive 17): impeccable_detect::detect_text::split_layers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bdfd968d9ce3d5d3a858675fbbe48a41046518059872e3044ce25c15efd0b6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::detect_text::find_template_expression_end (cognitive 17): impeccable_detect::detect_text::find_template_expression_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba64b95c39d56bcd9f6234444249a3faf6c559f7b36451fd59f3b46a0f65312"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::file_system::build_import_graph_reporting (cognitive 17): impeccable_detect::file_system::build_import_graph_reporting has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (9 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/file_system.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"932420310fb4b328d2fc4bcff4647a723d1f8b9b26bb0ce278b2032b9736816d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::apply_statements (cognitive 17): impeccable_detect::regex_matchers::apply_statements has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a6a16e71f14c4940b31d23d80cf07634c97165fa06f962854424b4c63d8702"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::color::extract_color_function_tokens (cognitive 17): impeccable_foundation::color::extract_color_function_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac4d32613b7fea442e1f328030b1f0d5aa93d1376e027bd847a3b81bbfdd2db"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::css::scan::collect_marquee_keyframes (cognitive 17): impeccable_foundation::css::scan::collect_marquee_keyframes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a45f3117609a71464a782922d07e6ca3c307abff6b5ed5be05e9d19286e6e9"}},{"ruleId":"D2","level":"warning","message":{"text":"El::match_non_ts_pseudo_class (cognitive 17): El::match_non_ts_pseudo_class has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/select.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f47a6f53f1bef6e6798fa746e3b0f575bfbcfb5db04944a97c371eb21ba12c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::csstree::strings::decode_range (cognitive 17): impeccable_html::cascade::csstree::strings::decode_range has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/strings.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2906f94aa025e87d6df42521b78dbd7542c7850e44e3c00156ba853e9f013b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::page::frames_embedded_content (cognitive 17): impeccable_html::page::frames_embedded_content has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (6 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdb0071e2f4426ae6e9ca5587cd6216fe06bade8606dc46f8950e217d428920"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::normalize_batch_source_hint (cognitive 17): impeccable_live::copy_edit_agent::normalize_batch_source_hint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, match/switch 2 (nesting depth added 6). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fda03397c593f6535ef60fc573a5d470f3a44019c101eac010767f0c6a8f2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::design_md::extract_components (cognitive 17): impeccable_live::design_md::extract_components has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"206f7c9eb5a5ffa58ae27705e51750b390e9f166af9d16a2cde99db28bea9bef"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::instructions::generate_instructions (cognitive 17): impeccable_live::instructions::generate_instructions has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 7, boolean chains 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/instructions.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f954d9a4f923f8d430780870c0c0a904f32a01dbbddf774c7658105d3bc62130"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_poll::fetch_next_event (cognitive 17): impeccable_live::live_poll::fetch_next_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ea3d4b1493b12bfb8b33faf354527c88c28049f0fce199355f3deeec789849"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::verification_targets_for_op (cognitive 17): impeccable_live::manual_edits::commit::verification_targets_for_op has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 3, boolean chains 2 (nesting depth added 5). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a014dbe111e6c0a4a2e61f89277280acf19a78486a71dff2fe9c204e15843a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::repair_post_apply_validation (cognitive 17): impeccable_live::manual_edits::commit::repair_post_apply_validation has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 4 (6 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"5285ba723d6f9d7c3f8b4907feec15fde44de031bdfcc8bbd1ea803705c1670a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_ast::analyze_fragment (cognitive 17): impeccable_live::svelte_ast::analyze_fragment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"635e160cedce489df555714a454f652267df0c2e37a65143c2c85780f748b38c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::svelte_component::remove_selectors_from_svelte_source::transform (cognitive 17): impeccable_live::svelte_component::remove_selectors_from_svelte_source::transform has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e14bd31aa1756fe62dc7d8171bcbf069ff54b4b8fc1dccc61c65e90a3444bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Prompt::radio (cognitive 17): Prompt::radio has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/prompt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeda5ace67c761aa1489a67c52025fa1fce3e69e52d3e3281d2c00a18a387f8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::engine_binary::install_engine_binaries (cognitive 17): impeccable_skills::engine_binary::install_engine_binaries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/engine_binary.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7a68dec3a8103672a3adf2a17eb107265c985007b4477d0e1142f5f578e4e"}},{"ruleId":"D2","level":"warning","message":{"text":"10-probe.__collectTextRects (cognitive 17): 10-probe.__collectTextRects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d0bf9b597f668910286bce131559e187c7d587c72476e2961ad28d85c15cb"}},{"ruleId":"D2","level":"warning","message":{"text":"35-visual.createVisualContrast.sampleVisualBackgroundAtPoint (cognitive 17): 35-visual.createVisualContrast.sampleVisualBackgroundAtPoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/35-visual.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bd4a897604034efda66f8cf23f980658f284705a08865274df7a0ddb80df6d"}},{"ruleId":"D2","level":"warning","message":{"text":"component-review.Mn (cognitive 17): component-review.Mn has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 1 (nesting depth added 8). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 1). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e195b9b0a92be5b8f65629e13255cad47d5c88d3acae6cda43f266708e280784"}},{"ruleId":"D2","level":"warning","message":{"text":"component-review.Tt (cognitive 17): component-review.Tt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc87c3fa10657129f552340dd854abf7a20a602090a117effcc4223ec555cbe2"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.detectInsertAxisFromStyle (cognitive 17): live-browser.detectInsertAxisFromStyle has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e2de0dfb831ce0fc2c3a79375c4dd53f20ba22e3d88006ecc47d86ec9d3c99"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.splitCssSelectorList (cognitive 17): live-browser.splitCssSelectorList has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"5588ff43c92013c4e5b30d7e14236f4aefe48e0019ebfb1c98e60b7ce2e74974"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.startScrollTracking::tick (cognitive 17): live-browser.startScrollTracking::tick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7372}}}],"partialFingerprints":{"codehealthFindingId/v1":"255da7830d25ba1c71ac9b913cd8924aadca67ba024e78e812672ba6f4e9b40c"}},{"ruleId":"D2","level":"warning","message":{"text":"model.reviewUnits (cognitive 17): model.reviewUnits has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 1 (nesting depth added 8). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 119). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/model.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"97518be6389e42c991726bfe2cecdb319d967c971364773a481cb32e46c101d5"}},{"ruleId":"D2","level":"warning","message":{"text":"instrument-strip.place (cognitive 17): instrument-strip.place has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/instrument-strip.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b60196a86613b4de2adee7477ff6ee23c2d3874d1c0ec5c147372f03d47afd"}},{"ruleId":"D2","level":"warning","message":{"text":"createVisualContrast.sampleVisualBackgroundAtPoint (cognitive 17): createVisualContrast.sampleVisualBackgroundAtPoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/35-visual.js"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"483e5d4d7793c20a700e86ab8f4901011a665ceab5f4e68f45dd6a4b40d7427f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_account::health::after_scan (cognitive 16): impeccable_account::health::after_scan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/health.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6e5db0262f9836fe8800dc13c6b399ec28dbbcecf81cf8b5cfc30513ba055e"}},{"ruleId":"D2","level":"warning","message":{"text":"ResponseCapture::event (cognitive 16): ResponseCapture::event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/response_capture.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffe9f9025c9296a44fa8ef7a028a2b1c024abe7988b67ae4ac15669437adc26"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::entry_capture::static_inventory::walk (cognitive 16): impeccable::entry_capture::static_inventory::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/entry_capture.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6bc9d0479ff489d196a8a78fdb8df69228e2c970a6f159bb84cd2eab8e062d"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable::router::detect (cognitive 16): impeccable::router::detect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/router.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82f172211f60350a14a1a5eaaae169d46660dd054d44e8b433f459717afc12a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_common::seed::locate (cognitive 16): impeccable_common::seed::locate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/seed.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6141b8cd7efeade37be8704454523c71c9ab5c772e9a0abbb2a0ae94b7656b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::font_index::load_font_index (cognitive 16): impeccable_comp::font_index::load_font_index has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), loops 2 (5 pts), if/else 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_index.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73f46ede42c5aa6fe9e26beb621e0bec2ca226e3b86f647178cdb3ac17cb9d0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::hero::ink_box (cognitive 16): impeccable_comp::hero::ink_box has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fec71126ccb32f089cc2b7bd781e3dae15815a7e9d13650966f37eb0c38f8be"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp::metrics::horizontal_bands (cognitive 16): impeccable_comp::metrics::horizontal_bands has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/metrics.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c44665d191793b3f14f167359d992610b1836f65c53446f4136283b2e24cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::source_files::walk (cognitive 16): impeccable_comp_verbs::build_phase::source_files::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd207162d8452c22b5db0b4f1680db079d1557590756a085b4be78f62a7a5e8a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_comp_verbs::build_phase::clear_comparison_artifacts (cognitive 16): impeccable_comp_verbs::build_phase::clear_comparison_artifacts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), match/switch 2 (nesting depth added 4). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (clear_regions, remove_file). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d5714b1f1eba88eadd36a6e5bc24b6499233a16c527e65f9244fc4e8e3bb2c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::component_review::plan::decide (cognitive 16): impeccable_context::component_review::plan::decide has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/plan.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e954c5611ac064099a7b6d2763aed779dcfd548bae59ad1f889a3bb295bab4ae"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::context_cli::parse_skill_frontmatter_version (cognitive 16): impeccable_context::context_cli::parse_skill_frontmatter_version has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5168bd534e9af44efa29b428dddf39d0ffa429fba5dedaa557c4f62ebadc8c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_context::palette::run (cognitive 16): impeccable_context::palette::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/palette.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d712ecf04a290c628df4b81697bc53eec03be4b8d8c3c3538adabeea3f95ca"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::page_checks::occlusion_probe_rect (cognitive 16): impeccable_core::browser::page_checks::occlusion_probe_rect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4098}}}],"partialFingerprints":{"codehealthFindingId/v1":"156da78ac8ca517d9a68ae0d8307f8335cf22e0510c845dc62d38dcda45a6218"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::branch_z (cognitive 16): impeccable_core::browser::painted::branch_z has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3411a73ec81fc3932d856533323499f0ecee51d7c547fc53c4c3b03799eeb4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::painted::outside_document (cognitive 16): impeccable_core::browser::painted::outside_document has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"86806d9919ecd80c1809bb74d13ab895b82aa251b8a9c4b6606b3d84cca82a99"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::quality::clip_cuts_text (cognitive 16): impeccable_core::browser::quality::clip_cuts_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":3531}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d98be557483f8d72f911210674d0a3a6e0d0f8ec113c211d93c3d6125ee415"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::browser::visual::pseudo_layer_paint (cognitive 16): impeccable_core::browser::visual::pseudo_layer_paint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 5, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc3ee6f6a9f7c662a3858301b98e015aec4fd20f27d7b74a3d77bf861b4b8be"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::css_scan::keyframe_decl_only_pulses (cognitive 16): impeccable_core::checks::css_scan::keyframe_decl_only_pulses has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec395fc6dc7ab2033fce6a3ff13fe225f504f842efa85adf018a5e4f918937e"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::measures::ident_words (cognitive 16): impeccable_core::checks::measures::ident_words has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/measures.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"720c3eb2c498c86e0711d5622bf4dd173b5481fd39142d285fe0d0f2a671a187"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_core::checks::text_rules::is_numbered_section_label_candidate (cognitive 16): impeccable_core::checks::text_rules::is_numbered_section_label_candidate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_rules.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"670e644e481e3dac76cd9bcf1ef69fee31a9745866274137b14786d198b48bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::config::normalize_extension_entries (cognitive 16): impeccable_detect::config::normalize_extension_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d825d3b6b517a45f5abe147396ec79151701fc853edc414ccbb50ccd1100d6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::config::extract_finding_ignore_value_raw (cognitive 16): impeccable_detect::config::extract_finding_ignore_value_raw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd7e41bf9d01845bb1486bef2b65f0d40652259eaf5b60e337d314b967503b2"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::design_system::merge_design_system_findings (cognitive 16): impeccable_detect::design_system::merge_design_system_findings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3706072c3f7e147c8f781e3024f59a2e0523e84fbfc5b3a9fb3e8e51b90d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::list_rules::format_list_rules_text (cognitive 16): impeccable_detect::list_rules::format_list_rules_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/list_rules.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d295e7d4ec26a8a2815086e6c41f89fd147f99c3d1ffa57461c8b9135980a18c"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_detect::regex_matchers::sass_sheet_corners (cognitive 16): impeccable_detect::regex_matchers::sass_sheet_corners has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"265ee1881b0595e0934abcc262b0f4a48ede5a3f183f758fd447e0ec2c20408f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::browser::dom::merge_text_rects_into_lines (cognitive 16): impeccable_foundation::browser::dom::merge_text_rects_into_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/dom.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24b97c0d16166b40e18b26ce5162ac7a48c0aa85395e0c0660825fa09a877c0"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::js::to_fixed (cognitive 16): impeccable_foundation::js::to_fixed has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c86cffcb2adfde5525aed8391612fe81f0da066a403ded398573c44881e797f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_foundation::vectors::decode (cognitive 16): impeccable_foundation::vectors::decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8f902741a10b2c818428b61f39124516a0fcdd85bbecdb0841f0ddffcb688f"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook_lib::hook_state_dir (cognitive 16): impeccable_hook::hook_lib::hook_state_dir has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdfc1bd31c58a61a880fe09e25f5d470aff3511434875a68981b0508c58aadf"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_hook::hook_sessions::recorded_roots (cognitive 16): impeccable_hook::hook_sessions::recorded_roots has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_sessions.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dc12c976e87747d123f9f9ff0e3f33d6930a5099b9fb4ee90e23894ee58736"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_html::cascade::values::extract_static_color (cognitive 16): impeccable_html::cascade::values::extract_static_color has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/values.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85dce42fb8a16d11f1e7c35e9c3bebb693ff6d3c42d0505f30cf5494fb9a0fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::number (cognitive 16): Scanner::number has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/json_error.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ea2f79c671102212552975d026be3b1a7329ff7ac4c64cad725a7ce92286c9"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::scan_to_block_or_statement_end (cognitive 16): impeccable_live::accept_css::scan_to_block_or_statement_end has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d6e381bb70fc6e8bd5ecbb6fa6a6dd2942fa6cef495454c8be5d8b119f763a"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::accept_css::split_selector_list (cognitive 16): impeccable_live::accept_css::split_selector_list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3882b4c029b0ecf502082e50135f35f8329b59134d91610b3f10a3746b8c49"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::bake::split_first_compound (cognitive 16): impeccable_live::bake::split_first_compound has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/bake.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"da22bd0a21761672f0eab445d9133abc1f795c463767ec0eb0dada65eb89fccd"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::config::validate_config (cognitive 16): impeccable_live::config::validate_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/config.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61e6e8c5172dc8db43fb9f6c9d430153f08e9d2479adb0de5c4885777c6e781"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::parse_copy_edit_agent_result (cognitive 16): impeccable_live::copy_edit_agent::parse_copy_edit_agent_result has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"506fb2eb5728f4a400fab7f75f596038462cd410325d66893a3c2dc05b6d392b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::copy_edit_agent::choose_copy_edit_agent (cognitive 16): impeccable_live::copy_edit_agent::choose_copy_edit_agent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d3e6136f76e9d3782f21cd45b2df1aff2c26a11c529f5a20567688b5969254"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::design_md::extract_dos_donts (cognitive 16): impeccable_live::design_md::extract_dos_donts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbddd7d911a2beccefdab14e97ab37fecb69a05836a1816b608de20b9a3a274"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::inject::sveltekit::patch_svelte_layout (cognitive 16): impeccable_live::inject::sveltekit::patch_svelte_layout has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/sveltekit.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fac7a95847c27424ff81fb8d689869d88dc3d0103f0624b23801536386814db"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::inject::tag_strategy::append_origin_to_directive (cognitive 16): impeccable_live::inject::tag_strategy::append_origin_to_directive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/tag_strategy.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca90316cd4c0ba3ae61e5b310c1ac846641ec57bd20e0491975fae7ca8f62bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::live_resume::resume_cli (cognitive 16): impeccable_live::live_resume::resume_cli has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_resume.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7124670b16a938814f5eefe9a0649d7622da6debb5cd297a1e6c448cde295dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_live::manual_edits::commit::verify_applied_entry (cognitive 16): impeccable_live::manual_edits::commit::verify_applied_entry has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c2b85b5e34df8dddade9aa36bd61ecdf4b12236d997aad0bac6ce9421828f6"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::bundle::copy_provider_agents (cognitive 16): impeccable_skills::bundle::copy_provider_agents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa803e29c70e7e3adbf90cb5b572c605023643d346d16f5beed5f2965d094e1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::commands::prompt_for_providers (cognitive 16): impeccable_skills::commands::prompt_for_providers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49ca501134a803926c6bf1ce73d848df3842029c2d235649b02b5f81a764e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"impeccable_skills::commands::choose_install_scope (cognitive 16): impeccable_skills::commands::choose_install_scope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a54b418a8d8003e1af841aabf3237018988a1ca249314550941e5e5dc5bb358"}},{"ruleId":"D2","level":"warning","message":{"text":"15-snapshot.__snapPseudoElementHostSelector::consumeFunction (cognitive 16): 15-snapshot.__snapPseudoElementHostSelector::consumeFunction has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (15-snapshot.__snapPseudoElementHostSelector) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efd63ea16f12adcc02e0e34efaef4282166a28ddde7ea39dfdde4d52b94d735"}},{"ruleId":"D2","level":"warning","message":{"text":"15-snapshot.__snapSplitCssCommaList (cognitive 16): 15-snapshot.__snapSplitCssCommaList has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f97983709c7851b8e1815d70c699b53bee037b8410c7fb58dbdffb53dea6288"}},{"ruleId":"D2","level":"warning","message":{"text":"map_inspection.html.select (cognitive 16): map_inspection.html.select has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, ternaries 3 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/map_inspection.html"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e153b4c097276ee7b0ea11e30b8925dcdd9b3c6265f935febff1b44b2e3ceaa"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.buildInsertConfigureRow (cognitive 16): live-browser.buildInsertConfigureRow has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 2582, 2560, 2611, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"106fd0cbd775d93c2790a38d31f330699b86445bbeb19bab7f2b6a239c9c3547"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.queryManualEditRef (cognitive 16): live-browser.queryManualEditRef has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d2bbb5f7984a65bc0799312d9fddea697ac75f078807bc0b7402b2dc4fabd3"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.stripSvelteKeyDelimiters (cognitive 16): live-browser.stripSvelteKeyDelimiters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5863}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9bf21e404e199d5436638000809cd04678f61a4b07b59c763f507ff264c8e0"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.handleMouseMove (cognitive 16): live-browser.handleMouseMove has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8172}}}],"partialFingerprints":{"codehealthFindingId/v1":"989fb25a5d8c6d934ab21efe406a53e6383e5627b8716f5262eef958d190ce37"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.onDetectMessage (cognitive 16): live-browser.onDetectMessage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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":"skill/scripts/live-browser.js"},"region":{"startLine":12542}}}],"partialFingerprints":{"codehealthFindingId/v1":"797832121383f48a05c90530ed136cff58daa067ba8c2f492cd4642f17afcfdf"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.renderDesignVisual (cognitive 16): live-browser.renderDesignVisual has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55415a950c0f177e94f94126e4c2a96a6afad5559b5e756422792781e93d030"}},{"ruleId":"D2","level":"warning","message":{"text":"live-browser.renderComponentTiles (cognitive 16): live-browser.renderComponentTiles has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 2 (5 pts), loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13468}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d335ba5c6796e5c43259860b88bd99e4de3656feff8df8fb79001043218f18"}},{"ruleId":"D2","level":"warning","message":{"text":"Lt (cognitive 16): Lt has cognitive complexity 16 (threshold 15). Drivers by points: other 7, boolean chains 4, if/else 3, ternaries 2. Of this number, 15 points are the body\u0027s own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6e4b899f5938af0266073a9181e779548941b9404abdf4f62da35254d963d5"}},{"ruleId":"D2","level":"warning","message":{"text":"_n::Ge (cognitive 16): _n::Ge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5, ternaries 3 (4 pts), boolean chains 3, other 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d4e60f2a3ebe90b4bde1e861fc03a876ece0c35631d9bba8188334c37f67f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/live-browser.js: FileTooLong \u2014 9679 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 9179 over it, 19.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae818ec1b7b52e1953ac35f485e552322a0433df7fce9c0b9c7ea71dcb15163"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/element_checks.rs: FileTooLong \u2014 3610 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 169 free functions. The bar is 500 significant lines; this is 3110 over it, 7.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66976b40fb370f18306d2b8ec38c749a737b23c4fcebf4693b2ffb7345a6eab8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/page_checks.rs: FileTooLong \u2014 3243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 145 free functions. The bar is 500 significant lines; this is 2743 over it, 6.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db47b018a642367046b606cce86f9ab6af47bacd7fbdbb97ee365ce0dc315c3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::browser::quality::check_quality: FunctionTooLong \u2014 impeccable_core::browser::quality::check_quality runs 544 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 444 over it, 5.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bea3bb6ae1ccb14acd4dcff75962f3eaaa1eac420bd86527a1da3fa9a927f37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/visual.rs: FileTooLong \u2014 2663 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 141 free functions. The bar is 500 significant lines; this is 2163 over it, 5.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac44f34d0bf253fe221931489be26c3bee88bf66d856c3fd838341806410c28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/build_phase.rs: FileTooLong \u2014 2480 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 92 free functions. The bar is 500 significant lines; this is 1980 over it, 4.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eaf1316721bcb93ed2f40e280ce680899c2c1eb0f61d7ac03df6c7162762f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: plan-review.mountPlanReview: FunctionTooLong \u2014 mountPlanReview runs 493 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 393 over it, 4.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8d33669507c13a3094ccbfd1393b5d06fc014f899d032c94c46ee946ee6f4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::serve_question::run: FunctionTooLong \u2014 impeccable_context::serve_question::run runs 474 significant 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 374 over it, 4.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e0641a9570fab0c48e0063c7068dc3f380247d3aecd5185ea822e77c269dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/live_server.rs: FileTooLong \u2014 2212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 1712 over it, 4.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0e2eb4fcf01d4d616aae4e69551728718d73a0819550f874d0895300aee621"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/regex_matchers.rs: FileTooLong \u2014 2116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 81 free functions. The bar is 500 significant lines; this is 1616 over it, 4.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae93822b02fb6cb291f0d925988f621064bbe0d94f655ea41c34642634d7c98a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 40-overlay.createImpeccableOverlay: FunctionTooLong \u2014 createImpeccableOverlay runs 422 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 322 over it, 4.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0cc82d049533ff772b9558256118699bf41e2aef70a8514fe1dc24840e4e40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/driver.rs: FileTooLong \u2014 2099 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 96 free functions. The bar is 500 significant lines; this is 1599 over it, 4.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2008f8428cc527ecae0bb71659179c2cc5a0561c3999676f1be8c17906e24dce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/quality.rs: FileTooLong \u2014 2039 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 72 free functions. The bar is 500 significant lines; this is 1539 over it, 4.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"969323ed12d0e582b74df3b8e44e868481e9b4022be44b5d15285533b9533573"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checks/css_scan.rs: FileTooLong \u2014 2033 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 61 free functions. The bar is 500 significant lines; this is 1533 over it, 4.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bab17aa762675fff31e9139aec3db2216564a34a21e997d34b2c1e1cf7e41d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp_verbs::build_phase::gate_hero_inner: FunctionTooLong \u2014 impeccable_comp_verbs::build_phase::gate_hero_inner runs 399 significant 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 299 over it, 3.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3df700eac0059db4f710db06bcaba1f933391f5847dd37f29941254fcbdfb6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::session::apply_event: FunctionTooLong \u2014 impeccable_live::session::apply_event runs 380 significant 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 280 over it, 3.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbba5935cb1ca11f8c0d8a286cae4e13fba11cc489952e72019ad4e8a92cd8f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_hook::hook::run_hook: FunctionTooLong \u2014 impeccable_hook::hook::run_hook runs 377 significant 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 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1398a123922046e3bc900bf8567c86da36a2b9bcb9a852b6eaef201fbd30953b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::browser::element_checks::check_element_colors_dom_in: FunctionTooLong \u2014 impeccable_core::browser::element_checks::check_element_colors_dom_in runs 366 significant 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 266 over it, 3.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3fe2c1c243fc2575fd1838a8abd1bf01403df54f75d0c408768b6c5f02cecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_detect::cli::detect_cli: FunctionTooLong \u2014 impeccable_detect::cli::detect_cli runs 345 significant 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 245 over it, 3.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b97342cdb679f84615825d5db71e261f757ce635e965c7008e1ac8455b8ea55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/detect_text.rs: FileTooLong \u2014 1716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 1216 over it, 3.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9706f82683340da9913a883b729c6b332d613a6522713d8fe320f73b358e8b37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hook_lib.rs: FileTooLong \u2014 1688 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 116 free functions. The bar is 500 significant lines; this is 1188 over it, 3.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a3fcf756ad28c5db639bcfe213a6700c079c9bdf425dcba6e5abe469e325f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manual_edits/commit.rs: FileTooLong \u2014 1680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 1180 over it, 3.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95fbbd2f2b0266747e9027bbbe932dd1165d17fffa4323aa8522bde3b9df863"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/painted.rs: FileTooLong \u2014 1632 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 105 free functions. The bar is 500 significant lines; this is 1132 over it, 3.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cb99b9b038182d714e006f6f08840bcff903a227f423f1ae1c3b404ef51119"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/serve_question.rs: FileTooLong \u2014 1628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 108 free functions. The bar is 500 significant lines; this is 1128 over it, 3.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a98b8349c5a33151a2e9e5e40be3908e257429df9d260ae5a1aa6ebab442d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_wrap::wrap_cli: FunctionTooLong \u2014 impeccable_live::live_wrap::wrap_cli runs 321 significant 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 221 over it, 3.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_wrap.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2b0dd0c067d0467f1d044e233f0ee0054acdfaa8fda104016056f37ce6c9ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_server::handle_poll_post: FunctionTooLong \u2014 impeccable_live::live_server::handle_poll_post runs 304 significant 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 204 over it, 3.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f14ef3a1cef2347f16505de38d709f26a72370aec3d535f53d999c63c19880d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_html::quality::check_quality: FunctionTooLong \u2014 impeccable_html::quality::check_quality runs 302 significant 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 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"128892251306c8b5e24ea9f803768d5a4b4c42f72488a3277085987a9a6bc2fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_server::handle_manual_edit_commit: FunctionTooLong \u2014 impeccable_live::live_server::handle_manual_edit_commit runs 296 significant 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 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeebd7ade1f9f4225ad63ce922e6bbcde9c195d8f476dfb73932362a2ef56468"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cdp.rs: FileTooLong \u2014 1479 significant 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 979 over it, 2.96\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a006b1dd2ded2e1870f778551f99b0cc27203f10e61473aaa34778d99392a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_server::handle_manual_edit_route: FunctionTooLong \u2014 impeccable_live::live_server::handle_manual_edit_route runs 292 significant 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 192 over it, 2.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e0037fbacc4b4264e764ac31e7276645ea41fcc51d06efd23954ea4dd86bb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checks/rules.rs: FileTooLong \u2014 1457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 957 over it, 2.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e094589f5f514e1802524df414952153a817f5526adbfef30a2d7ae5f463c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/design_system.rs: FileTooLong \u2014 1456 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 85 free functions. The bar is 500 significant lines; this is 956 over it, 2.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13c6a93cde79a0e121670e3a0834de2375a9377eeb953fa1f516228096d583c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: impeccable_wasm::exports_pure: TooManyFunctions \u2014 87 free functions. The bar is 30 free functions; this is 57 over it, 2.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_pure.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d869d52d08e278d0d51da91ce216cb7ab32dd384bd232d57e1c99b6d5a71a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp_verbs::build_phase::run_with_renderer: FunctionTooLong \u2014 impeccable_comp_verbs::build_phase::run_with_renderer runs 287 significant 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 187 over it, 2.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":3428}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0d46a1b83d216e18af979ee3a4143cab076ba1656784667d84166881167207"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_hook::hook::run_stop_hook: FunctionTooLong \u2014 impeccable_hook::hook::run_stop_hook runs 286 significant 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 186 over it, 2.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"620353d19ddda81278b930e5587f272a65861666cf16da85478857a08b087758"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 925 over it, 2.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db72475dbe1f44cc923c1722bac65a2391f3c476e737fac03d9bb9237442436"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/svelte_component.rs: FileTooLong \u2014 1362 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 58 free functions. The bar is 500 significant lines; this is 862 over it, 2.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a873314124b80efe7a6b666ffb8e0da05b00279f507d06ab95a5e63feb39617"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerState.page: MethodTooLong \u2014 page runs 270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 170 over it, 2.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d77c530f0f4bb97482ba8dd250c3c01a75dc35b630137e35bbff2ce88b6f30a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manual_edits/apply.rs: FileTooLong \u2014 1345 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 845 over it, 2.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c06215fab0ed05f2b521d2a17b24dce3eaead21f815e4e70b4cceeaf51efcb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_server::handle_connection: FunctionTooLong \u2014 impeccable_live::live_server::handle_connection runs 263 significant 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 163 over it, 2.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"54379efc88a40cef10de57fcd811dfe592ff474ef483a01baa295efaf152e76d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_generate::run: FunctionTooLong \u2014 impeccable_live::live_generate::run runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"855a807d32fa846adb554a5df998a8a4c98d368420a2e47495000c4ee6b7e6c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_accept::accept_cli: FunctionTooLong \u2014 impeccable_live::live_accept::accept_cli runs 257 significant 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 157 over it, 2.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"37938e78f8e421ab4349b640f3f94c4a2d0378a3e0abdd2ab799a758857a8bd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/adapters.rs: FileTooLong \u2014 1250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 750 over it, 2.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea854e9aaf4497905b53d8aff915b99203b0ec7eb0d2f732bd2444664b3b0f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/copy_edit_agent.rs: FileTooLong \u2014 1240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 740 over it, 2.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769a81c7c2bf5165c1e3e3530501107845f53e78ac081869d30069bd52a46eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp_verbs::font_match::run: FunctionTooLong \u2014 impeccable_comp_verbs::font_match::run runs 241 significant 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 141 over it, 2.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/font_match.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad134638d3e0a10f7610049539382b9ad379c68058484853825c99e4aa741c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server_state.rs: FileTooLong \u2014 1175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: ServerState (2 blocks, 110-1298). The bar is 500 significant lines; this is 675 over it, 2.35\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1630f9eac0232a775905eeceac190221c3c814fd3fdbb4dd56597381f3a8e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::checks::vectors_a::call: FunctionTooLong \u2014 impeccable_core::checks::vectors_a::call runs 231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_a.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"93736c0626dc4781c4102a561caf05e05d1a83551545de008937bfcfa81bc6aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp::font_fingerprint::measure: FunctionTooLong \u2014 impeccable_comp::font_fingerprint::measure runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"5743dab6ff18bb2a6cd7f1a425c43ecb75f2796ad10b02bf85af370847031b6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable::asset_capture::capture_page: FunctionTooLong \u2014 impeccable::asset_capture::capture_page runs 227 significant 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 127 over it, 2.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a02cc712b95f6c54c87bfe5ccd863ac25dc2ae6600abd97989027fd0e83dc90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_server::run: FunctionTooLong \u2014 impeccable_live::live_server::run 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":"crates/live/src/live_server.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db7d10f0646c5f6f1e7cdd49139dc7795a7e3be69047d208d6f5dc80d3b542d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_html::engine::detect_html_source: FunctionTooLong \u2014 impeccable_html::engine::detect_html_source runs 225 significant 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 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/engine.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3579820b18994408efb51194155e0927f3a2aea1d8cd6bf6c91aa7ba206d68"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3313af157a63e30546a23dd5fa4ae9945ab49ea81821ca276023ee5f58d78254"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: review.mountComponentReview: FunctionTooLong \u2014 mountComponentReview runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff620e1bd18b611fd7c9f1f0fefcafa7a031c375e1c5990d1df69307c27e083"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/design_md.rs: FileTooLong \u2014 1107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 607 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"273b7669ad50d4760c316e71195c963885e48a621bf904fd94169256dc0ee182"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_inject::inject_cli: FunctionTooLong \u2014 impeccable_live::live_inject::inject_cli runs 217 significant 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 117 over it, 2.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_inject.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ab60d0fe50d683bed7f90f4a8e0315f9103ee029de5b6354732a894290a4af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_boot::run: FunctionTooLong \u2014 impeccable_live::live_boot::run runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_boot.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"025380631b44c95321c3355088cf11c83349f070256da7ea67d8e797ceb03ef0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_html::cascade::csstree::tokenizer::tokenize: FunctionTooLong \u2014 impeccable_html::cascade::csstree::tokenizer::tokenize runs 211 significant 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 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/tokenizer.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03034940c94bb9c0bd5214f4b644c26866ca5fde906cd410cf7be9c2dbe1fac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: live-browser-dom.createLiveBrowserDomHelpers: FunctionTooLong \u2014 createLiveBrowserDomHelpers runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-dom.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b430a4323fbdb57252fff386dbba3320d417168eb73f1c1e83a32381f19b64e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::concept_seed::render_roll: FunctionTooLong \u2014 impeccable_context::concept_seed::render_roll runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aac29aa483db82c23a3d3fc06790678d3be591ec144c01b770c2fca262df223"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context.rs: FileTooLong \u2014 967 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 467 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fe5994f8d711a6fa4e5a3295d88c4081110cef6cedec44d6b86ce4325ede4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_agents::resources::apply: FunctionTooLong \u2014 impeccable_agents::resources::apply runs 192 significant 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 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2677e214292a1d0d2e0d6a81b015cfe8c7da540f94c1e9e88a029869ff311cce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/live_accept.rs: FileTooLong \u2014 954 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 454 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ebe2db475a76e37901962f7efb6653afeb1cfaa761dbfb54f93a7771aa812c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_foundation::fdlibm_trig::kernel_rem_pio2: FunctionTooLong \u2014 impeccable_foundation::fdlibm_trig::kernel_rem_pio2 runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b6aee2844bbf756c19a64fd79eb682bd8b25de0990ce718f43fde3c55c471d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_insert::insert_cli: FunctionTooLong \u2014 impeccable_live::live_insert::insert_cli runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aff1b45a26b0a83d92c9457fd5a76de1e61765fcac32ffa4ac821ce1f64ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: csstree/parser.rs: FileTooLong \u2014 948 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 448 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a6aab718748327a81d180e73323e2f20a0558d7747791ff810daa631fc8d4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checks/text_context.rs: FileTooLong \u2014 918 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 418 over it, 1.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9169f10c2e43045c862f6e657eda06f2830bd9b8575a5a97d409a24adef44c13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli.rs: FileTooLong \u2014 915 significant 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 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4817a0aecf38d74fa10088ed9bbc66610fa118c8a1b82a35c85d6a2ea9948a66"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ServerState: ClassTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 2 blocks, lines 110-1298. The bar is 400 significant lines; this is 316 over it, 1.79\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3c986c9222e1dff3513563990396a88015b4d433b152e0975576c89adadf03"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::checks::html_patterns::check_html_patterns_picking: FunctionTooLong \u2014 impeccable_core::checks::html_patterns::check_html_patterns_picking runs 179 significant 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 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"376b5b64d1c8972c97e18a7cf936ffdad68206f0576bc7374672911ef16074c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/font_fingerprint.rs: FileTooLong \u2014 880 significant 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 380 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1643080182f0104cfd0331543257be1823d737d0fd0ddf53611ab9d78019b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/admin.rs: FileTooLong \u2014 871 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 371 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8aafb5dd22d8153d997c975a6b57a61633b317f7175a2f15641dde372aa2f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_hook::before_edit::main_flow: FunctionTooLong \u2014 impeccable_hook::before_edit::main_flow runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b322bc164a03e0425106ea2467d418b75f7bc291e919b363c874eaecbc8a0dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: impeccable_skills::hook_manifest: TooManyFunctions \u2014 52 free functions. The bar is 30 free functions; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"716411ee5f3a030d176ba8532ff9ab949df3b8dad95c76cd26605440fdcf8673"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::component_review::manifest::freeze: FunctionTooLong \u2014 impeccable_context::component_review::manifest::freeze runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/manifest.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f067aa36e2b913004bf8f33fd60582a4e7cafe626e07d7dd238d55e7aca60c28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::generate_image::run_with_api_base: FunctionTooLong \u2014 impeccable_context::generate_image::run_with_api_base runs 167 significant 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 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"848f5331333b8f8f37170aa175b9a36aa93527d603963ace1a67964947527b3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_detect::detect_text::strip_js_comments: FunctionTooLong \u2014 impeccable_detect::detect_text::strip_js_comments runs 163 significant 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 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4013535411b4af3ab9e70d58a725af51c841af266ade5308ebb33568728660c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_html::adapters::check_element_colors: FunctionTooLong \u2014 impeccable_html::adapters::check_element_colors runs 162 significant 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 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a4084d4779f9d868e1833cbc43d90bdc0c3f3c0c8e46e67f75648b5507ba5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ServerState: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e240073cb3080aafff51c3a9652f8be53707764c49a4cb145fa9c8184eff589d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_detect::detect_text::detect_text: FunctionTooLong \u2014 impeccable_detect::detect_text::detect_text runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df4f16f38eca06d324b7931df6236eacde4361a8c53fd7d5269c7e18fa540e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 290 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6f681e599adf0cfe5a8b471cda0106c3b3b2c4506e79b34c0add1f84c458cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp_verbs::map_inspection::inspect: FunctionTooLong \u2014 impeccable_comp_verbs::map_inspection::inspect runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/map_inspection.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d31e227c2c82de6f2deedd57719c9e4c32d9a62c55160f95265ab46784e6c37"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/measures.rs: FileTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 288 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/measures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4f908ce14124d8b278f8fdbc1decc0edb8362967c72b0567b6fe909bcd2ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_skills::commands::install: FunctionTooLong \u2014 impeccable_skills::commands::install runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf45294590817544a1980b0eebe9541b5f46e015e66abe46a69b7a2d68aa7e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fullpage.rs: FileTooLong \u2014 763 significant 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 263 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c528b5e9b567da56fb952ab4cb7c79a0ee50681b92ff2c49a03473918c549e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/color.rs: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 237 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5500c0a663efe5f18bc7ddca5d7631164e671856e1de04805387026c013c65f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/accept_css.rs: FileTooLong \u2014 734 significant 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 234 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be43df2d6f0ddd3281618a1f5bf83bc709a52bdfd1b160de484ef7bbe603576"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/quality.rs: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 233 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a39aa8c32099400c69dfbef04f46ced0b56b0fd71e10361705abfe59999675"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hook.rs: FileTooLong \u2014 732 significant 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 232 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0c844a7a7cd52ea52f076eab926e1b29668b10d0c4b0df31863d135fe821a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/text_layers.rs: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 225 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c842aad2cf1f0a3adbb3b8a35c329f932d0edb371334a052cfdde0178bf9746b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_skills::commands::update: FunctionTooLong \u2014 impeccable_skills::commands::update runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ab12d903891064e7af7e9829a4355e0ebc1d3c971950186510889ef55400cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser-bundle/15-snapshot.js: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f330b505375d7723b87622d092a97971b331ccf072924cde5e36765cefefb7f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_account::design::after_scan: FunctionTooLong \u2014 impeccable_account::design::after_scan runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/design.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed117725b07399318d5927de6ec5b979fb8fb301f2a67349de597dff4a2122ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp_verbs::build_phase::gate_responsive_inner: FunctionTooLong \u2014 impeccable_comp_verbs::build_phase::gate_responsive_inner runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a7b1edc21e4afe866c231e0db9b6c414c7ebb78c1fff848e4e5e1b4037308"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CdpEntryRenderer.capture_at: MethodTooLong \u2014 capture_at runs 141 significant 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 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/entry_capture.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bee259256e882efb31515ff9d20b99fff54cf474245dc7312ab13669882354"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::component_review::store::prepare_bound: FunctionTooLong \u2014 impeccable_context::component_review::store::prepare_bound runs 141 significant 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 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/store.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a0e2bbca714f5a674513da44428eb19c0f3db1e40cc7a9f7663e474963466f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CdpAssetRenderer.capture_batch: MethodTooLong \u2014 capture_batch runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7964e1ed5a9c1bb1706d1db7560f7b2effa8adf9bdd275e484358676de38c239"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 699 significant 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 199 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a73dcaba757b99c16b489398925251d55be95c46ba43822afa848c01fe92cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/snapshot.rs: FileTooLong \u2014 696 significant 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 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/snapshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6226090b9f7dc3a032bf520e1c9e9307328f6656cd8f290090ecf65e3c93ba86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 695 significant 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 195 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f213298aa14e18d0a2b4c40a07665f635719f38e75701e49dff3a20cfe209303"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::catalog::validate_concept_catalog: FunctionTooLong \u2014 impeccable_context::catalog::validate_concept_catalog runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/catalog.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4844856f8979bbbcc0e805a990dde6000611d05fa03c710e07d85f2d3cffc89d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::critique_storage::run_with_saved: FunctionTooLong \u2014 impeccable_context::critique_storage::run_with_saved runs 138 significant 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5077697042bb7bbab750b7d4fd4455bc7d029ad37af8eca8be93a9b2656506"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_detect::cli::scan_targets: FunctionTooLong \u2014 impeccable_detect::cli::scan_targets runs 136 significant 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 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"a405fae42fa3c84cc984ef4b525c28d015311e099b6ffa203f215272e824a53d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::checks::vectors_b::call: FunctionTooLong \u2014 impeccable_core::checks::vectors_b::call runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_b.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6465962ab488114b6070c2266a6058aa3f4e1c6f31240611fc2500dcc36fdda"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Page: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"852913f15aecf5e304df3ce9d4ecce9fa8e71bf9314e112be6e69ef7e1ef49a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b8934a5398067ca852c1af8162b7731ba6159126347332895681721716c3b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_agents::resources::build_resource_records: FunctionTooLong \u2014 impeccable_agents::resources::build_resource_records runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"77db995fa73858b476a605400376ee1fc7f74213dba5a37fe5418671dcfee61f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checks/html_patterns.rs: FileTooLong \u2014 663 significant 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 163 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4477db03ae35b0c6532afaa65e6005a8a95ce36e09b0804bd6ee0042de63299"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::checks::css_scan::scan_css_text_for_pseudo_stripe: FunctionTooLong \u2014 impeccable_core::checks::css_scan::scan_css_text_for_pseudo_stripe runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf7228baa4eef517af7b66f5e2723a23820bc77009f4b85bd4c2c2c7ac45d43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::checks::css_scan::path_is_rounded_rectangle: FunctionTooLong \u2014 impeccable_core::checks::css_scan::path_is_rounded_rectangle runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"303c0bafa5317031670b2b3378359943b4e3b8e47b75fdb595eb5246eabfe9db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable::router::run: FunctionTooLong \u2014 impeccable::router::run runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/router.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d587e43922f3b683961f1a530f8104f5d1299f8a97653c2eb44ed259d07f65"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generator.node: MethodTooLong \u2014 node runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/generator.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea0dcb4cd5862736ad739c491535eedff97852a9acbe2e814ba77feef9d7e47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_detect::detect_text::run_regex_matchers: FunctionTooLong \u2014 impeccable_detect::detect_text::run_regex_matchers runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7a701f7ea64d7aeeb4a5ac37d98572eb1772cb82a49c4e5abb548539225531"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::live_server::handle_events_post: FunctionTooLong \u2014 impeccable_live::live_server::handle_events_post runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbce1249cba489362de903ce3a6581ce06836b37f78bf31e4d8ad16d57d67a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::manual_edits::apply::push_batch_in_chunks_and_wait: FunctionTooLong \u2014 impeccable_live::manual_edits::apply::push_batch_in_chunks_and_wait runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfc955483f67fa3d8ff1f6fe6b93971618c3a2ac6a560c2086da7bc6584fddf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp::hero::text_region_check: FunctionTooLong \u2014 impeccable_comp::hero::text_region_check runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2001d65e40744d1cf343e6b2801d3daa0dc77af6fb3a14e19ba671978411ef2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context_cli.rs: FileTooLong \u2014 641 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 141 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229441701834737587561f1cf9c80074cf45710b013e50d084a716a366ba668"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: csstree/tokenizer.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/tokenizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27ef962c7c594932a52504ff3d0f27f38f36ad4ffb33935246e055683fadbb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bundle.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), declaring 36 free functions. 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":"crates/skills/src/bundle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2fe5a84f831f3076822183e02f11706fe132f05c87eba8923ed1c0a0198946"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/before_edit.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ff8e67aea5dc2212d2905355b5f1f419c7a20da9d356040bdb9b42ad53bf91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::component_review::server::serve: FunctionTooLong \u2014 impeccable_context::component_review::server::serve runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/server.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f940d6c4d841e686663482ac7e77133cfd63a03728b9b35311a42736118ab64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CssHostIndex.new: MethodTooLong \u2014 new runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16cc2832fbdf86e00564df7729c05b6e6316c6b6a70c056e8ec1b4a3ccd6d81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/asset_capture.rs: FileTooLong \u2014 626 significant 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 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab315d4ade46393190fcf87e5117abbf17f97d51418d17e4a63161f9700b741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/text_collectors.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70113791183064c05f15dbc61c4c48a4b6b606472f8e4915a94afda71476140"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::embed_prompt::run: FunctionTooLong \u2014 impeccable_context::embed_prompt::run runs 123 significant 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 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/embed_prompt.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d2b9b45fd1e5f93b98021ed16842b11ac6d2888432367be8ffe6ac57309460"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/render.rs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f94c1315f74f09d88ffad92ad863b03c4680b0582596f163d0b38cf102c83c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/critique_storage.rs: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81116cbb129808431beaf47d9298199493c4f92425439a56048ce9cdc57e3f3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/live_poll.rs: FileTooLong \u2014 606 significant 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 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab6657ab84008860af72743c7b10b711fd99b1144956de8517042dc42ee9133"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comp_diff.rs: FileTooLong \u2014 601 significant 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 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1784abb50b0da36dbe12b21715de929050452bfdc4e3a4e4653598bee357a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ServerState: TooManyFields \u2014 36 stored fields beside 48 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"78826ee9c91839cbb4dba30f4345da7107521d20333b393a26e6cb7e7a685e2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_foundation::color::parse_any_color: FunctionTooLong \u2014 impeccable_foundation::color::parse_any_color runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2cfc4e0d4cd7c9d8a64fba11cd9b1cc141c328346163c948e4ee7f45b55a66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checks/gradient_geometry.rs: FileTooLong \u2014 598 significant 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 98 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/gradient_geometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1cd025660405a67188b4117e775993bb41513e4b6b04d086967beb74b05313"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: css/scan.rs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ced11d5252ab15cca6c115b360037340cb001dbc96469a06da890a95d4ebd3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable::loop_install::run_inner: FunctionTooLong \u2014 impeccable::loop_install::run_inner runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_install.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6872019fc7685bf48bfe01ca26af33b1730c0555fdf644ed78be9abdda4c077"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FakeEl: TooManyFields \u2014 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/fake_dom.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7544cb3a1550e2f9fad12215fc9ad5fcccf318797fcd0fb66cc0f96dcdfcbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/jsp.rs: FileTooLong \u2014 583 significant 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 83 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2785ca83824541bfb6fbfd87dce50ee1c0f827f2b7205e34a53913651a1977"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_common::http::read_request: FunctionTooLong \u2014 impeccable_common::http::read_request runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/http.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0310c1a1f619cab8cb8a7e49e7a1dd0adf4ea011f9e3101d4274ea294543c238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manual_edits/evidence.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/evidence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3e865ccc7f84260206a8097752113e08cc05f258cea216bd2ff178ff99f35b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::component_review::run_with_capturer: FunctionTooLong \u2014 impeccable_context::component_review::run_with_capturer runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef342c2239e421aa2cd3245cdcf3b2926ab66438eee24a9d03c38ec374b552e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/concept_seed.rs: FileTooLong \u2014 566 significant 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 66 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ab4136ed196dacc361864460043ba41afa64b2ef2dfc925d64b9a9ab6f48bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::accept_css::bake_param_values: FunctionTooLong \u2014 impeccable_live::accept_css::bake_param_values runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f26795008d8a0a54a58cff91c07e497df4e120778ca7ccaf2b885ab2f98d435"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pro/mod.rs: FileTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 63 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/pro/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59dd890041fc6343a850eea68ef727f8f535b017872d43eaf39c79f8cfcede1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: checks/measures.rs: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/measures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e3e763d0a9651dad6962608f266857d9b2902151ff157d9161bbdb076b01b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable::capture_service::serve: FunctionTooLong \u2014 impeccable::capture_service::serve runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbd3ea872da4c7e45ac41506183340a4b5ea71fea853a68fa737595f5fa3162"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_html::cascade::csstree::generator::safe_pairs: FunctionTooLong \u2014 impeccable_html::cascade::csstree::generator::safe_pairs runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/generator.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f794d9cf35c47462a6174f62a3526ad2694ed123e618d45124d5b977cae907b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/loop_connect.rs: FileTooLong \u2014 553 significant 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 53 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_connect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68af113800c55fb5dd1d7d8fd5e55f2fb7f80e2ebe69c6839de6a1c4814bcc2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: impeccable_wasm::exports_visual: TooManyFunctions \u2014 33 free functions. The bar is 30 free functions; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_visual.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cd3086ec103fde5fc5c9813983903c1386082650c255b96b6a814394c4bd83"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::browser::painted::unpainted_walk: FunctionTooLong \u2014 impeccable_core::browser::painted::unpainted_walk runs 110 significant 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 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"9497bdc6f085c2a0c2acb3b01cf3308da4a0f166a60dd78bf7a3f2695c87ff4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_detect::detect_text::mask_js_literals: FunctionTooLong \u2014 impeccable_detect::detect_text::mask_js_literals runs 110 significant 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 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"216142ff3c3343cc2d29642130457b28564e073c8cd8af6bc8104458e49582bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/live_generate.rs: FileTooLong \u2014 549 significant 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 49 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b93157e70f7dfac9a6bcce03b80b6b5be81d09a8aedec41de3d6c91e1db8e5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_html::cascade::shorthand::expand_static_declaration: FunctionTooLong \u2014 impeccable_html::cascade::shorthand::expand_static_declaration runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/shorthand.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"33abdb7a870486438ee0a0d7b8d1d521b4257580e437e9a202a1cff728bf9845"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 35-visual.createVisualContrast: FunctionTooLong \u2014 createVisualContrast runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"browser-bundle/35-visual.js"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4651ce7641f2814ee6c85b86d38aa5dcd727155d2da0dbc1a60400ef2a59793d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::checks::css_scan::scan_css_text_for_pulsing_dot: FunctionTooLong \u2014 impeccable_core::checks::css_scan::scan_css_text_for_pulsing_dot runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2977}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec0c4f2fa53f89d627421df2a1c3f1ed1da1ea73556c04fa77c693029852d0e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StaticDocument: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/dom.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a295f2ad05b2ab71659eba0e4a60200d7d31afbc45578f2bd907f3db54388389"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: component-review/plan-review.ts: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: mountPlanReview (52-631). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b267063ac26caada4791ee3bfde01eba8d68a41e22c8610a8751ca575d84c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_account::pro::refresh_with: FunctionTooLong \u2014 impeccable_account::pro::refresh_with runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/pro/mod.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee987a13a75bd37a6461793ff16424030e9a54b23909812dea9852364c4a7551"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Prompt.checkbox: MethodTooLong \u2014 checkbox runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/prompt.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6304e517065c5efc377d0d3f751cde951225c44229f419d3e06a8c51427b8351"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_context::signals::git_signals: FunctionTooLong \u2014 impeccable_context::signals::git_signals runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/signals.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f958f79e1fe8a122db8078bef37252076c6e3eb598d1919933de20ca6400d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resources.rs: FileTooLong \u2014 524 significant 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 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d94186b9c1209bf7c714aa30abf35dc527a6531e32d8f34de7c7fe4143cace"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/providers.rs: FileTooLong \u2014 524 significant 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 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/providers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6554470d0de843193fb7fff0e151c3c9efd59eea3ab65ed4cf64e82ae550d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::browser::visual::unread_reading: FunctionTooLong \u2014 impeccable_core::browser::visual::unread_reading runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4748488e77ab322721aa5bdd00cfa7ab2d671d02cdcc18c591fc5a02ebecbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::server_state::run_generation_preflight: FunctionTooLong \u2014 impeccable_live::server_state::run_generation_preflight runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b322ef2b709fa2fcedd26d1cbf9daa1ee9382565bad33f3e4e92a6dd8c1a0575"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/font_match.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/font_match.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67a37145c797cd2e4648355b51bc8f631b9b31303fb39a94ba4a49266ead8b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: impeccable_browser::snapshot_engine: TooManyFunctions \u2014 31 free functions. The bar is 30 free functions; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/snapshot_engine.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc5db21ccd0a1ebbe127fd2be4508425c6a1b62a15e6dbe92e0b97836c0c11c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp_verbs::build_phase::gate_plates_for: FunctionTooLong \u2014 impeccable_comp_verbs::build_phase::gate_plates_for runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"766c099e768793d086cd36ac9603f4e48559e437815fa8fa3e536b6d3c5303c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_comp_verbs::build_phase::write_scaffold: FunctionTooLong \u2014 impeccable_comp_verbs::build_phase::write_scaffold runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb77ad04995ff6d1553a79c73d30265e8fe6c02f4c8739636b1ca8b0b1bdbe18"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_core::browser::painted::mask_alpha_at: FunctionTooLong \u2014 impeccable_core::browser::painted::mask_alpha_at runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"84caae6dc546e1733da3f7fc0c4c6bc6893604da3f85d2f17db477a0a82f4c8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeccable_live::manual_edits::apply::validate_manual_apply_result_message: FunctionTooLong \u2014 impeccable_live::manual_edits::apply::validate_manual_apply_result_message runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e6b30ed18fcc1a0feb1217c8e42e4aebfb1a0a2c8e240c74ea264381842f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: browser/selector.rs: FileTooLong \u2014 509 significant 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 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/selector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5408705f2c82cb4bf406a94be2e4004c09fb586a80235fd048ade6266ae38c1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: 40-overlay.createImpeccableOverlay.highlight: FunctionTooLong \u2014 createImpeccableOverlay.highlight runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"92916ebc2e6f60df165f52eb90b5bb42b8b9f6e797c193d547b0ccfb0b1a07f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HtmlSnapshot.capture_regions_at_viewport: MethodTooLong \u2014 capture_regions_at_viewport runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_snapshot.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0456c58f98fa91ca4790433883837586d1db4d29bf9ab9b8655d064832a0c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (56 shared lines): crates/context/src/design_parser.rs:97-157 | crates/live/src/design_md.rs:174-237 \u2014 These two members are variants of one another: 56 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"480c5351414e25cc4c927705da9aac27232c0cc41b973c667001edfdc274c40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/context/src/design_parser.rs:66-76 | crates/live/src/design_md.rs:139-152 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"385a747066e013c835225a04ff632b47caaf51cad3497e07faebbf9f9875cc9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/live/src/copy_edit_agent.rs:876-897 | crates/live/src/manual_edits/evidence.rs:473-495 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dc1e2a10494c16d515c1ffedcf1c65ed98f9c034fbe49a454f78ffa861277a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (114 corresponding lines): crates/core/src/browser/text_collectors.rs:959-1078 | crates/html/src/page.rs:523-636 \u2014 These two members are one piece of code written twice and then edited apart: 114 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6362e028e9f0bd4d4fded8af99bb8b1c900189cc4352774c7a49da1c963dd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (101 corresponding lines): crates/core/src/browser/background.rs:171-303 | crates/html/src/background.rs:270-370 \u2014 These two members are one piece of code written twice and then edited apart: 101 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"79466186a4e3f207efe869a95e4177bf347f4924de3995f314a742bcc9feeb02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/browser/src/html_snapshot.rs:77-130 | crates/cli/src/capture_snapshot.rs:58-112 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a985c7e58f3d57c04da2c647f917590f8ab8b96cba64913827e887b2dc0236"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): crates/detect/src/ignores.rs:114-171 | crates/hook/src/admin.rs:1008-1059 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8fdea68a098de2969abbde5990ab4d142374c763d89bb01e5889439c262afa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/browser/src/html_snapshot.rs:385-440 | crates/cli/src/capture_snapshot.rs:483-539 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df6ebbf17a5ec5d627342229db2c9029b0bac571d5f3d7f14d25d540cb573a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/core/src/checks/rules.rs:1860-1898 | crates/core/src/checks/text_rules.rs:91-148 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"549e2a06f48045f645735bccdc1b4ffe249fdf1e0d809683fb25a36ed41e00bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/core/src/browser/element_checks.rs:2265-2305 | crates/html/src/adapters.rs:805-845 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff75e5f0bfb6bad2de09eafb32cde6b0fe6d98f81514ad45b2507711d1e8b9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/context/src/design_parser.rs:159-190 | crates/live/src/design_md.rs:264-299 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5f7f88c809d604c432d998eb9ad80d29fe47964c5dfb517fc5b034f11cec7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/context/src/design_parser.rs:192-225 | crates/live/src/design_md.rs:319-364 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"07013c7cc89944584b7b2154a8e93ea0fe1de95b992b986e1ede806a132a1842"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/browser/src/html_snapshot.rs:186-220 | crates/cli/src/capture_snapshot.rs:295-329 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c56f3cec8d5551a1089e9f10efa07977e5bc0b070f5d49c9757ad1a7833eeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/core/src/browser/background.rs:576-619 | crates/html/src/background.rs:411-468 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6c796774f20b018761301f23cba5248fecce2c3546e128af596e007dd669bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/hook/src/admin.rs:692-730 | crates/skills/src/hook_manifest.rs:590-623 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b4cd51e6976d4e2eff2740c8a96492e0dfaddad573afae76ac6fb808e12f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/comp/src/jsnum.rs:29-68 | crates/foundation/src/js.rs:321-365 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/jsnum.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4349f256d0ded029fc808adb84613c71a4eaf55c0bee40cfc41e22b1263c5a2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): crates/context/src/context_cli.rs:568-615 | crates/skills/src/providers.rs:604-658 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7820f9bab150931864cacb52d4af9265c9f76f1e395cfeb5011a4b0f0ab9f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/detect/src/config.rs:113-139 | crates/hook/src/hook_lib.rs:479-511 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d27240208a7c452b2619e5688b807e96cb9cc95d71b92cb210010683184e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/skills/src/bundle.rs:731-771 | crates/skills/src/bundle.rs:797-842 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"25600fda2e5b82df4b6b341b7eb47adf20a5fb561b711c8b1ec6bfeef5d136c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/core/src/browser/page_checks.rs:3013-3068 | crates/html/src/page.rs:641-677 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"335e888f25354ddf0297d8988c142a41b4e2c70a9d05b73c58e9a8a93505ab55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/hook/src/admin.rs:831-863 | crates/skills/src/hook_manifest.rs:549-580 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"37640db4a8a83acd9c64b9e1e1220ebbf26d7beb2411588aa780fc524ebb1fa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/account/src/store.rs:223-250 | crates/account/src/store.rs:251-278 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/store.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b5a2a58993f82d0d54f8e1ab4490876471db37bc7b0f50710ef3978a7c9ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/hook/src/hook_claim.rs:211-235 | crates/hook/src/hook_sessions.rs:136-162 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_claim.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"273a3ff38fea74c7d0a3e335a40d81133f0253de4dbaad88424f83caebd55996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/live/src/live_accept.rs:943-969 | crates/live/src/svelte_component.rs:334-360 | crates/live/src/svelte_component.rs:998-1021 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d601cfbd871fcc40e1c090636b7a5de2368fe18c8c08bad9dddbfbf2296b11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/core/src/browser/element_checks.rs:4440-4462 | crates/html/src/adapters.rs:511-534 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fb2966c622d8d46dbb6f908303adbadf82b6ee20d9be0235f620544d488e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/core/src/browser/driver.rs:175-207 | crates/detect/src/design_system.rs:929-966 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec17e7b8649fda3574b44b9649f589abbe849c79e784f63ea5ee1c6756dc935e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/browser/src/html_snapshot.rs:155-177 | crates/cli/src/capture_snapshot.rs:331-353 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdd85fc5da0615f414c55a4c98c0cbe9ac928eb8101f7a5ba1fd5cdc84a0208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/comp-verbs/src/build_phase.rs:1272-1288 | crates/comp-verbs/src/build_phase.rs:2711-2724 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd8b51f27bb5daa328bc069e20fa725a38282e09fcc56488e520de41e0b9ff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/context/src/generate_image.rs:30-55 | crates/detect/src/config.rs:558-600 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ffd0300602392866d20fb95904bdb4a31f8ce1d63308312ffce5c4a02cf7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/foundation/src/css/measures.rs:988-1016 | crates/html/src/cascade/shorthand.rs:17-45 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/measures.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"056a95d94cf5f87056dbbc23cc63e603442ebf493a0d166941de0824aa85d2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/hook/src/admin.rs:782-811 | crates/skills/src/hook_manifest.rs:515-537 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bc7e65160d0342ee88f36b08f0e343afb02dcb7475c95ab673536aaebe7467"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/core/src/browser/page_checks.rs:814-839 | crates/core/src/browser/page_checks.rs:844-864 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac18b791dc787113847fc4bc27ab6cbaadd07a05df7b6dc7e19d115a4c214e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/core/src/browser/quality.rs:1643-1674 | crates/html/src/quality.rs:122-154 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8a30ee87f83c22af45b5607b96c5e18c26616ba5e0e99721e3e7d33913e035"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/detect/src/ignores.rs:253-280 | crates/hook/src/admin.rs:870-895 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a843205998d883ca084ba1968655323764eb0e5e2a5899bf982e0103c7713dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/context/src/serve_question.rs:241-256 | crates/context/src/serve_question.rs:262-276 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a4bfe5fb571d93154b7e8024cd4bdbf32f0a795500c442d9e1556c22a502e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/core/src/browser/element_checks.rs:4563-4589 | crates/html/src/adapters.rs:538-565 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4563}}}],"partialFingerprints":{"codehealthFindingId/v1":"290865b48ce5be01821e8042292b22f91016b4f2948bccede155c0068e6417ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/live/src/accept_css.rs:83-109 | crates/live/src/accept_css.rs:112-142 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45f1b74f2df5ff293cb620e53f59032c994cf1efdc19025503614bdaa9f1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/live/src/live_poll.rs:76-94 | crates/wasm/src/exports_pure.rs:246-265 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7d060715ccc20dd4f0bc1914cfe34b3ff8595fddc53e2a360fdae4ad216168"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/detect/src/regex_matchers.rs:153-182 | crates/detect/src/regex_matchers.rs:604-632 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcc2d1c720d1571424f065c46631fa455d898501fd2f2d2d21fea6537d4304e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/agents/src/resources.rs:485-514 | crates/agents/src/resources.rs:550-575 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c40e4a1c71da3d3e2929e88aa4f35eddfe00de863b44e8aea206d1bd8c0c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/context/src/design_parser.rs:30-46 | crates/live/src/design_md.rs:98-116 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feb94a5ff95857f0eab18eeb224a407881f1909295a9fe3814f2f66a0ac6d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/live/src/inject/sveltekit.rs:111-138 | crates/live/src/inject/tanstack.rs:104-127 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/sveltekit.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"87df51df3371303b2b290bff531fd0014782989bbf2fd23bbd37ac2d1c84d8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/context/src/serve_question.rs:1992-2022 | crates/context/src/url.rs:159-176 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1992}}}],"partialFingerprints":{"codehealthFindingId/v1":"87dc32f3ba73d4f0b800337501748de7edde6d78b64c17f26c2f30feeb7570b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/browser/src/cdp.rs:365-398 | crates/browser/src/cdp.rs:408-449 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3e4bcd2420a333f70df1ff83a4fb8c138ac673f8e892e73c7eb7e450245f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/hook/src/admin.rs:898-923 | crates/hook/src/admin.rs:953-984 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca960a739b83cb112e48498028f372e60927ad114421376d50fbdc38b3a1e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/live/src/source_search.rs:43-61 | crates/live/src/util.rs:26-46 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/source_search.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"525bfe9314fea58fde33e5748af297ea50e530b186097b3a2abcbd578852ecd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/core/src/browser/driver.rs:325-349 | crates/detect/src/design_system.rs:1598-1621 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8167e6613341d97e68af08ac30ea29de0ff261a245cd7915118fad38480e4d6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/html/src/cascade/csstree/strings.rs:87-116 | crates/html/src/cascade/csstree/strings.rs:142-177 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/strings.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dd433b4b7ca913ad19d2dbfd8461a3ea3ed9fd2cbe17a4808780af0623798a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/context/src/staleness.rs:22-31 | crates/context/src/staleness_deep.rs:424-434 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baee4d817c12d539d69b52e2625c757136aab249df88d63149cec156ad07f74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/html/src/cascade/shorthand.rs:143-163 | crates/html/src/cascade/shorthand.rs:175-194 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/shorthand.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8784890bf837c5a43c4d37a319b418e83b55e090cd6673bf5f5f17e3fba8e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/common/src/http.rs:49-80 | crates/core/src/browser/driver.rs:501-520 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/http.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8ed581d3f2baa2000154e7df7b082bb74267111d5214d707c9d6e7625cb3c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/core/src/browser/background.rs:464-490 | crates/html/src/background.rs:489-512 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e180beea3e4ed4e55a5bc7fd05094b1e74f10c1db4910cd2c263cd186e47a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/core/src/browser/element_checks.rs:5080-5095 | crates/html/src/adapters.rs:1815-1831 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5080}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e98c0576507a0254170648807705694983a84bb6b5e98487582576e5d6c4344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/core/src/third_party.rs:200-212 | crates/core/src/third_party.rs:232-251 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/third_party.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a9019d9b5faac68847dbffc0ba062198580262d511fee965ff6c03c0dfd475"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/live/src/event_validation.rs:47-64 | crates/live/src/instructions.rs:41-58 | crates/live/src/live_resume.rs:87-104 | crates/live/src/manual_edits/evidence.rs:84-104 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/event_validation.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4e72acf9ca49cc53ca218153672274b8eb7b7fe12b7ac7a424b9c4673c53d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/core/src/browser/driver.rs:17-35 | crates/html/src/adapters.rs:78-95 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5adfcbf4e1508e8e6c1428dc4e42ae4676cff4ab38f566f26c0cc46f87472fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/core/src/browser/decorative_text.rs:30-47 | crates/html/src/decorative_text.rs:65-85 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/decorative_text.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e3372b69869a562b6dc3dd798e762ff536aba4ad549a228bff0179c2bb5de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/core/src/browser/quality.rs:447-460 | crates/html/src/quality.rs:448-464 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ce4abfa9afa38b67bc642147c6a0b165a73acbd7d327925f6a297ea50966a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/core/src/browser/element_checks.rs:4954-4977 | crates/html/src/adapters.rs:1742-1768 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4954}}}],"partialFingerprints":{"codehealthFindingId/v1":"01870fd297b7ebe822fd5c61d50a94b9212491130b5843766aa25317257f4b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/core/src/browser/text_geometry.rs:267-287 | crates/core/src/browser/text_geometry.rs:318-343 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_geometry.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c718835efad10f6f8a6882f592f45c00635ab5f90ef0bd070634913ee43aad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/detect/src/ignores.rs:282-301 | crates/detect/src/ignores.rs:303-319 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e305151df45a305c2c25689300bf047bae907cfd9d217e91a7fb17e4458da1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/live/src/manual_edits/mod.rs:53-70 | crates/live/src/source_search.rs:170-191 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cb06a3b870c94ea5b4e8899830fab28504222557ee46b4a3190eabe5f5937e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/foundation/src/fdlibm_trig.rs:509-525 | crates/foundation/src/fdlibm_trig.rs:528-544 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6fc45bf9798373819b2471c9d0c0664835c79bba7cb419253b3dfb143e286a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/core/src/browser/driver.rs:284-310 | crates/detect/src/design_system.rs:1556-1581 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d046169d8514698e8742c28f2fd7868db143811a515de318c7f17d385eb9e61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/detect/src/detect_text.rs:1211-1230 | crates/detect/src/detect_text.rs:1233-1252 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"627f8f14166ef119cde5aeb66cecbe2ea9293e4113e03463a2dab1121cc78854"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/account/src/pro/mod.rs:407-426 | crates/account/src/setup.rs:38-58 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/pro/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31946a9bcc773c3a12f13381e9fd3e6a2cc6f18bee5778c951a78914821d18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/cli/src/font_render.rs:55-70 | crates/comp-verbs/src/build_phase.rs:1139-1155 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/font_render.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b65ef7229a0162f15d73ff6f878cab7e026d1dadeb2b14296745e0322b0fc88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/context/src/design_parser.rs:48-64 | crates/context/src/design_parser.rs:78-95 | crates/live/src/design_md.rs:120-136 | crates/live/src/design_md.rs:155-171 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"374293035f53e394e6121662950f29f09596c0f5d829dab313faa4b019a5390c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/core/src/checks/gradient_geometry.rs:135-161 | crates/foundation/src/browser/fake_dom.rs:352-377 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/gradient_geometry.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7bfc373c617b75c9fbcc0b43fb94e8b1e9c47d83426f42106593937ae9f3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/core/src/browser/element_checks.rs:336-356 | crates/core/src/browser/page_checks.rs:3988-4009 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e675d727fb8c3e678c5d832c85227f89407b9c516e6370b29afe28e9ee945764"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/core/src/browser/quality.rs:92-110 | crates/html/src/quality.rs:348-366 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d908790d397ae0f2eb4d62de96127f8f452ffd9ca637cb0d8f080007b646940f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/core/src/browser/element_checks.rs:1370-1386 | crates/html/src/adapters.rs:731-748 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"756461621a63666c2352cce2751fcdcf29c77c57373336c7d40475e3777ee208"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/detect/src/util.rs:63-72 | crates/live/src/accept_css.rs:459-471 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/util.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfd93045b8936b4eb67f33ef74a2a8d1ab783f673386482d3153daf66763e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/core/src/browser/element_checks.rs:2609-2622 | crates/core/src/checks/rules.rs:1271-1284 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2609}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af983a1e1e232ed26193fb91b35378e8ac15f4845a690fad736aec216c33cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/hook/src/hook_lib.rs:837-850 | crates/hook/src/hook_lib.rs:864-874 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ff05abd4119fdede6669f5aae4ef7f0582632478ed18a879c20c96a6fb495e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/core/src/browser/page_checks.rs:945-963 | crates/html/src/page.rs:245-260 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a45f6665b8f597a75ec0fb8dd4bab1fdf6c0de8618a0aa6cb2eff9695c969c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/detect/src/config.rs:1048-1064 | crates/hook/src/hook_lib.rs:1227-1243 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7b342a75e0d68f975c8e665691757fe16bcd0f9c009ea234f0c6f999768183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/context/src/context.rs:415-437 | crates/detect/src/design_system.rs:1158-1180 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4e5f3bb0fab57460e5276165d1acc2b9a1a7e63e5f50d4a58b0203ea044344"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): crates/core/src/browser/painted.rs:1913-1933 | crates/core/src/browser/painted.rs:2272-2288 | crates/core/src/browser/painted.rs:2297-2313 | crates/core/src/browser/painted.rs:2535-2550 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e0b25df299ccb1a4fd9e85d37048468759d107953c2875fae936380236ba3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/live/src/manual_edits/apply.rs:115-134 | crates/live/src/manual_edits/commit.rs:439-460 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ae85b42ec3dcfa6bd22f9f188246a544c0ce122f0054cfa44222b81369843a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/detect/src/design_system.rs:416-432 | crates/detect/src/design_system.rs:448-464 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3192d9096bd39294b7646e39425952ab31e317d3fdbbfa584bab6f810e80b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/core/src/browser/painted.rs:1944-1953 | crates/core/src/browser/painted.rs:2859-2870 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d01ff139ac2691175a850bff2c763f622ec87b58e4599841e07ae3617c5020a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/account/src/config.rs:73-86 | crates/hook/src/hook_claim.rs:97-104 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/config.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c4af4ce9af44fe7cfa1e3d9df4e8241efeb37c93475281006256e7f49dd46e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/context/src/context.rs:892-906 | crates/context/src/context.rs:908-923 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"8115ab766f826c614991a1e05ca7aa9bbabcea8d4db16547ee7ec89bc3e81376"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/core/src/browser/text_collectors.rs:150-165 | crates/html/src/adapters.rs:165-180 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a2e9f2e83676c55b21a254c5750455c2fa4683f72da48e0ef3f4da007a1d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/context/src/util.rs:196-213 | crates/detect/src/ignores.rs:342-363 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c336f116cbf5ef7615f9e724844aaaf73f916f9de76acc0425efcb40a6b9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/context/src/critique_storage.rs:436-442 | crates/context/src/critique_storage.rs:449-455 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ed79fad5a1a589c456cb5e722615d5f34c5dc032e6871e1582d3b64d5c128a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/detect/src/ignores.rs:460-470 | crates/detect/src/ignores.rs:472-484 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e3d64460051d8dfd3c3b6dbd6bd0dc0b65dfd917ea2e3f93f19fb6746c5c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/detect/src/profiler.rs:51-67 | crates/html/src/static_engine.rs:108-124 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/profiler.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ae4aa226ed481b9c3495c616cfabd9a83706533f3b3ad963707e657acf5a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/context/src/pin.rs:160-177 | crates/context/src/pin.rs:180-193 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/pin.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b9cd12aa0c9731504a7b0a971feec532f2b6ef130dced571b020ac5c91d92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/core/src/browser/visual.rs:412-430 | crates/html/src/adapters.rs:764-782 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b25f1570df459095a4566bd7a0d76fdfaeac0a1127c201638858d75b527da4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/live/src/pending_edits.rs:19-31 | crates/live/src/svelte_component.rs:1239-1255 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/pending_edits.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"840566a7024a4f4ba90390144dfd406936e40fc15e63ec56e7863ba427da54da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/context/src/palette.rs:15-22 | crates/context/src/serve_question.rs:2053-2061 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/palette.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"659663d7a611e52ebe07f6f7d554c66a7f11ecfa6fbeebb4b9b85f20de9473de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/live/src/inject/astro.rs:14-28 | crates/live/src/inject/html.rs:13-24 | crates/live/src/inject/next.rs:32-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/astro.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc83e0027d375819d98a0e0f732e4031d08b4d568a11ff0cca31d06dc66d3fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/context/src/hermes.rs:16-25 | crates/skills/src/providers.rs:113-128 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/hermes.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"74717fd97c65324f8e98f15a8ac8f41e6ef255ec28f60e5bcf38b1e9af2835f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/context/src/surface_briefs.rs:82-90 | crates/context/src/surface_briefs.rs:92-100 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca984f20329eb4cb35ba17edb12631e50d79788775ba856d15d3cfc5aed2b93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/live/src/accept_css.rs:41-57 | crates/live/src/accept_css.rs:59-74 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8956bb0d87138e11c6f35f5e5a707b9c431a758514a91de29a3781b0e89273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/context/src/pin.rs:121-129 | crates/skills/src/providers.rs:85-93 | crates/skills/src/providers.rs:97-107 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/pin.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7d05a766e95d37f6ea143a3d3acbd963cde1589334a913a86654b69ddcd62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/core/src/browser/element_checks.rs:1837-1850 | crates/core/src/browser/quality.rs:1969-1983 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1837}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb1ab242bfbb73820e444b89c21cffcb956fe41dd7a85f207fc5f6a2e0dcf9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/context/src/context.rs:317-333 | crates/context/src/context.rs:439-458 | crates/live/src/roots.rs:104-120 | crates/live/src/roots.rs:128-148 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"158234a49e7b0d7859cf56eb0a9bd66d196540a2216a476ebc8d2573f4919e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/core/src/browser/background.rs:623-635 | crates/html/src/background.rs:516-526 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12bb94a4c807336746440fa0eb80103d2f72425e84ece8a360493600f3bef08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/context/src/concept_seed.rs:302-322 | crates/context/src/concept_seed.rs:343-360 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cf4952a1e22e0f47e25159810099279a3593ce312bcc35438384f52937c91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/context/src/context_cli.rs:201-213 | crates/context/src/context_cli.rs:706-716 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c86a8c209b845bb578f4bcc0faeefab415cdc3ccaa8c56bd9cc665f844c034"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/core/src/checks/rules.rs:476-485 | crates/core/src/checks/rules.rs:493-507 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a39c27d4432cc8ac3947c767f582106c64783ea7ee8c4119b0f5260a286026b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/hook/src/admin.rs:748-762 | crates/skills/src/hook_manifest.rs:337-347 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda0df425c210157a9e3abb12601aaaf9f6179528146188720956c264fbcf7c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/context/src/concept_seed.rs:132-142 | crates/live/src/live_poll.rs:332-345 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6335b3843ca0a8397a632074eccd92a71af265ee2587969ed432ad69f5c8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/context/src/design_parser.rs:227-237 | crates/detect/src/design_system.rs:400-414 | crates/live/src/design_md.rs:304-316 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac261e95f8379223174cd38641da26cec5dc5a71638bb1d0c01b70a79602603"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/core/src/browser/element_checks.rs:1789-1807 | crates/core/src/browser/element_checks.rs:1818-1833 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7e35eb8800c450efaa9b521062cffea71f2f1bb74cc5d9fb0f68d7b407aa64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/core/src/checks/vectors_a.rs:52-68 | crates/core/src/checks/vectors_b.rs:36-49 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_a.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"23beea0dcf2797afd4c6c123996f0f7791184658d188303b902f82ba387f21d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/live/src/server_state.rs:345-356 | crates/live/src/server_state.rs:363-374 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server_state.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fbc67548eb0256671ac35fc5eecf6f5216e8fb194adf5d254b55971954b1bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/core/src/browser/quality.rs:1867-1883 | crates/html/src/quality.rs:190-208 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"3457fdd2fabd23578ab83ab52395269aca1fde3777e6257d2fb356f781b8448b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/hook/src/before_edit.rs:224-240 | crates/hook/src/before_edit.rs:399-415 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"98225c4991f159a933749bf8d7decc22f86ee286de7e56e592157ed0e33012af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/core/src/browser/element_checks.rs:359-376 | crates/core/src/browser/painted.rs:2685-2704 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea750aa9463bed3d0201e0c62a4a98ad3e09606284addb538e07fa8162ff1a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/foundation/src/vectors/checks_a.rs:49-57 | crates/html/src/cascade/vectors.rs:71-79 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/checks_a.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dfa5112042eddfbd6376fa58ca080af1965db41409830298357298cda54623"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/context/src/util.rs:137-145 | crates/skills/src/util.rs:109-117 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b1c8db916f16d468b6d0036a7f0759b4a459f0f612fc2e1f54366556944fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/skills/src/providers.rs:277-290 | crates/skills/src/providers.rs:293-305 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/providers.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f637ae3d6ef6e1378974912cdd103051fb54aeda053ec86a0d59f1ecf2a9a79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/wasm/src/exports_visual.rs:78-83 | crates/wasm/src/exports_visual.rs:177-182 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_visual.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66b2c9e55a932110e6f05bd9c0081198fc270f153da797960af51fa14317cfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/wasm/src/js_dom.rs:275-291 | crates/wasm/src/js_dom.rs:292-303 | crates/wasm/src/js_dom.rs:346-357 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/js_dom.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"56acb1cf89366e3a098fa777983708def2e1474e73d9eb7e0d9efd65112e1412"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/account/src/session.rs:233-242 | crates/account/src/session.rs:249-260 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/session.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d773aea7f893a4a77c17f173eb70928aa6201119e5e364aaeeaa68cc2a5893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 9\u002B corresponding lines): crates/browser/src/lib.rs:2392-2400 | crates/browser/src/screenshot_contrast.rs:691-699 | crates/context/src/staleness.rs:219-227 | crates/core/src/browser/driver.rs:154-162 | crates/hook/src/util.rs:62-70 | crates/live/src/event_validation.rs:16-24 | crates/live/src/inject/detect_utils.rs:31-39 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7ca2553db950c8c88c1eac1f58b77c2efe6e2107194b46e7f9921fdcc1ae5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/context/src/serve_question.rs:1975-1989 | crates/foundation/src/fonts.rs:65-80 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd2534a8e9abd9a41d1381ebfe5f56506172ccbf3ebceb0fe89d7c45275a144"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/core/src/browser/element_checks.rs:79-103 | crates/html/src/adapters.rs:106-126 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e800c86a07f03f3f561cdedf26b3f9f656551b73629a701eae992a1847fcd4a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/core/src/browser/page_checks.rs:1218-1227 | crates/html/src/page.rs:404-413 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8dd0a0613d6c53fe26488a955165a683a44421228725cff8602953c31cfbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/browser/visual.rs:3962-3969 | crates/core/src/browser/visual.rs:4009-4022 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":3962}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b32e0865137dca4642f74bb69ab0a4a108e43e969b2ec2665bd7e6d8f30ab61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/browser/quality.rs:466-473 | crates/html/src/quality.rs:470-477 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"013fdd6c63b733cabac378a41fb68f7978c96005333c73ca45760b93821c2117"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/comp-verbs/src/approved_comp.rs:200-205 | crates/comp-verbs/src/approved_comp.rs:232-240 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/approved_comp.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"651a68416167fe1fbc4a3f0deae896ba1795e081091de504caccb538452d5dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/hook/src/util.rs:99-113 | crates/skills/src/util.rs:268-282 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/util.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"85370c840b729a7c30b838496a9f46513c24555df902bb9d10e9638d76b521cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/context/src/context.rs:701-709 | crates/context/src/staleness.rs:75-83 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"c339f3129cafa508121044389b0fa08fa352e839a5c527069b5e570094d0955f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/context/src/generate_image.rs:11-19 | crates/context/src/serve_question.rs:28-36 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"776ca2b109234bcec8f3b0f64119f134ef53718cfeedcc5d5a2f51069d0662ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/detect/src/regex_matchers.rs:2766-2775 | crates/live/src/design_md.rs:59-71 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e99699d90ca6eb8d94ffaabee969f3043baeeb308c60b64f67b3f9ee2827d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/foundation/src/vectors/checks_b.rs:31-46 | crates/foundation/src/vectors/mod.rs:40-55 | crates/html/src/cascade/vectors.rs:54-69 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/checks_b.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bce33da5583f1b49a7932376157c518906dc13c01e785868c562e701411706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/browser/src/snapshot_engine.rs:91-142 | crates/browser/src/snapshot_engine.rs:231-241 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/snapshot_engine.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"874418de1ef0980db3112b9cd5e69960c04bf33c33cdc953ceffa49294f9d22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/core/src/browser/painted.rs:2139-2149 | crates/core/src/browser/painted.rs:2981-2991 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"93431758e25f6bde09696921ca316c0223a3cd497874c5196048f7fff2aca4ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/foundation/src/browser/snapshot.rs:816-825 | crates/foundation/src/browser/snapshot.rs:826-834 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/snapshot.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"5312b6bffeb90707a55ab44775c4e0882254f037745d16a875ff8456352da5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/browser/src/lib.rs:469-486 | crates/detect/src/profiler.rs:113-122 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cafd438701c8793c480b539e17457ef267b631fc041ba7799ea0a11c7e5ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/live/src/server.rs:32-39 | crates/live/src/server.rs:43-53 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/server.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19b75f723757b5e05b44d2d760c06faa7342c167a4a918104783f0dad8d975c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/foundation/src/browser/selector.rs:423-429 | crates/html/src/select.rs:267-273 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/selector.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bf58dc4333b3f1e8a07bf56fd2d1f206920a56c93984cda940624fc8dcf7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/hook/src/hook_lib.rs:613-618 | crates/hook/src/hook_lib.rs:852-857 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c781550074de113f7db01261f6164123e67cbeca4e9bc5bb6196aee9b40ac4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/context/src/util.rs:177-182 | crates/detect/src/design_system.rs:1129-1134 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3fd36ad16474b3624c5ca915946f7ed54ac33a61ca81ac16fe19ca34c1365a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/core/src/browser/driver.rs:369-378 | crates/html/src/static_engine.rs:166-175 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d60b68e18f263f52a52236ce40c9cd6b4b10cbf49233297c2edc8441e23d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/foundation/src/js.rs:544-560 | crates/foundation/src/js.rs:563-579 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c41c220181acbc74d8804de84158bb1ca7730d59f578bd9b70f8c6102988a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/live/src/config.rs:21-31 | crates/live/src/config.rs:32-42 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/config.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9de20765fec909de379db6a9f2f43bc72e29c5adf078ccaf6d9a57db1e82a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/foundation/src/js_ext_a.rs:37-49 | crates/foundation/src/js_ext_a.rs:54-66 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js_ext_a.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81a598d871b826b5ad41f2be7725c5cd080521e653c10fb12223fe72c004c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/skills/src/hook_manifest.rs:258-268 | crates/skills/src/hook_manifest.rs:272-282 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0941f2833f70a00ecfd25010010485fc1c659ee48a3546b8a8c97d2792080903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/browser/src/consent.rs:1023-1030 | crates/browser/src/overlays.rs:678-687 | crates/browser/src/validity.rs:294-301 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/consent.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d35ec02cf8f3cbfbb91371bb809722b573322d81708272bf6ea53add7a7926"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/checks/css_scan.rs:1708-1715 | crates/core/src/checks/css_scan.rs:1886-1893 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cad951994ee4cea390c1536a29fe06e9139d46009b5da0323ae62630030e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/html/src/cascade/csstree/tokenizer.rs:793-806 | crates/html/src/cascade/csstree/tokenizer.rs:808-817 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/tokenizer.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9ff2fdb4f16cff82f48b3d2e9e68f13fdab1a2449b09e8487ee861b9871c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/browser/src/cdp.rs:1788-1803 | crates/browser/src/cdp.rs:1806-1821 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"796605c827d634ad8ccf6ca5509441244ef911e0d04725aef676e374d660021a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/context/src/artifact_schema.rs:55-66 | crates/context/src/catalog.rs:233-244 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/artifact_schema.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dccd6618c4f258d5eb596d855063ca822dcb690140895e2eeca563e708a2ea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/core/src/checks/css_scan.rs:1175-1194 | crates/core/src/checks/css_scan.rs:1198-1206 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec958a6e81bf2ab7c2dc903a6b527f7a90ed01a92ee60c38a50605fc385705c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/context/src/hook_markers.rs:195-202 | crates/hook/src/admin.rs:765-772 | crates/skills/src/hook_manifest.rs:314-321 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/hook_markers.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f73ae40a6c83b533042f3a5462b5cf127a73c6b2687233ff0fa22c141d5fa58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/detect/src/regex_matchers.rs:866-877 | crates/detect/src/regex_matchers.rs:936-947 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff0f51c713f963d236408c0eba5f932ab0efe1d1fdaec31b6deb28999d06f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/html/src/cascade/csstree/tokenizer.rs:251-265 | crates/html/src/cascade/csstree/tokenizer.rs:297-310 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/tokenizer.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf57e8863d65a5a3a7de844cc62e44422c03babd0abf2fdf85370cb468227c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/context/src/concept_seed.rs:292-299 | crates/context/src/catalog.rs:477-484 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1f8566dd26662fb98cee052ebf9e3d22f821e670af217e75c2cbb57d18ed27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/detect/src/profiler.rs:79-87 | crates/live/src/live_poll.rs:320-330 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/profiler.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1b8551cccadacee2aa2fb4c5b539b985fabfc0dd7b283e38d6525722ff3fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/context/src/serve_question.rs:120-124 | crates/context/src/serve_question.rs:863-867 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4286b8dfd2b3d4f35b1f65ba2073ea2aca69909c59c1c063dafe8e1122e996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/core/src/browser/driver.rs:313-322 | crates/detect/src/design_system.rs:2070-2079 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d604805a7b7abccf1dd5edcb751e98e4fcfd93794dd8c1cd7fa24a441108cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/core/src/browser/driver.rs:2685-2691 | crates/detect/src/config.rs:369-375 | crates/detect/src/design_system.rs:569-577 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dfd5b0a42c7f3d17fc60afebd0311cd63c503de703d8f678115a14d47804a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/hook/src/admin.rs:101-111 | crates/hook/src/admin.rs:114-124 | crates/html/src/cascade/vectors.rs:196-206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0dd08b178612cb0de530e598715107a649441eaee5ba2eee1810471a6f22f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/hook/src/hook_lib.rs:948-959 | crates/detect/src/cli.rs:182-193 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fde9a77aecdd4caadce11dd92d32390b820087b14a2ea73be5bab7d3a27124e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/context/src/provider.rs:44-56 | crates/hook/src/stop_discovery.rs:75-90 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/provider.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f29e4992de9fbc3c9c25d4497c55860947056b2139a64da6415dc119175e789"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/foundation/src/css/measures.rs:465-478 | crates/live/src/design_md.rs:1072-1088 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/measures.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88a6c8ad17baa607135a4c6573d787cd7f9101fcad6737ac72ffa3df3af64e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/foundation/src/js_ext_a.rs:20-32 | crates/live/src/manual_edits/evidence.rs:129-141 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/js_ext_a.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f8a3b4e37ce9d62315fb5b0305225e09eb0eba23a05ab8c8f93e2f34f33e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/foundation/src/browser/fake_dom.rs:193-201 | crates/foundation/src/js_ext_a.rs:183-189 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/fake_dom.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e8fca2a429765183a0217692af1b5a0966a100edfebab409cd4aed9cdc25bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/context/src/context_cli.rs:641-646 | crates/context/src/staleness_notice.rs:10-15 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"691695fd440feeca465cc3896ecdec73a0b22703a89a874cece98c9067c8f090"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/foundation/src/browser/fake_dom.rs:470-479 | crates/foundation/src/browser/fake_dom.rs:480-485 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/fake_dom.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e923beb85ce4f2a8a4d0f086f37934f98d56ece3532cfbcc8a995397f1d6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/foundation/src/rules/text.rs:278-294 | crates/core/src/checks/text_rules.rs:338-353 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/rules/text.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbc4d9bfd8065bb4b4950ed96d0474e8ea7ef36bac6389efc1fb1d60e894ced"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/foundation/src/browser/dom.rs:523-535 | crates/core/src/checks/css_scan.rs:676-684 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/dom.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dde745b95ccdfa3961dc45f7f71a87ddcaa67c36f0c6acf34b7fe142bc044b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/foundation/src/color.rs:830-844 | crates/core/src/browser/element_checks.rs:1890-1899 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bc944864d0e2811ad7fae75e6d54e98a91b5d5ce19b7750bc3f833b629e714"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/common/src/jsp.rs:175-181 | crates/core/src/checks/css_scan.rs:1952-1962 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5985755049532bcb6fc0c4aacf824a09f4f0bf5888cc2b9b918d89975ac51ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/hook/src/hook_lib.rs:551-560 | crates/detect/src/config.rs:693-702 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"205b740fbe13f99d7d520048809d37c9e216a0fcc91da1c63148188f663ab0fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/account/src/oauth.rs:355-357 | crates/cli/src/capture_service.rs:94-96 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/oauth.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4487433d2b56ed399fa2a65ef086e83f47be5a6a8905a660e0e6268999f9857c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/detect/src/cli.rs:1277-1289 | crates/skills/src/prompt.rs:602-611 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab926363f57d559cfbf1c751aab1a78fff3b80dfc2d2137b956fecfe724745e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/core/src/browser/driver.rs:278-281 | crates/detect/src/design_system.rs:648-651 | crates/foundation/src/css/measures.rs:885-892 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6501a3fb24927e196c8d6fe73fdc7488b26d0de3c37d5996e5cff65b515037"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/context/src/artifact_schema.rs:47-52 | crates/skills/src/providers.rs:680-684 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/artifact_schema.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3833386b028fd2fa3692e4c6c7adee80b080112116a6fad8b3792c0304b40a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/context/src/concept_seed.rs:404-407 | crates/context/src/palette.rs:8-12 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c10857e500576ffa04fdc351fffdf4fc76731336bff4dcf2fe895721e79af53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/context/src/detect_csp.rs:198-203 | crates/context/src/signals.rs:345-351 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/detect_csp.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb7d64ab57bd023881e67588a7065dea00bbcab6a341e09098e552958a9f0b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/core/src/browser/decorative_text.rs:312-317 | crates/core/src/checks/decorative_text.rs:251-256 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/decorative_text.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee17bc5fb986880641cf5c1bfe8f850a2d4ce5a3ea958c38217e78f4c618df8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/core/src/browser/text_geometry.rs:405-410 | crates/core/src/browser/text_layers.rs:217-223 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_geometry.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6035739568b8d7a3597536bb19c5b3edabc0b388110d2dbaa6900fe6020107"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/cli/src/reviewed_entry.rs:27-29 | crates/context/src/component_review/store.rs:9-11 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/reviewed_entry.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"63875c86fd14c9c9d7375eb35e909d90b56e7cf6d9d2c731d3d4961f981d7d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/context/src/context.rs:340-343 | crates/live/src/util.rs:274-277 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ade559205161c6d6c2b43316eca4b67c6843a0333b8fd642e455796660d7b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/browser/visual.rs:671-678 | crates/html/src/adapters.rs:1598-1605 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca99b7c579286e483433d07facb3bb7a978cc50eafe7ba2a2d5448b46a125647"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/core/src/checks/text_context.rs:1514-1516 | crates/core/src/checks/text_rules.rs:451-454 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aa82e7cf4cf9f9cbfedd07a9e963888c3b3cfaa7317d4961fcb7254d118e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/foundation/src/browser/selector.rs:722-727 | crates/html/src/select.rs:468-473 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/browser/selector.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2eeb22012d1feb27dda3d0a18bf9d528665a5d2a4b2af160aefa72d308de402"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/account/src/pro/verify.rs:57-61 | crates/common/src/seed.rs:22-24 | crates/context/src/telemetry.rs:151-153 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/pro/verify.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5796ea2112621e39326f46dcc3841485968f8acae00220034d0dd7cbbe9a3f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/cli/src/component_capture.rs:15-17 | crates/comp-verbs/src/util.rs:118-124 | crates/context/src/util.rs:184-189 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_capture.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"796f2e92cecef476813eafa9bad0d8f01e23dbc5b311945944b0f12f2d125073"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/context/src/hook_wiring.rs:7-13 | crates/core/src/browser/visual.rs:4219-4225 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/hook_wiring.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7aca50f85fe476daebf2157c399b035de97a084ae6023499b68324d14a8ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 6\u002B corresponding lines): crates/browser/src/validity.rs:287-292 | crates/common/src/http.rs:35-40 | crates/foundation/src/browser/fake_dom.rs:524-530 | crates/foundation/src/browser/snapshot.rs:605-611 | crates/foundation/src/vectors/checks_b.rs:83-88 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/validity.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d805b7be487aa2b395ca433126d7c6438159c72e21a39a57b7a3e0ee8286ecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/comp-verbs/src/comp_diff.rs:400-407 | crates/live/src/journal.rs:202-209 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd7944fbd043ef1dfe86067f6dbe5754be342e077a079bce928220bc65f60e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/live/src/manual_edits/commit.rs:61-67 | crates/live/src/manual_edits/evidence.rs:190-196 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e552ea105b52e406c66b3fedaad5656230e6c45b1c5b8a7024f8316b188f9497"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): crates/comp-verbs/src/approved_comp.rs:47-50 | crates/comp-verbs/src/build_phase.rs:51-58 | crates/comp-verbs/src/comp_diff.rs:696-703 | crates/comp-verbs/src/font_match.rs:371-378 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/approved_comp.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66bb401efba6cdae2f10419ee82bdc843b034db4b1b2efc4093c86cf522fdb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): crates/bundle/src/lib.rs:64-66 | crates/foundation/src/registry.rs:804-810 | crates/html/src/cascade/defaults.rs:147-152 | crates/skills/src/commands.rs:39-41 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/bundle/src/lib.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc519f3e40012781501987e1f06cdd9fcfb794e4d4329acb7be185b574d3cc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/common/src/lib.rs:93-98 | crates/hook/src/hook_lib.rs:86-91 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/lib.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b001e12e89372e24dcc5d13c0f7d77357d21bfc622808bfd1e0c1a6cd58eb0c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/context/src/generate_image.rs:21-28 | crates/foundation/src/browser/selector.rs:64-73 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"29763087c3f38678e52e384fe936d2959b6f5e9619f521846c532b1c681bf595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/context/src/staleness.rs:85-87 | crates/context/src/staleness_deep.rs:117-119 | crates/skills/src/commands.rs:85-87 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f500843b43a32ebb1a4771bd5b6fc77c764e1484f5db37ac0c3deeb08cf0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/context/src/telemetry.rs:128-130 | crates/hook/src/build_completion.rs:7-10 | crates/hook/src/hook_claim.rs:199-201 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/telemetry.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f87581f720ab2cbf1c221c93a57ad9f47ab1df081f63c71c15c5df5e28e16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/core/src/browser/decorative_text.rs:21-26 | crates/html/src/decorative_text.rs:23-28 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/decorative_text.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0947c9d6f5f8d3776fd7861a3835906bddbd4bd99f0e7c878876278bf4ce56fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/detect/src/github_annotations.rs:123-130 | crates/detect/src/list_rules.rs:28-35 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/github_annotations.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b16096836d304cadba727120c4d61c450c227c5daac3fa527ac50a101aaaaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/foundation/src/color.rs:693-698 | crates/foundation/src/inline_ignores.rs:125-127 | crates/live/src/design_md.rs:648-650 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"116faea596488b5d4370aa2ec880c476e3949bac53ae861a0af27c3558629f97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/context/src/detect_csp.rs:47-49 | crates/context/src/staleness.rs:71-73 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/detect_csp.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9479825f92ced2957f4515f2d19f2dd07655942ff2cc01bbbcc3b2dff992427b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/foundation/src/vectors/mod.rs:244-246 | crates/html/src/cascade/vectors.rs:111-113 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"db513954dfa49c4df389afacab438f024a77e32e1b9cbffa2a66a54e2f09f25e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/live/src/instructions.rs:61-64 | crates/skills/src/util.rs:295-298 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/instructions.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e715ec988366534938ac41a695af5ab2876ab7118dc1f459aacd10f589aed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/browser/background.rs:153-161 | crates/html/src/background.rs:239-246 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"443beec9521b395d48e7f3866e9b81a9c1c891b969cd8734d343b48d2ecc82c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/context/src/design_parser.rs:25-27 | crates/live/src/design_md.rs:39-43 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c5b1966e0441ec472c3a80e23f6b8e679cfbfd450ee5d03adf6bce041bb34f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/detect/src/ignores.rs:219-226 | crates/hook/src/admin.rs:487-494 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcefa701c699f00525370300912e4b9c489d6b6fdd0cf6a45f05cfb7eca9036"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201343 lines \u00D7 2): crates/core/src/browser/quality.rs:2704-2745 | crates/html/src/quality.rs:866-908 \u2014 before extracting anything, compare \u0060crates/core/src/browser/quality.rs\u0060 and \u0060crates/html/src/quality.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/quality.rs:2704\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"84329bd0db3fe63fb20484759d77c47906f8eee902cb9a1df1db8b1c0a0b6948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201343 lines \u00D7 2): crates/hook/src/hook.rs:86-128 | crates/hook/src/hook.rs:631-671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fc34d95e6d0d628196b654925e8dbdb102adec1275a31822646811bbda1481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201341 lines \u00D7 2): crates/core/src/browser/element_checks.rs:831-871 | crates/core/src/browser/element_checks.rs:929-962 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/element_checks.rs:831\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c88c45104d1d25b6d47a54bf58051d738e9d5fbbc063ee146e5dfb7b432bf63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): crates/browser/src/html_snapshot.rs:78-117 | crates/cli/src/capture_snapshot.rs:59-98 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/html_snapshot.rs:78\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f466d3e5a12c954a80a90f6ce3f56c764524fdffe6a363907996f00d97e79cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): crates/browser/src/html_snapshot.rs:237-295 | crates/cli/src/capture_snapshot.rs:369-427 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7875039fdb28d0514924d3028c5dfabfc188add97de5ce17901cf0cd9b8ed66a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201329 lines \u00D7 2): crates/core/src/browser/quality.rs:3297-3325 | crates/html/src/quality.rs:1221-1246 \u2014 before extracting anything, compare \u0060crates/core/src/browser/quality.rs\u0060 and \u0060crates/html/src/quality.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/quality.rs:3297\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4802703ec3e580877ac26c35780729d282312befa9e6f3ef731161f3d1c43a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): crates/core/src/checks/css_scan.rs:180-206 | crates/core/src/checks/rules.rs:2268-2292 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3523fa3a63f2353eee61c74faa38d08b8a5e5cd65f29cae6703d7d0d44871de8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/foundation/src/css/measures.rs:691-716 | crates/foundation/src/js_ext_a.rs:72-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/measures.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b3879114913b5fbe261bf1a6ee04d63f129d9b116903d58782e3716865d6a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/account/src/design.rs:113-136 | crates/account/src/design.rs:148-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/account/src/design.rs:113\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/design.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07269e57eb76e06f46d5e9feab8d03e2d05b25c4f8042654ac7b27203dd626f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): crates/browser/src/html_snapshot.rs:399-424 | crates/cli/src/capture_snapshot.rs:494-518 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/html_snapshot.rs:399\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b82bcd4aed37196de26f5ebb3668974b8fc3b1f7d0cffea18444d188eb26f77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/comp/src/jsnum.rs:45-68 | crates/foundation/src/js.rs:342-365 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/comp/src/jsnum.rs:45\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/jsnum.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6d7fe86e2f1a6add0364992f6d2b7b4191b319492c0ad8dd382de82184383f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): crates/context/src/context.rs:420-437 | crates/detect/src/design_system.rs:1159-1180 \u2014 before extracting anything, compare \u0060crates/context/src/context.rs\u0060 and \u0060crates/detect/src/design_system.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/context.rs:420\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1e61ffbb7d1b6cde9bb9976b32390241be719613c469c57af89481ae982e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/context/src/design_parser.rs:119-140 | crates/live/src/design_md.rs:196-217 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/live/src/design_md.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:119\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5957ce4ae2bea6e7070ba7976a74c98df71de49cd61064a930acbb2a1d5c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/detect/src/detect_text.rs:2239-2259 | crates/detect/src/detect_text.rs:2282-2302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/detect_text.rs:2239\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb821f6bba7667dff78d7aab56daf6cdcd6cfb0e7014ed6c561247d606a9f66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201320 lines \u00D7 2): crates/hook/src/admin.rs:783-802 | crates/skills/src/hook_manifest.rs:516-529 \u2014 before extracting anything, compare \u0060crates/hook/src/admin.rs\u0060 and \u0060crates/skills/src/hook_manifest.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ece3c9fa9151a3d33476765e08e910fe0c1be270829075b100a8c757db8597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/live/src/live_insert.rs:120-138 | crates/live/src/live_wrap.rs:84-103 \u2014 before extracting anything, compare \u0060crates/live/src/live_insert.rs\u0060 and \u0060crates/live/src/live_wrap.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_insert.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c69ae57a54681c01ff43f2c3c8b415f8f37eaad7456ea86ff5c8f694566e026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/core/src/browser/driver.rs:177-195 | crates/detect/src/design_system.rs:932-949 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/driver.rs:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"93650557386925058551e5568f6a5afa5a2178da0f1078763aa7df7f48f24994"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/browser/src/html_snapshot.rs:297-314 | crates/cli/src/capture_snapshot.rs:429-446 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"702cb4034bbc8989ea8793d7beecfd16fc091103255c52b3600c3e4e07fed57d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/context/src/generate_image.rs:36-52 | crates/detect/src/config.rs:577-593 | crates/detect/src/design_system.rs:658-674 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/generate_image.rs:36\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"748757cc7dd82a961f9837c7d9dc54f33ca562c561d0d0ac894774676b07a80b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/live/src/live_server.rs:1156-1172 | crates/live/src/live_server.rs:1560-1576 | crates/live/src/live_server.rs:2010-2026 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c95653e5785c4c0913d4ea5819fe6eefde0b2e0a586ab0c61a6d00bb7d9c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/common/src/jsp.rs:339-355 | crates/common/src/jsp.rs:397-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/common/src/jsp.rs:339\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"d121eb0db388d1128b12c7c7a1452646e7cf7c1acbc9e32dd205c4c3818b0a7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/context/src/util.rs:197-213 | crates/detect/src/ignores.rs:347-363 \u2014 before extracting anything, compare \u0060crates/context/src/util.rs\u0060 and \u0060crates/detect/src/ignores.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/ignores.rs:347\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba842d8e487879261662ce9054dfa8faad8f6381291be55079b5c1dcb72ce5af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/core/src/browser/quality.rs:2240-2256 | crates/html/src/quality.rs:727-743 \u2014 before extracting anything, compare \u0060crates/core/src/browser/quality.rs\u0060 and \u0060crates/html/src/quality.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/quality.rs:2240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15f39c40904dcbb6223e3d1dfb4b3192b2dfa0baa62cf2c821fd488a95d80bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/core/src/browser/visual.rs:2726-2742 | crates/core/src/browser/visual.rs:3019-3035 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":2726}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d3a494816e1a34102cf131b8b32e342c0918d619b84e950ff354bc56fe3aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/detect/src/config.rs:1007-1023 | crates/hook/src/hook_lib.rs:1176-1192 \u2014 before extracting anything, compare \u0060crates/detect/src/config.rs\u0060 and \u0060crates/hook/src/hook_lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/config.rs:1007\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"09aa890243079fbae85b11fc1c41654c4386941fd39405b7df02633d5e15f1b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/detect/src/regex_matchers.rs:160-172 | crates/detect/src/regex_matchers.rs:608-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"927501bf23d3c10ece373fcb32187380f6d99e2c57fd0b2ad0a4adc0775bd8fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/html/src/cascade/csstree/parser.rs:980-996 | crates/html/src/cascade/csstree/parser.rs:1009-1025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/cascade/csstree/parser.rs:980\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e64a8544858001246b269e097d22227ce4e524c35508a98ef58b7c6afe0e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/live/src/accept_css.rs:85-101 | crates/live/src/accept_css.rs:115-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/accept_css.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ca23d388245120d38fafac3ee49d2519c36d162eca74b3ec2afd67357d624a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/live/src/live_insert.rs:140-155 | crates/live/src/live_wrap.rs:106-122 \u2014 before extracting anything, compare \u0060crates/live/src/live_insert.rs\u0060 and \u0060crates/live/src/live_wrap.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_insert.rs:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/live/src/live_wrap.rs:123\u0060 calls \u0060relative\u0060, \u0060resolve\u0060 and \u0060crates/live/src/live_insert.rs:156\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a231348b01acf184c5d72c8a5d09950276b62547c14ac0a5a1a327ff1fea79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/context/src/context_cli.rs:572-587 | crates/skills/src/providers.rs:607-622 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/context_cli.rs:572\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa9650f2c8b5ada076c85201043f9decb9c3218604d133af0270595269a8465"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/context/src/design_parser.rs:101-116 | crates/live/src/design_md.rs:178-193 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/live/src/design_md.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35919b474e593c50435868578faabae491a28a1c5cede97846dc535bd9c135d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/context/src/design_parser.rs:143-157 | crates/live/src/design_md.rs:222-237 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/live/src/design_md.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:143\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c8cb540143f8d4030cadedc29f5f6dd2eca0c7683ff237643673f0e482b113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/core/src/browser/page_checks.rs:3812-3827 | crates/core/src/browser/page_checks.rs:5526-5541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3812}}}],"partialFingerprints":{"codehealthFindingId/v1":"8131c1079af00cd096102c8c7172002357454e9a81b84b1b40ceddd346029abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/core/src/checks/decorative_text.rs:472-487 | crates/core/src/checks/rules.rs:890-904 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/checks/decorative_text.rs:472\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/decorative_text.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"056d9efb49a89748b0744e4dede8b6d7fef152b1dcf051b2ca198c7352d3c666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/live/src/copy_edit_agent.rs:877-892 | crates/live/src/manual_edits/evidence.rs:474-489 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/copy_edit_agent.rs:877\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"647e89b3c2134e971f592d00a7c6bb5439240ecc74b534e3a8bd88fce5f3d281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/browser/element_checks.rs:1867-1881 | crates/core/src/checks/html_patterns.rs:1000-1014 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1867}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c938c75606db91e17f2ebc309a1217256f47684f96b47ebe45d072bfc0830bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/detect/src/detect_text.rs:230-244 | crates/detect/src/detect_text.rs:1688-1702 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/detect_text.rs:230\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52519fe67f4411a69ca15311dae9a90aa355175b40ecb2ba4412f253bc25003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/live/src/manual_edits/evidence.rs:795-809 | crates/live/src/manual_edits/evidence.rs:825-839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/evidence.rs:795\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/evidence.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f45f822fe35516c7c07a4098b15ffbb7911056137f107ccbb9d9ac03f9b7190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): crates/live/src/svelte_component.rs:284-298 | crates/live/src/svelte_component.rs:527-538 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/svelte_component.rs:284\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"254174eba1f3f7d00fff5c4a32d4dd82fd8327a6f386c6a879d44f073a5114a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/foundation/src/vectors/checks_b.rs:33-46 | crates/foundation/src/vectors/mod.rs:42-55 | crates/html/src/cascade/vectors.rs:56-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/foundation/src/vectors/checks_b.rs:33\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/checks_b.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f23510feae69328a76fe7857cf42959a95cdbe6e347d94fde7f16bf42c09f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/account/src/store.rs:224-237 | crates/account/src/store.rs:252-265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/store.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c048b31afc5761ff8ee6f568eb0adf85a9adc7e646b948ed5f3d7ce9649f6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/browser/src/cdp.rs:366-379 | crates/browser/src/cdp.rs:420-433 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/cdp.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":"crates/browser/src/cdp.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1144dc7da863bf46763ca6d592872f8170a6e698aa065de7467167196dab97b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/browser/src/html_snapshot.rs:207-220 | crates/cli/src/capture_snapshot.rs:316-329 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/html_snapshot.rs:207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"853b51e5478c2af6f60ff2148313082aa35b36cd0b4d39087afc3754f6f7b373"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/browser/page_checks.rs:815-828 | crates/core/src/browser/page_checks.rs:845-858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2f36ade873c1fd661fcd73aef2e2744332e1410cba9c7a0b8e830b854ebaba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/core/src/browser/page_checks.rs:3042-3055 | crates/html/src/page.rs:654-666 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/page_checks.rs:3042\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3042}}}],"partialFingerprints":{"codehealthFindingId/v1":"579fae86039ac7ae6997a9ffe37a9f442d78bc76c1f6d90270c3c32545a6b452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/checks/css_scan.rs:385-398 | crates/foundation/src/color.rs:763-776 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5d79250b8d03f322b0fc0ab89eced2ed9e3d5a5b62d906f988f80b9af38f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/core/src/checks/css_scan.rs:1075-1088 | crates/core/src/checks/row_stripe.rs:207-220 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5a8d7412ded25abe0d3093ae96409422f542d8665faac928d36a48c7f34779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/detect/src/detect_text.rs:1217-1230 | crates/detect/src/detect_text.rs:1239-1252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/detect_text.rs:1217\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0b22ab5b4bd163332c17ad74ae9e1114f234753195a3338aa78d0bb586b2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/detect/src/ignores.rs:254-267 | crates/hook/src/admin.rs:871-884 \u2014 before extracting anything, compare \u0060crates/detect/src/ignores.rs\u0060 and \u0060crates/hook/src/admin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/ignores.rs:254\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6a783bc4f9c9c9c21becb09bd14d9f72d67c57d181d6f6d5f7a3408c04d7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/live/src/manual_edits/apply.rs:642-655 | crates/live/src/manual_edits/apply.rs:693-706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/apply.rs:642\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"9256354e7ff27a75bde91d17dd1c599631a7f7b237f171b0bacae23169f689db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:1995-2006 | crates/live/src/manual_edits/commit.rs:2169-2182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:1995\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1995}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f0188b77bff1b0da97fb69de0799cecdf51f8e479d818ab825327fadc024b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 3): crates/context/src/design_parser.rs:229-237 | crates/detect/src/design_system.rs:402-414 | crates/live/src/design_md.rs:306-316 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/detect/src/design_system.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:229\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4e3b307cd7e2145766e119a140358c93eea8ed52fe6b766f414654df300f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/browser/src/html_snapshot.rs:156-175 | crates/cli/src/capture_snapshot.rs:332-351 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1bc210944eaa54ca6b7f649ab1d366aab277d11d73587c7031e4f2bdf6f35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/browser/src/html_snapshot.rs:187-202 | crates/cli/src/capture_snapshot.rs:296-311 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/html_snapshot.rs:187\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e0a1976c9c9e2efe60d899fdc311cfef9f229d70f52d3aed8d1beef43a2f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/browser/src/html_snapshot.rs:223-235 | crates/cli/src/capture_snapshot.rs:355-367 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"932eb94f82ff983f024e037771bc5b0e7b1a3981c01b04aa7611d9ef137e7466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/asset_capture.rs:627-639 | crates/cli/src/asset_capture.rs:662-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/src/asset_capture.rs:627\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a5d9e308a029b2c875de545ac77dedf377c6c393ed9a9ace23f331bc0277b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201313 lines \u00D7 4): crates/context/src/design_parser.rs:162-163 | crates/context/src/design_parser.rs:167-179 | crates/live/src/design_md.rs:267-268 | crates/live/src/design_md.rs:272-284 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/live/src/design_md.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:162\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"89000d338b58e146a654f2a91a54412b2cdca1155654be763a88f7287bac3835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/browser/text_geometry.rs:268-280 | crates/core/src/browser/text_geometry.rs:319-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/text_geometry.rs:268\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_geometry.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e30f2a363f6f9e7609d3f7ceeacc665a17042a207ee08602b9c13bb0094293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/html/src/cascade/csstree/parser.rs:456-468 | crates/html/src/cascade/csstree/parser.rs:1364-1376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/cascade/csstree/parser.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/parser.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0cc95b5a3ded93183d3c459d37540d1c4e9110604b09977eb065b0791160da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/html/src/cascade/csstree/strings.rs:89-101 | crates/html/src/cascade/csstree/strings.rs:144-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/cascade/csstree/strings.rs:89\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/strings.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"124511256cfcba7d2af8def06548c9a795ba9fea0cadb0f6ef894b3c06f6a9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/live/src/accept_css.rs:699-711 | crates/live/src/svelte_component.rs:1190-1202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/accept_css.rs:699\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a30128c6b9dc63f0ce348088502d7319b3972a92346248f573642deff343de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/live/src/json_error.rs:189-201 | crates/live/src/json_error.rs:238-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/json_error.rs:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/json_error.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37d12a4cb3630227fe47fea7664cc77d9226d081187600333bb860ea80f1794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/live/src/live_server.rs:1735-1747 | crates/live/src/live_server.rs:1826-1838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_server.rs:1735\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"416367851f1c0ddae33e05dbb0841f7d3994ac66ca2635f4598597f37059dfc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/live/src/wrap_common.rs:159-171 | crates/live/src/wrap_common.rs:184-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/wrap_common.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/wrap_common.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7c452342fba640f93978838d872c5795b5c2b81482eab10fa160d78c4098a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/agents/src/fs_writer.rs:41-51 | crates/agents/src/lib.rs:397-408 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/agents/src/fs_writer.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/fs_writer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dcfb186709fda5461a561ab9c37ce74f72d88aa4fbaf84330286e1761eec53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/agents/src/resources.rs:260-271 | crates/agents/src/resources.rs:467-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/agents/src/resources.rs:260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf77369baa7f835619fcdcbbdd5ccea55787b6a3fdc1a33bec908828e19a34c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/context/src/design_parser.rs:31-41 | crates/live/src/design_md.rs:99-110 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/live/src/design_md.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/design_md.rs:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cde86c6b565890bf79484ff274917a0e829d6d4cb91e588bec62284f99f141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/context/src/design_parser.rs:215-225 | crates/live/src/design_md.rs:353-364 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/live/src/design_md.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:215\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9756b72f273f9f8e7b791638fda5dd224ffbe4c40a8aef243de27c449c1db354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/context/src/generate_image.rs:358-369 | crates/context/src/generate_image.rs:390-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":"crates/context/src/generate_image.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"760d20506b83f8c16b5fba053264e65ef9fad3c7c3f308587337e27767d81e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/browser/background.rs:364-375 | crates/core/src/browser/element_checks.rs:2389-2400 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5061ae73be43652d82ef8d964dadd31ff5b647c7d660509aeed0af15b28e20c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/browser/element_checks.rs:2333-2344 | crates/core/src/browser/element_checks.rs:2714-2725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af4db08263f70289f28bf0431fb1fc8af28b68858b689527b596cc178abaafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/foundation/src/css/scan.rs:167-178 | crates/foundation/src/css/scan.rs:200-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/foundation/src/css/scan.rs:167\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e99e0f3aadfc8833a5482eaa4980be0e6d81e23a695fd13a3bd8a570196826"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/html/src/adapters.rs:1154-1165 | crates/html/src/adapters.rs:1296-1307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/adapters.rs:1154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0714f37ee01d9136d2bbb4bd63796a722b35a7fd5075644535d6c6eccd75685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/live/src/live_accept.rs:390-401 | crates/live/src/live_accept.rs:439-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_accept.rs:390\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"21796bf15b03aac81e3c8048b0f0d5d3a61fcc51adb0309c3f54428cc6f9fd3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/live/src/manual_edits/apply.rs:1139-1150 | crates/live/src/manual_edits/apply.rs:1282-1293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/apply.rs:1139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"779b8d79e1725a21a07e0f52830d047f04a7730ae791748669aea9b5b810d3b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:2039-2050 | crates/live/src/manual_edits/commit.rs:2185-2196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:2039\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ad86dedee0ef2ca755b52711aa259cf30a0a78f4c6fd4958f352c2ffed4c64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/context/src/design_parser.rs:98-108 | crates/detect/src/design_system.rs:490-500 | crates/live/src/design_md.rs:175-185 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/detect/src/design_system.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"500661469e6e241a86f1299b3b907bdfa1bf9b60cd92a2c396fb6ba7243061a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/live/src/live_poll.rs:258-268 | crates/live/src/live_server.rs:407-417 | crates/live/src/svelte_sessions.rs:65-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da233ebe53f30d02559d189011c0c7a5fe0efe67e1cfc5a2fb94eea6efd8be1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/live/src/manual_edits/commit.rs:1907-1918 | crates/live/src/manual_edits/commit.rs:1963-1974 | crates/live/src/manual_edits/commit.rs:2017-2028 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:1907\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b61239bd59cc52606d76f3d8a376bf0038f20b883f19f3b9ad6ffc947b00d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/context/src/design_parser.rs:130-140 | crates/detect/src/design_system.rs:502-512 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/detect/src/design_system.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"43517159288ff89aeb10d82917380cdd7a4f33b0a28ec32d2900d1eab7c99600"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/core/src/browser/quality.rs:1188-1197 | crates/core/src/browser/quality.rs:1234-1244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c170050e2362db3de3fea36b5eb0fefdac5e06de711ffe611ffe2fd8d3ea67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/core/src/browser/text_layers.rs:968-978 | crates/core/src/browser/text_layers.rs:1044-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/text_layers.rs:968\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84e6e46a5130af2b2a1ad23a103b01b5e08b5b42d688e223ded80e033225bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/core/src/checks/css_scan.rs:445-455 | crates/core/src/checks/css_scan.rs:941-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/checks/css_scan.rs:445\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"954af6eefcb85e352b1eceecc773f8e8ee6cd487d19b65b414142e1549031725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/detect/src/design_system.rs:1352-1363 | crates/detect/src/design_system.rs:1373-1384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/design_system.rs:1352\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f352ae158bb4891664f4307a57eab70a20007362f845a591184113407f401a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/hook/src/hook_lib.rs:1449-1459 | crates/hook/src/hook_lib.rs:1581-1591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hook/src/hook_lib.rs:1449\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffbaeea6b8987df4dad4ccc2a00ea7961a768f29a6d29356c21e05c6aa494c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/live/src/accept_css.rs:788-798 | crates/live/src/bake.rs:166-176 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/accept_css.rs:788\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/accept_css.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"01762847a44c27ba4c5026e3a9e3d72f1bfd48dc26f6b5f76265725cd4b3af20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/live/src/design_md.rs:1015-1024 | crates/live/src/design_md.rs:1351-1361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/design_md.rs:1351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/live/src/design_md.rs:1025\u0060 calls \u0060insert\u0060, \u0060into\u0060, \u0060Array\u0060 and \u0060crates/live/src/design_md.rs:1361\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa6919df4852b2ae71b85fbae5ba3244e2f8ea63deaee13104985d8a46f0a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/live/src/event_validation.rs:48-58 | crates/live/src/instructions.rs:42-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/event_validation.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/event_validation.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"81aa3cee41b6ac831af55789d444505da847c1b296153c9a0b60f00abfbe1cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/live/src/live_server.rs:1883-1894 | crates/live/src/live_server.rs:1923-1934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdaf4f914b6eec0f902e19d1b53170e0ca7ef67453bb577e5a18774e52595a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/live/src/manual_edits/commit.rs:1875-1884 | crates/live/src/manual_edits/commit.rs:1909-1918 | crates/live/src/manual_edits/commit.rs:1965-1974 | crates/live/src/manual_edits/commit.rs:1997-2006 | crates/live/src/manual_edits/commit.rs:2019-2028 | crates/live/src/manual_edits/commit.rs:2173-2182 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:1875\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1875}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97d5de7856dd5be2945f059fd3d68f9fcc50027d6f328ced10db3e6049eb4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/core/src/browser/element_checks.rs:2747-2757 | crates/core/src/browser/visual.rs:2734-2743 | crates/core/src/browser/visual.rs:3027-3036 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"4422bf379aba0036faca61d3d8340d83bac428ebb8a9040897d98e51147e9c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/browser/src/html_snapshot.rs:316-325 | crates/cli/src/capture_snapshot.rs:448-457 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd73c6a193b19fda0a8374ed57218d6d1a6958b5b34103c95ed593760d7f1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/browser/src/lib.rs:1261-1270 | crates/browser/src/lib.rs:1406-1415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fad764c8d00c0fe46d51199f7dbaf3581814e494f4e25894aa4b0beb56cf04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/browser/src/lib.rs:2132-2141 | crates/core/src/browser/visual.rs:4246-4255 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ed6fe6fa44734c08b93a516846a61a60486a7f1a14a056a42d8c2d7db237e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/common/src/jsp.rs:405-414 | crates/common/src/jsp.rs:720-729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/common/src/jsp.rs:405\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d535e2bebd7e04f53df32116814e39bff1285a1c8c310a6b7848e0c5b4b23b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/context/src/design_parser.rs:49-58 | crates/context/src/design_parser.rs:79-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd7ae0adcb3750ba2549f860009fe7b87729bc1c7202a6dca99b3cbcfbacca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/browser/background.rs:174-183 | crates/core/src/browser/background.rs:579-588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/background.rs:174\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"428361a49eb9c7a550da39d0a2fdff8eaa312a99e490402671d36d08c3780c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/browser/visual.rs:1108-1117 | crates/core/src/browser/visual.rs:2869-2878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/visual.rs:1108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab8a962cb639d03a19ef8ac3327f903ab01232a7fc18e0aeb8134c761d94c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/checks/vectors_a.rs:124-133 | crates/foundation/src/vectors/checks_a.rs:87-96 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_a.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"18059cb2d10bdf2c59f209ebdca05231b46def722882e7dfb66415bf56f38853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/html/src/cascade/csstree/generator.rs:332-341 | crates/html/src/cascade/csstree/generator.rs:344-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/cascade/csstree/generator.rs:344\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/html/src/cascade/csstree/generator.rs:343\u0060 calls \u0060tok\u0060 and \u0060crates/html/src/cascade/csstree/generator.rs:331\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/csstree/generator.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a955f9776aa150767593ff1606e850b54fc81731b1855858f590dc15fe9df83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/live_complete.rs:29-38 | crates/live/src/live_resume.rs:242-251 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_complete.rs:29\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_complete.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ed9d8bf9a69e6dcb1d0124781caaf91276cb8eed0963823da83d4e87572815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/live_discard_manual_edits.rs:44-53 | crates/live/src/live_resume.rs:114-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_discard_manual_edits.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_discard_manual_edits.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f75cc627061a83d20e7160e949fd2cfc99a215bc4016d23e9999174a30012d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/live_inject.rs:60-69 | crates/live/src/live_inject.rs:99-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_inject.rs:60\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_inject.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fe07599def3ac72a8ad4da946e3dbd3ba275ffad6b0475d8262ddbd9f4e2aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/live_poll.rs:716-725 | crates/live/src/live_server.rs:448-457 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae785a7cb15d164bc0f01f5d26f2b952f2a2876f10b224d4827d4ec8f4e07a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/manual_edits/mod.rs:42-51 | crates/live/src/source_search.rs:142-151 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"924507a8bf35249655e2b1d1914d1b6fa01284bbe6126aafc5fabeb13d5cb002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/svelte_ast.rs:453-462 | crates/live/src/svelte_ast.rs:1429-1438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/svelte_ast.rs:453\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b616d26c22d7b55bd76e7fbed79e2238cfbf6d119bfcf2341f7f42a285bf081a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/agents/src/resources.rs:486-494 | crates/agents/src/resources.rs:551-558 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/agents/src/resources.rs:486\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4e0d53e9e587694c1bff4de46b97b782537ec5822d5809e5f3a1c747a533cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/common/src/http.rs:91-99 | crates/foundation/src/fonts.rs:66-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/common/src/http.rs:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/http.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cec6b2b2041e3bc73c1a14e73c8b179e3bdd14218c145133635e60d665ef111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/common/src/jsp.rs:618-626 | crates/common/src/jsp.rs:628-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/jsp.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e308c617d5a40a7e6fb614fc08b5be2bb458adaf2203e9ddfc527cea5cf48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/comp/src/hero.rs:161-169 | crates/comp/src/hero.rs:285-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/comp/src/hero.rs:161\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c49d9f9e7cf72049b5ac3459ec6f8817be9e0ded0f1aa4839d3925f4a59068c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/context/src/design_parser.rs:69-76 | crates/live/src/design_md.rs:144-152 \u2014 before extracting anything, compare \u0060crates/context/src/design_parser.rs\u0060 and \u0060crates/live/src/design_md.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/design_parser.rs:69\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05294399b39fd52a13a3915bec54f2ca70ac446567d0f2e236089977851e385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/context/src/serve_question.rs:1432-1440 | crates/context/src/serve_question.rs:1486-1494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/serve_question.rs:1432\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab11a7d08a96e3629a490284144b172eababdce6cff0de6849cfa577474182f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/browser/text_collectors.rs:1047-1056 | crates/html/src/page.rs:610-619 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/text_collectors.rs:1047\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"2372b80804ce7eb6dacd46729c335ee607308043a809c9296f266311194bce1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/checks/rules.rs:1697-1705 | crates/core/src/checks/rules.rs:1957-1965 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/checks/rules.rs:1697\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060opts\u0060 to \u0060\u0026IconTileOpts\u0060 in one and \u0060\u0026HeroEyebrowOpts\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdf665e7d29efcafaf25219206a3b0db67bde0389258fda3bf613a51f27f123"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/detect/src/config.rs:131-139 | crates/hook/src/hook_lib.rs:503-511 \u2014 before extracting anything, compare \u0060crates/detect/src/config.rs\u0060 and \u0060crates/hook/src/hook_lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/config.rs:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026mut DetectionConfig\u0060 in one and \u0060\u0026mut HookConfig\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7ff8691826fd619a9286bc633a6d2aa58076ee11bb5d7d580c5efdff6cd25d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/detect/src/design_system.rs:417-425 | crates/detect/src/design_system.rs:449-457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/design_system.rs:417\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede0bb7f4db13c8307fde624f6bff08ccb861ba7a98595353788d0683c765c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/detect/src/regex_matchers.rs:2125-2133 | crates/detect/src/regex_matchers.rs:2352-2360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9835a811d78103eef6776d85e4a972f6b324e5a587698abe4fb83c70198a8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/hook/src/admin.rs:841-849 | crates/skills/src/hook_manifest.rs:558-566 \u2014 before extracting anything, compare \u0060crates/hook/src/admin.rs\u0060 and \u0060crates/skills/src/hook_manifest.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hook/src/admin.rs:841\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fa8c52199dfda21677f796d857757d972da0111a490820c6fd895df1959443"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/hook/src/before_edit.rs:764-772 | crates/hook/src/hook.rs:239-247 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hook/src/before_edit.rs:764\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66db350f4c1546fd043fc6fe3b77f8a6b644de99eb6c13bbcc0ede4832b346e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/live/src/live_server.rs:2646-2654 | crates/live/src/live_server.rs:2691-2699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_server.rs:2646\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec411ea45b2cd872c9233687004bb5a78015da3f16cc2d04e86062209f6a473"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:1614-1621 | crates/live/src/manual_edits/commit.rs:1760-1768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:1760\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/live/src/manual_edits/commit.rs:1622\u0060 calls \u0060insert\u0060, \u0060into\u0060 and \u0060crates/live/src/manual_edits/commit.rs:1768\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf571239f98a71fa7398618afe090334d117c8a8f12f0bb61b20995e76e1e73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/live/src/svelte_component.rs:1570-1578 | crates/live/src/svelte_component.rs:1689-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/svelte_component.rs:1570\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4351c43e9ddf26ac6990617537ce8ae2ce4e49a85987e870107a4d1d935a5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/live/src/live_accept.rs:952-959 | crates/live/src/svelte_component.rs:342-349 | crates/live/src/svelte_component.rs:1005-1012 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_accept.rs:952\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"226ce9667a8cb933eeeae8239e3c2ee512f507e347f81c6745c02fb019a017a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/account/src/store.rs:239-246 | crates/account/src/store.rs:267-274 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/account/src/store.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/store.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cef9d3948dd93990bce9d5d84ba252c10a055809af0a23117f8630317e0e706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/comp/src/jsnum.rs:36-41 | crates/foundation/src/js.rs:328-335 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/jsnum.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3add2cefa583ecbed4a4db5c2d65d6a8040283666874ea14b7dd5e9587b13a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/comp/src/png_io.rs:78-85 | crates/comp/src/png_io.rs:88-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/png_io.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"29bb3a7bf6f292a9d9596f0fc3f710fce9827f3213b060272f7026c3e67c0091"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/context/src/context.rs:702-709 | crates/context/src/staleness.rs:76-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fe6a987b0ee146698cdb758f347835610af9392858a2d9d625df5269445696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/context/src/context.rs:1117-1123 | crates/context/src/surface_briefs.rs:191-198 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7ce7af14423dd6e13027207ab24780f318a54231888c2daf7eaee9c36c6309"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/context/src/context_cli.rs:864-876 | crates/context/src/context_cli.rs:887-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"6023bac5b377977ba0901e9e7c2a62995d917aa5f63daaf2ad20cd53ef2ab5f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/core/src/browser/driver.rs:3297-3306 | crates/core/src/browser/driver.rs:3371-3380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/driver.rs:3297\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":3297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2de41b777e7433e3ae844932e2b05b4aec37201562a2ba73c24318677a97f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/core/src/browser/page_checks.rs:1783-1789 | crates/core/src/browser/page_checks.rs:2212-2219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/page_checks.rs:1783\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"6188042a027c40c8200cdde1ba2aa1ab07f91eaa70a327320d18d225dac9abfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/browser/painted.rs:2273-2280 | crates/core/src/browser/painted.rs:2298-2305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/painted.rs:2273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2273}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c84f14630a09b5521dd3d094cbc8a9c20e6da56345351b2fa3b7939c38bb921"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/browser/text_collectors.rs:1012-1019 | crates/html/src/page.rs:577-584 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d7d66a7e4a960b30e05a30701fc644b83d5caf524d47e9d391f7232c650218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/detect/src/ignores.rs:123-146 | crates/hook/src/admin.rs:1023-1046 \u2014 before extracting anything, compare \u0060crates/detect/src/ignores.rs\u0060 and \u0060crates/hook/src/admin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/ignores.rs:123\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c48041f45b06130ccea8208a16150e7155bef1ba1f27851850193882efaf5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/hook/src/admin.rs:709-716 | crates/skills/src/hook_manifest.rs:605-612 \u2014 before extracting anything, compare \u0060crates/hook/src/admin.rs\u0060 and \u0060crates/skills/src/hook_manifest.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hook/src/admin.rs:709\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7406f63d510ea69251bfecc537bbc5c6e35a2d855c47be1eb3990e015ba424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/live/src/copy_edit_agent.rs:488-495 | crates/live/src/copy_edit_agent.rs:1372-1379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/copy_edit_agent.rs:488\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d466e1510fd6154bb5589d5b3044f91a32a8659ca739b0427a91658ae9c76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/design_md.rs:121-130 | crates/live/src/design_md.rs:156-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/design_md.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7960d98522ab2aa78225b0366cf862e356673417faf35add0f55fa3ed958366b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/live/src/live_boot.rs:149-155 | crates/live/src/live_boot.rs:214-221 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_boot.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_boot.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee84fc8b93b022c4767017c7c412047f6f097b75d6f20cda476f628373ec03d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:566-573 | crates/live/src/manual_edits/commit.rs:589-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:566\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5225f0706a75a8fa42c9e46df213fe33f3bf6c6c7ca7f1834f755e6e2eec61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/live/src/session.rs:770-777 | crates/live/src/session.rs:813-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4a50caf48a29b36a1019a23a6ac43442ab3a966e3d4f6389d01382b43dc65b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/live/src/svelte_ast.rs:1616-1623 | crates/live/src/svelte_ast.rs:1628-1635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/svelte_ast.rs:1616\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d2c045986e41d51abbd4fac01d36766eb2f7461c118c0c46656463345833ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/live/src/copy_edit_agent.rs:1094-1100 | crates/live/src/copy_edit_agent.rs:1134-1140 | crates/live/src/copy_edit_agent.rs:1142-1148 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"86baa96a990dfe1c72da084b62fb5bb4d417e10eb9fc587bc473997ca5910d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/live/src/session.rs:603-609 | crates/live/src/session.rs:844-850 | crates/live/src/session.rs:887-893 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6180c0905bf8b3fbbf086fe6abe1a6e53d9ec8ba10f93651aaf7dffd128ca02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/context/src/serve_question.rs:250-256 | crates/context/src/serve_question.rs:270-276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/serve_question.rs:250\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c50018364e749cd85daff1fa701178f66f9d263b07e7e96792a7253f3eb8cc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/context/src/util.rs:138-145 | crates/skills/src/util.rs:110-117 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0e06dcfe5fb5500107601d703f0f1234fe9a251dfcc78124aabe2ca245447e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/driver.rs:25-31 | crates/html/src/adapters.rs:85-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/driver.rs:25\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c51a8fac3517a81e989412e9bcb5faf2251dea36dc06d37005049281af50aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/core/src/browser/element_checks.rs:2283-2297 | crates/html/src/adapters.rs:823-837 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff39b700bb185d764d5593fca92f30a303dd93770d57ed2c6080dc8af71a9ff6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/element_checks.rs:4724-4730 | crates/core/src/browser/element_checks.rs:4774-4780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/element_checks.rs:4724\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4724}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aefc595956bb134abc024268f525bcc379be138a399f81d2a1e0645eafe3b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/page_checks.rs:3962-3968 | crates/core/src/browser/page_checks.rs:4879-4885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/page_checks.rs:3962\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":3962}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a9a2780447fc5f380ed4ac4934c307768527b20a9ee2f597fe22da8413addd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/detect/src/config.rs:742-748 | crates/live/src/config.rs:114-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/config.rs:742\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22f644f7530af36cbf391d0de472bd2d1162d4df94312195aeafd55ad921f05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/detect/src/config.rs:1049-1055 | crates/hook/src/hook_lib.rs:1228-1234 \u2014 before extracting anything, compare \u0060crates/detect/src/config.rs\u0060 and \u0060crates/hook/src/hook_lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/config.rs:1049\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"df709e9827d5080dbbaea8c207dd2273a105dcd3b397af4030b76fa0dfd61f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/foundation/src/color.rs:1077-1085 | crates/foundation/src/color.rs:1088-1096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/foundation/src/color.rs:1077\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"f070ff8fcbb4d8ab0c749a3620cc3d025e7a5d940c58b48aba466c7139149f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): crates/live/src/design_md.rs:1237-1243 | crates/live/src/design_md.rs:1260-1264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/design_md.rs:1237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/design_md.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"537bbdedfde6c58a08254744642c9bcdfa5c87711cd68cfe5ac44a37527beb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/live/src/live_accept.rs:186-192 | crates/live/src/live_insert.rs:91-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_accept.rs:186\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/live/src/live_insert.rs:98\u0060 calls \u0060parse_count\u0060, \u0060arg_val\u0060, \u0060as_deref\u0060 and \u0060crates/live/src/live_accept.rs:193\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc6dfd018964a90d63309999c929f81d7e7c841da79d7d9634fe8d4a546b82a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/live/src/live_inject.rs:142-148 | crates/live/src/live_inject.rs:256-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_inject.rs:142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_inject.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8369dae3007dcaf60976d261c94ab0f9857b06e322a1fd6b29e90eb0a892ab1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:667-672 | crates/live/src/manual_edits/evidence.rs:744-750 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:667\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"6012dfe35c5ad90a4cf43544a082155db057985bc70d6dc409a764fb650f3c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:1167-1173 | crates/live/src/manual_edits/commit.rs:1862-1868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:1167\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f797f4a9d74251d367488b1483fee32b619f9c86fb28634a6aa9d7ea3df2ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:1543-1553 | crates/live/src/manual_edits/commit.rs:2068-2078 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:1543\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0885856e33361532c23963479489036d2720cb9295c905259c39f0b8dcb596a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:1941-1947 | crates/live/src/manual_edits/commit.rs:2030-2036 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc79773f33421a897dc49a7124d71bbcc517527ef534673cde265f12a64a34ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/skills/src/bundle.rs:849-855 | crates/skills/src/bundle.rs:1051-1057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skills/src/bundle.rs:849\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5c77fd124bb49df4f0b3286026ebff4babe7e3c63983fe9f1744b225de5f95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/account/src/store.rs:202-208 | crates/account/src/store.rs:240-246 | crates/account/src/store.rs:268-274 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/account/src/store.rs:202\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/store.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b2082189dc057e0df3da12e6908e7dd0543cfc43c836eb6b10edb8aa6027ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/context/src/context.rs:926-931 | crates/detect/src/design_system.rs:1353-1358 | crates/detect/src/design_system.rs:1374-1379 \u2014 before extracting anything, compare \u0060crates/context/src/context.rs\u0060 and \u0060crates/detect/src/design_system.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/context.rs:926\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a9b4083d340bd64218cdda501059a6d9a9a62ae7b9f1c500784938eacc6b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/core/src/browser/element_checks.rs:1961-1966 | crates/core/src/browser/element_checks.rs:1972-1977 | crates/core/src/browser/element_checks.rs:1983-1988 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/element_checks.rs:1961\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"31632f72770b1295e84539cf837324c0fc57be8b178eba7c1254e1515f5d32dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/live/src/live_accept.rs:185-190 | crates/live/src/live_insert.rs:90-95 | crates/live/src/live_wrap.rs:62-67 \u2014 before extracting anything, compare \u0060crates/live/src/live_insert.rs\u0060 and \u0060crates/live/src/live_wrap.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/live/src/live_insert.rs:98\u0060 calls \u0060parse_count\u0060, \u0060arg_val\u0060, \u0060as_deref\u0060 and \u0060crates/live/src/live_accept.rs:193\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"27524a9ec2a5a9c84c753f5b1cab425fa67e2c91cbda3516444aade6a0413c92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/browser/src/cdp.rs:2197-2201 | crates/browser/src/lib.rs:521-526 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/lib.rs:521\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03b169998d74ca05d07d01551343d8354c2340c7f15e05b0c800054b9816666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/src/font_render.rs:56-64 | crates/comp-verbs/src/build_phase.rs:1141-1149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/src/font_render.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/font_render.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b697a6d28cefc0306fdb4ac779a0fc92e32b114ea6b4237ef2e7fe5776c06282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/comp-verbs/src/comp_diff.rs:467-474 | crates/comp-verbs/src/comp_diff.rs:522-529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/comp-verbs/src/comp_diff.rs:465\u0060 calls \u0060min\u0060 and \u0060crates/comp-verbs/src/comp_diff.rs:520\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeea79dadb81d9b43501a3e83f70d4719b6317c40f6b7e74c4cb755e816a3889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/comp-verbs/src/font_match.rs:574-580 | crates/comp-verbs/src/font_match.rs:709-715 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/font_match.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1a4d8ee1aec3dd496e4834fcc711cd153e1c27901f8859043227c99da9f3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/background.rs:275-280 | crates/html/src/background.rs:341-346 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/background.rs:275\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"701027f33d099b383facc06beabd1e9bd1cc4ffaaaeb8a1e16296c30e151c1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/driver.rs:331-336 | crates/detect/src/design_system.rs:1603-1608 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e86dbe2c4fa4a70c934392f9fb3b109938d69a23e3decaeb9166ca0de4f468c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/page_checks.rs:4321-4326 | crates/core/src/browser/quality.rs:823-828 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4321}}}],"partialFingerprints":{"codehealthFindingId/v1":"209bd2f91b6439e5eec3548cfed4edf85c9c4bccbeee7fd0eecc9cf0fd422f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/painted.rs:1914-1920 | crates/core/src/browser/painted.rs:2385-2391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/painted.rs:1914\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"016dbbf2084c4fd3a0a1ce2aaab76f79d8a1e149a1d231e6445311b54ad2ffd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/painted.rs:2140-2145 | crates/core/src/browser/painted.rs:2982-2987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/painted.rs:2140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dff7442c47eb0a60602351250c0fa5ef2cdbfb42dea201008a11c999d70635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/quality.rs:1022-1027 | crates/core/src/browser/quality.rs:1731-1736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f57a6ce8b53cfaf6ffae0bf5bfd6d526067c98fb746e3356d10a68cc5d54d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/core/src/checks/css_scan.rs:2039-2046 | crates/core/src/checks/css_scan.rs:2080-2087 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/checks/css_scan.rs:2039\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc4a05d4f8ac695a4a36257375db91670e2a4e4774597d34e5ad3cc7cb4bdd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/detect/src/regex_matchers.rs:683-695 | crates/detect/src/regex_matchers.rs:1220-1231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/regex_matchers.rs:683\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd3032591fb5f32b3cd7f622192623e31a28c8002cf4495aef22fabee03105e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hook/src/hook_lib.rs:2068-2073 | crates/hook/src/hook_lib.rs:2172-2177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"261e42bd40ab000f899c2f723e388c8d3c756c044bdd3cb9d012e4da5a146229"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/inject/sveltekit.rs:126-131 | crates/live/src/inject/tanstack.rs:116-121 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/inject/sveltekit.rs:126\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/sveltekit.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8606fd7a3549c3bb513ce1ec552d7aaa7ac5e5a21ac063440368df98091da815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/live_generate.rs:443-448 | crates/live/src/live_poll.rs:697-702 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/live/src/live_poll.rs:696\u0060 calls \u0060run\u0060 and \u0060crates/live/src/live_generate.rs:442\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7b1b39896ccb651b47496106267caf1259a7f07d3edac396f6d889c47658c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/live_generate.rs:572-577 | crates/live/src/live_generate.rs:655-660 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_generate.rs:572\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b8b245c90e27dae9044bced0b8232c9befc7eff3fde165f8ea2688016ed46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/live_inject.rs:135-140 | crates/live/src/live_inject.rs:247-252 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_inject.rs:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_inject.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f1a7ca7c2d3071ca07e6226a5d069121ee151bbf72f267c23c10617799640b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/live/src/manual_edits/apply.rs:681-687 | crates/live/src/manual_edits/apply.rs:1559-1565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89d7c4c76c0c1b184cb45d2c145cc3f7505f78ad8223bdc17d4e30792de4529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/session.rs:797-802 | crates/live/src/session.rs:869-874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffddc7b5eee802fac866ed71e5ec3cf15c2072cbb5f96959607840d4fbc9b07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/skills/src/bundle.rs:758-763 | crates/skills/src/bundle.rs:826-831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skills/src/bundle.rs:758\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/skills/src/bundle.rs:832\u0060 calls \u0060is_file\u0060, \u0060join\u0060 and \u0060crates/skills/src/bundle.rs:764\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"05724a9e84ed831f2021532c561f47c5f0cc8e586ce13905b76a7248aa585ebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/skills/src/prompt.rs:157-163 | crates/skills/src/prompt.rs:250-256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skills/src/prompt.rs:157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/prompt.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fa7354e2ec08b574f980042c9bfba0bedd818bbfa672deed2dd5677c373313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/live/src/live_generate.rs:571-576 | crates/live/src/live_generate.rs:654-659 | crates/live/src/live_generate.rs:672-677 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_generate.rs:571\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/live/src/live_generate.rs:678\u0060 calls \u0060sleep\u0060, \u0060from_millis\u0060 and \u0060crates/live/src/live_generate.rs:660\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"483abe3cb664c5d51a56dc8bb7c75915991bad94fc024dad2d3f3ca593bb334e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/live/src/svelte_ast.rs:557-563 | crates/live/src/svelte_ast.rs:1213-1219 | crates/live/src/svelte_ast.rs:1454-1460 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/live/src/svelte_ast.rs:1453\u0060 calls \u0060visit_expr\u0060, \u0060get\u0060 and \u0060crates/live/src/svelte_ast.rs:556\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_ast.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"c026b8e383521110c4152bc5c55b8f1225e4fe109546c82b543f7ea937d64029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/browser/src/screenshot_contrast.rs:692-699 | crates/live/src/inject/detect_utils.rs:32-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/screenshot_contrast.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"033f4916718b90fb989fe536d8db7f64583e007186ca0545ca63e410a1f67212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): crates/comp-verbs/src/build_phase.rs:1283-1288 | crates/comp-verbs/src/build_phase.rs:2703-2705 | crates/comp-verbs/src/build_phase.rs:2720-2724 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/comp-verbs/src/build_phase.rs:1283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"94670b170761bc89333b67c7e7ab5de5201579044f22602f7930b498d42fd3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/comp/src/font_fingerprint.rs:600-604 | crates/comp/src/font_fingerprint.rs:609-613 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/comp/src/font_fingerprint.rs:600\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef22a1bdd9d4b3bc15bc1af9eaed6026ec1deb04856342a7ca88e0caabbdeea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/concept_seed.rs:168-172 | crates/context/src/context_cli.rs:691-695 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1158513637fe186927a5acf88990b8cca27167905a996cf1291c4ec6b6de10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/serve_question.rs:243-247 | crates/context/src/serve_question.rs:264-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/serve_question.rs:243\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ceb2074e0bae7f032b363f88542f9818e0e343d3b9e6e8d12543c22c2101820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/element_checks.rs:2539-2545 | crates/core/src/browser/painted.rs:171-177 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"549f7dc08e9a5736723f3626dc23b540b190af0a551ec5717c70d06b69a3c0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/page_checks.rs:2699-2704 | crates/core/src/browser/page_checks.rs:2965-2970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/page_checks.rs:2699\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2699}}}],"partialFingerprints":{"codehealthFindingId/v1":"56310eddc27b28f023d60bd73e06e8db75e5a0687374dd998262babfb2315e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/browser/painted.rs:1239-1247 | crates/core/src/checks/text_context.rs:212-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/painted.rs:1239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6754200990cb0cae733094a211c26604f0c4d0311986afc68ec3dd38052446"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/browser/text_collectors.rs:1036-1040 | crates/html/src/page.rs:599-603 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/text_collectors.rs:1036\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31c0e27deeb5c7e40d5cec0c54d7dd5ec8e832d5783b55d9823b9a25264753b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/text_layers.rs:946-952 | crates/core/src/browser/text_layers.rs:1035-1041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"03940df28bf97547fb480e345c4060537ab72fcf080e32948d7da574280e7ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/checks/rules.rs:1888-1892 | crates/core/src/checks/text_rules.rs:138-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/checks/rules.rs:1888\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"19bfd6ccea11f4beb67dd6098c8959937e4953b0e9cfb4bbf1f374becf8390d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/checks/vectors_b.rs:66-71 | crates/foundation/src/vectors/checks_b.rs:107-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/checks/vectors_b.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_b.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"83697f1b5aa17f9612fc9536b30d3deecb0c8161b8356aba16b00d53429bbf35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/foundation/src/fdlibm_trig.rs:307-313 | crates/foundation/src/fdlibm_trig.rs:314-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/fdlibm_trig.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"850fd463612e6f83d2323ba869bb70e038b6513954705127566c92e8a3c9e08b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hook/src/hook_lib.rs:2062-2067 | crates/hook/src/hook_lib.rs:2157-2162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"72097f37a494b632f0b695aef4e7bcbb34b2eb475265c2f1ce2d5101bdb59296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/html/src/cascade/shorthand.rs:146-150 | crates/html/src/cascade/shorthand.rs:178-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/cascade/shorthand.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/shorthand.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"467023d02b672b6d08e3e46e1d8060a1a2b877ca6a61f063b630765c700070dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/html/src/cascade/shorthand.rs:302-307 | crates/html/src/cascade/shorthand.rs:345-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/shorthand.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ea4c5cc156d80bc4e28892a705a46b8df77f23faad7bbded2bda49b4790c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/html/src/engine.rs:283-287 | crates/html/src/engine.rs:341-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/engine.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/engine.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b130bd024492f937b630f1472cc3bc6ca87896024519f9a73623715327af1278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/live/src/live_accept.rs:1280-1284 | crates/live/src/svelte_component.rs:104-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_accept.rs:1280\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f2a830878b874f844458a284cd32de349fc9cb31c7f031abb4d77a23416b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): crates/live/src/manual_edits/commit.rs:772-776 | crates/live/src/manual_edits/commit.rs:1034-1036 | crates/live/src/manual_edits/commit.rs:1085-1089 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/commit.rs:772\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbca76438a3dcecd4a17d4ef36fb85de90a1f1ad272bd46e5ddb7c03d5d9b3ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/skills/src/commands.rs:972-978 | crates/skills/src/commands.rs:1031-1037 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd60b70c3452dbaf2a41f7292e2941df2785ccc6f612b1b86def9e800fea1db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/skills/src/hook_manifest.rs:456-460 | crates/skills/src/hook_manifest.rs:498-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skills/src/hook_manifest.rs:456\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"326207d3001f2cda89495faeb63faa8095e1001f6b52a69daa019432c6d50cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/browser/src/html_snapshot.rs:371-377 | crates/cli/src/capture_snapshot.rs:471-477 \u2014 before extracting anything, compare \u0060crates/browser/src/html_snapshot.rs\u0060 and \u0060crates/cli/src/capture_snapshot.rs\u0060 as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 223 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/browser/src/html_snapshot.rs:379\u0060 calls \u0060from_secs\u0060 and \u0060crates/cli/src/capture_snapshot.rs:479\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"485897374b904633c0b80ad6410878047c1be18fc5f99aee94c869d4d324ca69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/context/src/concept_seed.rs:334-340 | crates/context/src/serve_question.rs:1225-1231 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1990c89d75fb50213700331286e45b7069ed3f8c43c18b7e98d76efec57c3d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/context/src/context.rs:35-43 | crates/detect/src/design_system.rs:156-164 | crates/live/src/roots.rs:64-72 \u2014 before extracting anything, compare \u0060crates/context/src/context.rs\u0060 and \u0060crates/detect/src/design_system.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca66d0b6b54b943b457b1b8a082fc9cdb3b171c46b73bd17836d457e5b1ec26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/background.rs:100-106 | crates/html/src/background.rs:194-200 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"506e258db9a6ed2db960e9eebf438e6a208f283ecb9d2d5b08ad51749d2b379d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/core/src/browser/element_checks.rs:290-298 | crates/core/src/browser/text_collectors.rs:630-638 | crates/html/src/adapters.rs:63-71 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060v\u0060 to \u0060Vec\u003Cmeasures::Finding\u003E\u0060 in one and \u0060Vec\u003Ccrate::checks::measures::Finding\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6975975a5ad690a6f765db33950a3e7c79b9db07e7570b9e14ea9c0e67aa6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/core/src/browser/element_checks.rs:1433-1441 | crates/core/src/browser/visual.rs:492-500 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2613d0dae661f2a922f25ec5f8e019746565370de113f3384876c9c1aa6cf89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/text_collectors.rs:168-173 | crates/html/src/adapters.rs:183-188 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a95da7ec90f22fd9f2896bb1d4774cae920059f73dd4403cc7e18e33d9d817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/core/src/checks/css_scan.rs:2608-2620 | crates/detect/src/detect_text.rs:852-857 | crates/foundation/src/js.rs:12-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":2608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f17905170a1cd54ae3f73128f9591252c50abdcaf02bf991fb7b5cd6ecc8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/core/src/checks/vectors_a.rs:70-81 | crates/core/src/checks/vectors_a.rs:83-97 | crates/core/src/checks/vectors_b.rs:51-63 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060hits\u0060 to \u0060\u0026[RuleHit]\u0060 in one and \u0060\u0026[IndexedHit]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_a.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d91bbaaa24b248e8c008d8d3dfdbdde987421a83653ad6907bf5ec8d1c4afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/detect/src/config.rs:223-231 | crates/hook/src/admin.rs:244-252 | crates/hook/src/hook_lib.rs:468-476 | crates/skills/src/providers.rs:561-569 \u2014 before extracting anything, compare \u0060crates/detect/src/config.rs\u0060 and \u0060crates/hook/src/hook_lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060values\u0060 to \u0060Vec\u003CString\u003E\u0060 in one and \u0060impl IntoIterator\u003CItem = String\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60b9e342785d3fc40db46be5daf88b44e101fa7453345cc816eccb0eeb8159c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/detect/src/config.rs:1066-1071 | crates/hook/src/hook_lib.rs:1246-1251 \u2014 before extracting anything, compare \u0060crates/detect/src/config.rs\u0060 and \u0060crates/hook/src/hook_lib.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/config.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaeb757ba1b0bda0ca2fdc3fabf2abf8fccc8c88b766866e1f54155e02d4f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/detect/src/ignores.rs:96-105 | crates/hook/src/admin.rs:987-996 \u2014 before extracting anything, compare \u0060crates/detect/src/ignores.rs\u0060 and \u0060crates/hook/src/admin.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62f2b0788a04ff75b455653d35f29560bcbc19e96b7ec307fd393d59e7c33dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/foundation/src/vectors/checks_a.rs:25-30 | crates/foundation/src/vectors/checks_b.rs:23-28 | crates/html/src/cascade/vectors.rs:47-52 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/checks_a.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1d026aad25315702a14f1caa251509ff7a32573876c82f575c323455a3ed00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/foundation/src/vectors/mod.rs:179-189 | crates/html/src/cascade/vectors.rs:139-149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/vectors/mod.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66393833cd3883b6ae5d4447c0bc81a20d0ad986bc30aba632e0fd9da722107"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hook/src/before_edit.rs:664-670 | crates/hook/src/hook.rs:27-33 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f53f20b5c05e406fce361d034bdfe3c1453ebabf19ec336c1c2884237ed0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/manual_edits/commit.rs:132-137 | crates/live/src/manual_edits/evidence.rs:299-304 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"27caa7eb10dd431a85d0fc9f7fa2fe557211f74aafca74f9f0c440079f326a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/live/src/manual_edits/evidence.rs:603-607 | crates/skills/src/util.rs:94-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/evidence.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"618a3074cb32ea8e58e318762577e276b89450ce6abec6b8308b141eac4f585f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/live/src/manual_edits/mod.rs:29-39 | crates/live/src/source_search.rs:129-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa816826b9357acf1b8640b93d187d73b6dd552b8bdf8c113311caf6f09d72d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/account/src/session.rs:37-42 | crates/skills/src/util.rs:52-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/session.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e98cdc43f2b9439c6d7f22eceb7a0e98a66196fa7a6022c8ee828dfeca914d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hook/src/util.rs:46-51 | crates/wasm/src/exports_pure.rs:153-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/util.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"488aed6f61e2c46537045ef007a00c938f0e88a7b12f7d8c5b57d85f59d887f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): crates/live/src/live_accept.rs:92-98 | crates/live/src/live_complete.rs:63-69 | crates/live/src/live_inject.rs:35-41 | crates/live/src/live_insert.rs:77-83 | crates/live/src/live_resume.rs:260-266 | crates/live/src/live_wrap.rs:49-55 \u2014 before extracting anything, compare \u0060crates/live/src/live_insert.rs\u0060 and \u0060crates/live/src/live_wrap.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaadd14bdf0d977857df9f024263285854cbcefe0112979bade391984538eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/account/src/critiques.rs:156-170 | crates/account/src/design.rs:132-146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/account/src/critiques.rs:156\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/critiques.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8868d3d3a10e87795548e16bded5814aecc9931d442af94f9f546dd15e9edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/agents/src/lib.rs:460-472 | crates/agents/src/lib.rs:483-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/agents/src/lib.rs:460\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/lib.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53dfb8dcec05ee7dbdccc7d9164c6efeb6f4ece34d456a1dff1ca86c34f3aab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/live/src/live_commit_manual_edits.rs:26-35 | crates/live/src/live_discard_manual_edits.rs:14-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_commit_manual_edits.rs:26\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_commit_manual_edits.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f18c1bf6db2679c86be0285b69a4cdc6b4a17cb7a81efbb521ea5ce8373add9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/live/src/live_insert.rs:261-268 | crates/live/src/live_wrap.rs:428-437 \u2014 before extracting anything, compare \u0060crates/live/src/live_insert.rs\u0060 and \u0060crates/live/src/live_wrap.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/live_wrap.rs:428\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a3b1fb56b584aadcf9c093c6e9d758eef8370dcfff4fa37ed33953ddb699f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/account/src/store.rs:404-410 | crates/cli/src/loop_connect.rs:692-701 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/account/src/store.rs:404\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/store.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec344223522f2d8f81d507c9334030b6e265a5b41f987f273488c63d447a75f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/browser/src/cdp.rs:239-248 | crates/browser/src/cdp.rs:256-264 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/cdp.rs:239\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbaac726a87d83dd4ed2378d19f4dd9257ebb848f72f2a562c787e738829384"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/live/src/config.rs:23-31 | crates/live/src/config.rs:34-42 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/config.rs:23\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/config.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"448cf79bc7fe5d8da84566313417942a40e582cfb38711adc732e5ee38ad532a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/live/src/json_error.rs:97-105 | crates/live/src/json_error.rs:112-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/json_error.rs:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/live/src/json_error.rs:94\u0060 calls \u0060peek\u0060, \u0060Some\u0060 and \u0060crates/live/src/json_error.rs:110\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/json_error.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea97a7849b1c8abbf7e523a2a28eb899d432b0928b9a216339526bccde53c31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/live/src/manual_edits/apply.rs:183-191 | crates/live/src/manual_edits/apply.rs:214-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/apply.rs:183\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19d8d91a2af7f74d6d67673b88f2c3153b5961b91b931e61ccaa2ead45d850e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/live/src/manual_edits/apply.rs:792-799 | crates/live/src/manual_edits/apply.rs:801-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/live/src/manual_edits/apply.rs:792\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"a073987192645dcfa1c35c87a8c766d72c1ef4ea575de5c2d59326a8cc6cf077"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/hook/src/hook_lib.rs:987-991 | crates/hook/src/hook_lib.rs:1003-1010 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fc7f2062674c7a6b7f96ae82e6037a97cbebab8c53d1921b68151a55807fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/agents/src/fs_writer.rs:62-69 | crates/agents/src/lib.rs:409-416 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/agents/src/fs_writer.rs:62\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/fs_writer.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36e502d1ad40c37b5e2d5c7dfda170ebb466e570dbf1d439289ab28b61fd1a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/detect/src/design_system.rs:832-839 | crates/detect/src/design_system.rs:1041-1048 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/design_system.rs:832\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95a44e0a3f1be4fc46167bcd1785b0fdd2dab1d0bf6e4ff2fc925b13a7836c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/hook/src/admin.rs:911-917 | crates/hook/src/admin.rs:966-972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ea796456d0c2425d5735622277cc561152f11d1d50eed0d51b44f19cc0b6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/comp-verbs/src/util.rs:127-133 | crates/context/src/util.rs:198-204 | crates/detect/src/ignores.rs:348-354 \u2014 before extracting anything, compare \u0060crates/context/src/util.rs\u0060 and \u0060crates/detect/src/ignores.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/comp-verbs/src/util.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/util.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a091691c8ef297ffc9f331cd9c12ea56d995ae086cdb7a323d1cc056eb59353c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/checks/html_patterns.rs:909-915 | crates/core/src/checks/html_patterns.rs:917-923 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/core/src/checks/html_patterns.rs:916\u0060 calls \u0060scan_css_text_for_radial_halo_with\u0060 and \u0060crates/core/src/checks/html_patterns.rs:926\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6bd99c0f6676fe082f35fb9b68a6c7dc44fbc9bc4cba5ddb7204aa809f48b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/browser/visual.rs:3279-3285 | crates/core/src/browser/visual.rs:3336-3342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":3279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67d32a08ba1928c02986efb331cc0e93e807e694e1ceb55cc2a0201b61bff53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/browser/element_checks.rs:1956-1960 | crates/core/src/browser/element_checks.rs:1965-1971 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/element_checks.rs:1956\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b5aa18e43bb1d67d330ef96b5ae886fbde4d0f21590c83a8569f1ac8e034cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/hook/src/admin.rs:314-319 | crates/hook/src/admin.rs:322-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/hook/src/admin.rs:314\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a34b9578b699424fce8fd1826e72d9ff5b3956bfcf7bb09813099ebcbd54a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/manual_edits/apply.rs:169-174 | crates/live/src/manual_edits/apply.rs:674-679 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/apply.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c966e34b66b84f90b8747f23c795027b4b38cab39366e06f9feee0bacdd2e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/account/src/critiques.rs:229-233 | crates/account/src/setup.rs:303-307 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/account/src/critiques.rs:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/critiques.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c65a09340e8fffba9b7bcb42bc15a5c0d6de64cabce4ae0999b865b36865311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/comp-verbs/src/build_phase.rs:1584-1588 | crates/comp-verbs/src/build_phase.rs:2466-2470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbd50de7a7c5b27b682cb18651946b63c6282efc23522190af1680e94009bc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/context_cli.rs:710-714 | crates/context/src/staleness_notice.rs:76-80 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/context_cli.rs:710\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac99f84d2b9a2fcfd855536f2e2e0dc53e8cd1826cab678e8461c5fff5e45ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/skills/src/commands.rs:986-991 | crates/skills/src/commands.rs:1042-1047 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41d5ef016695cbb43569e32418ad3474ab925d5c651aadbe7a6a15e2a307a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/catalog.rs:279-283 | crates/context/src/catalog.rs:304-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/catalog.rs:279\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/catalog.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d94dee33c915603c8bdd0ea4ff3ddb52591bbfa4f56d7bf5417cc7d15ce013"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/html/src/decorative_text.rs:51-55 | crates/html/src/decorative_text.rs:57-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/html/src/decorative_text.rs:51\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/decorative_text.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bc80e3e4f675deaf717022c4c73f76a8a74143518bb8b3594212d5f181e148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/live/src/copy_edit_agent.rs:673-677 | crates/live/src/copy_edit_agent.rs:789-793 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/live/src/copy_edit_agent.rs:786\u0060 calls \u0060insert\u0060, \u0060into\u0060, \u0060normalize_batch_number\u0060 and \u0060crates/live/src/copy_edit_agent.rs:672\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/copy_edit_agent.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28b11752dbdb0dd3786e0044a6444b4e29e7363a21a9dfe37393689f897eb40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/browser/src/consent.rs:992-996 | crates/browser/src/overlays.rs:631-635 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/consent.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82a2c1760a098c654729a582a222b54df15c84da4df64573f70131339330edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/browser/src/fullpage.rs:990-994 | crates/browser/src/fullpage.rs:1025-1029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"250010a5383b7c908a5dd28fbd0ed1acfe7446491a5143d6ef38de04483b6ece"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/browser/src/lib.rs:2394-2400 | crates/live/src/event_validation.rs:18-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/browser/src/lib.rs:2394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4b010eedb91cd0dcbac81b681132990a431a029229c937586582cf22e5175d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/comp-verbs/src/util.rs:141-151 | crates/context/src/util.rs:216-226 | crates/detect/src/ignores.rs:366-376 \u2014 before extracting anything, compare \u0060crates/context/src/util.rs\u0060 and \u0060crates/detect/src/ignores.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/util.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58b729851504cca87b0e94045b4d3f786c9eebf86b951c6801f928285e429e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/comp/src/font_fingerprint.rs:1067-1071 | crates/comp/src/font_fingerprint.rs:1086-1090 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/comp/src/font_fingerprint.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/font_fingerprint.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7c20a685cc11bfee5367dcf68436e093831a6f8816363fc80230f4ceb33238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/catalog.rs:222-226 | crates/context/src/catalog.rs:517-521 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/catalog.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e47aeb8662cfd5f203255acc662479e9b4709208930ecc516e6893d7bd23d22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/critique_storage.rs:118-122 | crates/context/src/surface_briefs.rs:177-181 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/context/src/critique_storage.rs:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0128dca29ef89da2169c3aea9dd9d9b55f707326b1d4d52f09c5f1c413f924c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/critique_storage.rs:438-442 | crates/context/src/critique_storage.rs:451-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 \u0060crates/context/src/critique_storage.rs:438\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5579a3c67d8b17324871474ad4cb2d990f1b73652c88194c529fb736ffafedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/serve_question.rs:1399-1403 | crates/context/src/serve_question.rs:1419-1423 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"2100e5ae9115ec2066e018b167d4296f214419156294694a9ffae85b8350a64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/context/src/util.rs:178-182 | crates/detect/src/design_system.rs:1130-1134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1a3d199077e2295c849a35961b6340d6bb4c50d15f7ed11a5bb48090cc171b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/browser/page_checks.rs:472-476 | crates/core/src/browser/page_checks.rs:491-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/core/src/browser/page_checks.rs:481\u0060 calls \u0060card_edge_sides\u0060, \u0060fill_differs_from_surface\u0060, \u0060shows_border_or_shadow\u0060 and \u0060crates/core/src/browser/page_checks.rs:471\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba20ce1f69a4d20bef57d6aee05baba02d202c6c14bfa168c662a62f7a341cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/core/src/browser/text_layers.rs:939-945 | crates/core/src/browser/text_layers.rs:1012-1018 | crates/core/src/browser/text_layers.rs:1240-1246 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"206ff14e7d40b84897826ff8ac121224e8d12460747651517d8a5a590564b0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/browser/visual.rs:1270-1274 | crates/core/src/browser/visual.rs:2099-2103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"44250e708572e57432c0a721eeb6da992bed3cc99b57f472e73ddce6601681c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/browser/visual.rs:3720-3725 | crates/core/src/browser/visual.rs:3747-3752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/browser/visual.rs:3720\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac2cf59217726fd191ca065b300bcd064ab5df760d705088c8677590f4b432f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/core/src/third_party.rs:201-205 | crates/core/src/third_party.rs:233-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/third_party.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/third_party.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"73574363e0f8c423f21ec849823f101ae08c28a9e17a6d7c992c9c5d59b147e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/detect/src/util.rs:68-72 | crates/live/src/accept_css.rs:467-471 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/detect/src/util.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":"crates/detect/src/util.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0703973f922559c16c2c497c97aa80bed7617eb074cc31fdfa5181b8ae6f9b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/foundation/src/color.rs:1054-1058 | crates/foundation/src/color.rs:1065-1069 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/color.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"666ef6602502572e7903fd4c0d11b83774f313c948a43a13dfda9a57fd65a666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/foundation/src/css/scan.rs:360-364 | crates/foundation/src/css/scan.rs:721-725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/foundation/src/css/scan.rs:360\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d505bf6734bfc8599ab60f819b91772023a0e5c85449ea10db93759623b97d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/live/src/live_accept.rs:667-671 | crates/live/src/live_accept.rs:868-872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c10660e36f891e6e60ec5bbe2ea572a7124f91e8bc1018d4b89fb402401df8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/live/src/live_inject.rs:162-166 | crates/live/src/live_inject.rs:310-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_inject.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"1feaa3bead70191636cfca28d18198ab7107074ccdecbb6cd96d69286a6cb79e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/live/src/live_insert.rs:308-313 | crates/live/src/live_wrap.rs:421-426 \u2014 before extracting anything, compare \u0060crates/live/src/live_insert.rs\u0060 and \u0060crates/live/src/live_wrap.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf9a5151113fd8bbdd8ad5aa0ed7d8552d63bb0f2c1aaf38ba7ac245c99c721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/live/src/live_server.rs:1611-1615 | crates/live/src/live_server.rs:1637-1641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f443de459e7d1a12ea997dead9bf56072d00f06094e1e7f66c8504dda2eb3fa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: impeccable-comp: impeccable-comp: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8c468f5889a46c6333ec08c18ad0d3779f0335933d2387fe76ac0e4b526cd87c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: impeccable-foundation: impeccable-foundation: abstractness 0.06, instability 0.00, distance 0.94 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f6373933ed464709f3d1e510d5cef56daf0b3110e01f8c06d568c4bfef3f56ca"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: impeccable-core: impeccable-core: abstractness 0.04, instability 0.10, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5040e88d72806c959ab04cdedf76fdb7d5e96c0db86c484eba184823bdcb10e3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JsDom (LCOM4 19): JsDom\u0027s methods fall into 19 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 19 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/js_dom.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02596fd95c20378a2d3caddb8874f4bf4d218151f6f7230e711a324567dd292"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): skipped \u2014 ${PROVIDERS[provider].envKey} is unset: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-workflow/full-build.test.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa41baedf97d9c2444e92d83c55d15fb9edca2e7f4957d11a4ed1f338483fb16"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): skipped \u2014 ${ENGINE_MISSING_MESSAGE}: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-workflow/full-build.test.mjs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced7f97c29b9475277b39ac48f387a7e5fff7974ba862f5f84d32cb2687fb398"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): skipped, ${PROVIDERS[provider].envKey} is unset: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/activation.eval.mjs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"30eeb2920f729e533ca919c9def57b7692d2ecee765fdfbf813fd9df85be561f"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): skipped \u2014 ${PROVIDERS[provider].envKey} is unset: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/scenarios.test.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c474e7b76cd48ee27cc6c827af8c6b16f7e80dfa2c3650d85495050982e0c80b"}},{"ruleId":"D10","level":"error","message":{"text":"No assertions (empty test): skipped \u2014 ${ENGINE_MISSING_MESSAGE}: Test method has an empty body \u2014 it asserts nothing and exercises no code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/scenarios.test.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5067f6d561735c7af517b62c43ecee72a0c4900c234c4a9134022baf4cd9bb"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: ends a stubborn child without awaiting anything: This test starts work it did not wait for (\u0060running\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 250))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/process-group.test.mjs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"41995d5cab2f0ee02907ba9ee93fd7afc6e45fb4b624c81267f758346e49fde9"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: a second signal kills the group instead of abandoning the escalation: This test starts work it did not wait for (\u0060running\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 250))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/process-group.test.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e199bd6f17e486194e8912e447bd7b5bb0dc859594809bd841c5bd48327545"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: onExit still reaches a group a shutdown is in the middle of stopping: This test starts work it did not wait for (\u0060running\u0060, still running when the sleep starts) and then orders itself against it with \u0060new Promise((r) =\u003E setTimeout(r, 250))\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/process-group.test.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4656242608a81a20ebd1c87b715be87e8fdced2bea6d580bcd35aa20684a9552"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/quality.rs: crates/core/src/browser/quality.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 207 in impeccable_core::browser::quality::check_quality at line 2187. 4 of those changes were fix/bug commits, and the other 56 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/quality.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/quality.rs"},"region":{"startLine":2187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c82c8eeacd26bb0261a76f0a343ca2e4bbe436f50d487d5123fbc0310c1ede4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/element_checks.rs: crates/core/src/browser/element_checks.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 109 in impeccable_core::browser::element_checks::check_element_colors_dom_in at line 2650. 6 of those changes were fix/bug commits, and the other 82 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/element_checks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2650}}}],"partialFingerprints":{"codehealthFindingId/v1":"7180862efa04f00eb2cbee91fb4da060b95b1ef9c4cb71bad97764f15dbfd76c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/page_checks.rs: crates/core/src/browser/page_checks.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 143 in impeccable_core::browser::page_checks::check_text_occlusion_dom at line 4808. 3 of those changes were fix/bug commits, and the other 50 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/page_checks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4808}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cf94255de792d02a1626fae4cceae6f3f5f8c41564926078805100b83af3ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skill/scripts/live-browser.js: skill/scripts/live-browser.js changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in live-browser.connectSSE at line 7806. 20 of those changes were fix/bug commits, and the other 29 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- skill/scripts/live-browser.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7806}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da0d72eb5bae57be8e9a8a28a32968d738b31a3e3ce851be15e95524bbb5f3a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/quality.rs: crates/html/src/quality.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in impeccable_html::quality::check_quality at line 695. 5 of those changes were fix/bug commits, and the other 27 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/html/src/quality.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/quality.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"42680f5631e08baba6201714e992080f17f58c30bfce371400fb8788f6e28614"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/serve_question.rs: crates/context/src/serve_question.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 162 in impeccable_context::serve_question::run at line 1274. 4 of those changes were fix/bug commits, and the other 13 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/serve_question.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c0ec1b46762d52474458666a2bbf80ea33ca80781dd630d921c803a1a047e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/detect/src/regex_matchers.rs: crates/detect/src/regex_matchers.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in impeccable_detect::regex_matchers::scan_markup_context at line 2065. 9 of those changes were fix/bug commits, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/detect/src/regex_matchers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/regex_matchers.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c139354542dcbb62729ade052761359a9d36ba2422be18d7aaa02a9c09fe8b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/driver.rs: crates/core/src/browser/driver.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in impeccable_core::browser::driver::collect_browser_findings at line 2904. 6 of those changes were fix/bug commits, and the other 46 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/driver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96d472749c0fe658397963170469beff35cadcb07ed1a5bfbc7a0e47703379b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/comp-verbs/src/build_phase.rs: crates/comp-verbs/src/build_phase.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in impeccable_comp_verbs::build_phase::gate_hero_inner at line 1786. 6 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-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/comp-verbs/src/build_phase.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":1786}}}],"partialFingerprints":{"codehealthFindingId/v1":"9318dcee1d97dda7580c50ba09ee21e3df0af7f4b44302b3b497de12a60cab08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/adapters.rs: crates/html/src/adapters.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in impeccable_html::adapters::check_element_colors at line 1028. 5 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/html/src/adapters.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/adapters.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f3f308de261690b61e03e7814a201102115b51223ea53ab22d481c74cd3e04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/browser/src/lib.rs: crates/browser/src/lib.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in impeccable_browser::scan_loaded at line 1187. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/browser/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/lib.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb126698d0199ed143111f2cedf7328d989fc359db47aec5330d70e9afc6b4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/painted.rs: crates/core/src/browser/painted.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in impeccable_core::browser::painted::unpainted_walk at line 655. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/painted.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"90747226013375c1f2307a846c7425656eb946fef6ff3dfd1dd048b2954522df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hook/src/hook.rs: crates/hook/src/hook.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in impeccable_hook::hook::run_hook at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/hook/src/hook.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3551fbed81370c33a87b85c58b1b63c449dd929143105008e43194b5aa50f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/detect/src/cli.rs: crates/detect/src/cli.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in impeccable_detect::cli::detect_cli at line 538. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/detect/src/cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d23f7c677589e47100062e25c47ad2bb43e1f3cf41725f060dcf1fdb20f00ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/checks/rules.rs: crates/core/src/checks/rules.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in impeccable_core::checks::rules::check_borders at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/checks/rules.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/rules.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbcd5125259ac919bc7cd62d15d7641fbf974c41df4a448f435ca99f2087014"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/visual.rs: crates/core/src/browser/visual.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in impeccable_core::browser::visual::collect_visual_contrast_reasons at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/visual.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3928ac02a21cf8d5edb879ce2a681f2a6db291dd614bb235044188a89d1218"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/engine.rs: crates/html/src/engine.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in impeccable_html::engine::detect_html_source at line 199. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/html/src/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/engine.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e311db094dff1462d2d54fb315f0bee330d16892639b8a272e65dd9665e86a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/checks/css_scan.rs: crates/core/src/checks/css_scan.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in impeccable_core::checks::css_scan::scan_css_text_for_pseudo_stripe at line 704. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/checks/css_scan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/css_scan.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"11dce5b7010864e2ba8950e7e5f258a4ea38fd81eb7ad4787586635c21cfc67f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/router.rs: crates/cli/src/router.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in impeccable::router::run at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/router.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/router.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e460810b5809cd6cbc8420fab9e865115b82edb96c8274f8c4dbbd6673a84ced"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/browser/src/cdp.rs: crates/browser/src/cdp.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in Page::on_event at line 988. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/browser/src/cdp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/cdp.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eaaea0abec2f256b9cce374eb995a21af41f2a88f2d745f95109b9978d942b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/detect/src/detect_text.rs: crates/detect/src/detect_text.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in impeccable_detect::detect_text::scan_inset_stripe_css at line 1270. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/detect/src/detect_text.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"2832ca0116a968dfdfb646702a80712cf449fad46702732061ef89598a9c1153"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/live_server.rs: crates/live/src/live_server.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in impeccable_live::live_server::handle_connection at line 622. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/live_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dee7f456e6ee4e6168ab12ac1959036e2094e46494b66ee32696fed64cde16"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browser-bundle/15-snapshot.js: browser-bundle/15-snapshot.js changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in 15-snapshot.__snapRunningAnimations at line 616. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- browser-bundle/15-snapshot.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb06d69bb494fa8669980019d5ff8e1815bac0a2440d4177a88d797b5a253caa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/build.js: scripts/build.js changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in build.build at line 752. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- scripts/build.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed75b9dce49716e4ae8ccc8817f6c5517ae8ae6979a149464898ec19380a57ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/context_cli.rs: crates/context/src/context_cli.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in impeccable_context::context_cli::run_with_hook_repair at line 794. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/context_cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context_cli.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9414e0a411b6cf09b4f5a8b5ab30bc71e004a4619f0cd66f493b99825154d9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/concept_seed.rs: crates/context/src/concept_seed.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in impeccable_context::concept_seed::render_roll at line 436. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/concept_seed.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/concept_seed.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e7bf1fe26bcbdb234defffe22b5072410495417d3233114e204dd8a2c12e69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/skills/src/commands.rs: crates/skills/src/commands.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in impeccable_skills::commands::install at line 648. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/skills/src/commands.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/commands.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a42fac0776b07b99ec0c59aed51b8cda50a7e095dcc6749c7771231023a5a45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/live_generate.rs: crates/live/src/live_generate.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in impeccable_live::live_generate::run at line 423. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/live_generate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_generate.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b0064a09277b6e69b09dc126b1194f51a0a116b31b0f2b1148c13d0675ecdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/checks/html_patterns.rs: crates/core/src/checks/html_patterns.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in impeccable_core::checks::html_patterns::check_html_patterns_picking at line 703. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/checks/html_patterns.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb20a99727c4ea37b485c63fef006d8afd39a15b0669cfe929e65c98a37144a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tests/live-e2e/agent.mjs: tests/live-e2e/agent.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in runAgentLoop at line 1921. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- tests/live-e2e/agent.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"817ee30670d66b861cfff2a9173e6f9365ec30306ba51d07247afdec4f439158"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/checks/vectors_a.rs: crates/core/src/checks/vectors_a.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in impeccable_core::checks::vectors_a::call at line 123. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/checks/vectors_a.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/vectors_a.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"2464b56e677afc740a2d34b98cd2302681b7d1d28ba5d438d7b9483653b2480b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/live_accept.rs: crates/live/src/live_accept.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in impeccable_live::live_accept::accept_cli at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/live_accept.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_accept.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"db44f4ecd59ac24c10594728cbb1e758a490caab92ec0faaaf457a5ea64f768f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hook/src/hook_lib.rs: crates/hook/src/hook_lib.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in impeccable_hook::hook_lib::resolve_harness at line 1918. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/hook/src/hook_lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_lib.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"571a387df511f1175647b2910cc0815eb5ba2c1d05f89bbacf081f9f490b0209"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/critique_storage.rs: crates/context/src/critique_storage.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in impeccable_context::critique_storage::run_with_saved at line 681. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/critique_storage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdd9563e2c6d0e72b24d1ee99ce5f9c00ffffc507ddcf67090f057b57f9901a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/lib/utils.js: scripts/lib/utils.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in utils.readSourceFiles at line 250. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- scripts/lib/utils.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/utils.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"29636decede691fa80f64322fb7639c20cb6c27be3bbcca2a7ed180cdd323e31"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/generate_image.rs: crates/context/src/generate_image.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in impeccable_context::generate_image::run_with_api_base at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/generate_image.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/generate_image.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"336c2c468319fecafcd0a70ce35ef8491070d018433564270c2b836955225d14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/checks/text_context.rs: crates/core/src/checks/text_context.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in impeccable_core::checks::text_context::fine_print at line 1382. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/checks/text_context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/text_context.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1482f7a97d720043c2fdc7601f5ffb136e426f2f8f02b2348cd6650c96ba309e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agents/src/resources.rs: crates/agents/src/resources.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in impeccable_agents::resources::apply at line 3. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/agents/src/resources.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/resources.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f68fd0018368adcce1592c9640bf09082b33f1f4f2710009dec546d71cc564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account/src/health.rs: crates/account/src/health.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in impeccable_account::health::run at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/account/src/health.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/health.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ecbab87b06ad8a51d2a224151fdb0e0bb2ca50dfbdb274bed3c83ca2be423c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/text_collectors.rs: crates/core/src/browser/text_collectors.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in impeccable_core::browser::text_collectors::collect_kicker_candidates_with_elements at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/text_collectors.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b1949faa41ca73d3c25df7a0e3e3ab99a5e0c195207eb2fc9c0f8e991c5cf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/browser/src/fullpage.rs: crates/browser/src/fullpage.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in impeccable_browser::fullpage::stitch at line 920. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/browser/src/fullpage.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"f499e4792c52332f6bae5ec19a08b258af1ad09307b57252b8846d87ba385c0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/skills/src/bundle.rs: crates/skills/src/bundle.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in impeccable_skills::bundle::download_file_capped at line 174. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/skills/src/bundle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/bundle.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e83ebca15ebcafbddcc29cc6a1c0e5c9b1c248ef3f1748cbf6afc36af672d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account/src/critiques.rs: crates/account/src/critiques.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in impeccable_account::critiques::after_save at line 91. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/account/src/critiques.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/critiques.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"726550cbe27e5584ccc0d88b3bb2f48df61a6dea75d8872342796c9a731a356d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account/src/design.rs: crates/account/src/design.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in impeccable_account::design::after_scan at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/account/src/design.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/design.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b816da42a880088a59785c7b3e53d6c31dd493ca1b0dcdfec0498d09ab0608"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/text_layers.rs: crates/core/src/browser/text_layers.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in impeccable_core::browser::text_layers::fill_covers_ranked at line 1078. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/text_layers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_layers.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc17619ce61dbe5dfcdf9973ab836453e18f3ebd7f1ab6d73e4336a631a18da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/browser/src/validity.rs: crates/browser/src/validity.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in impeccable_browser::validity::classify_with at line 388. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/browser/src/validity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/validity.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7ec5197f903276d992d03b4480e402eeff212324591a750a456e3d84274a0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/loop_connect.rs: crates/cli/src/loop_connect.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in impeccable::loop_connect::connect_one at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/loop_connect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_connect.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5781aa8226a3b81578e00ee5c2cb57d52690389a94f605c966779ab1f4f3ed73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/skills/src/hook_manifest.rs: crates/skills/src/hook_manifest.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in impeccable_skills::hook_manifest::copy_provider_hooks at line 638. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/skills/src/hook_manifest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/hook_manifest.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd953ce1754a10c6ffd1852faf8f005fe01bf284fd7922613b434da18702359"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/cascade/rules.rs: crates/html/src/cascade/rules.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in impeccable_html::cascade::rules::extra_specified_expansions at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/html/src/cascade/rules.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/cascade/rules.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c73bc2e233c8b3893c2a780898139b1152cd3c6ebdbde01dd49aea6289dcb12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/github/sheriff.mjs: scripts/github/sheriff.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in sheriff.evaluatePullRequest at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- scripts/github/sheriff.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github/sheriff.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd473dcca9abb92617596333f554760334a5d90940e072cc07b74d2436649db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/component_capture.rs: crates/cli/src/component_capture.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in NativeComponentCapturer::capture at line 212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/component_capture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_capture.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2263d3f938167140b174fd052ef5b61cbcb731fc08e5af78f582fc7407c03f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/page.rs: crates/html/src/page.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in impeccable_html::page::check_page_layout at line 436. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/html/src/page.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/page.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb618a5fd6fc408b77db87e1b8ff6396f27a857cb6fd2b272c5d831eadea53d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/loop_install.rs: crates/cli/src/loop_install.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in impeccable::loop_install::run_inner at line 288. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/loop_install.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/loop_install.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf561afae83cd12d872e6754f37ba7aad7a164e0c8401bbd9118b1a4a121f26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hook/src/admin.rs: crates/hook/src/admin.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in impeccable_hook::admin::repair_hook_manifests at line 573. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/hook/src/admin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"2555e64c02fa43d2ef299c7ca4c70dadfae3fbdbd4820662f43d71a79fe2910e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/html/src/background.rs: crates/html/src/background.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in impeccable_html::background::walk_surface at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/html/src/background.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/background.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf30dffc590ae0c440fe7e24a292ab381ca2320c4dc14bd931a3716a3c1466b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/session.rs: crates/live/src/session.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in impeccable_live::session::apply_event at line 432. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/session.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d661af7aee37ed6e039c8507cf8df0436352812cd6f8b1f690178fbe3ff5d50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agents/src/cli.rs: crates/agents/src/cli.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in impeccable_agents::cli::validate at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/agents/src/cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/cli.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d80e91b7784fbb789fa5f58f9fa8224c5dd4e10db897587e1e8974ff4b29b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account/src/lib.rs: crates/account/src/lib.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in impeccable_account::run_whoami at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/account/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/lib.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba76a908abe1c8ac8e5e699505813f5ffaa9adf008fec304f65a3ecba1b64fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/asset_capture.rs: crates/cli/src/asset_capture.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in CdpAssetRenderer::capture_batch at line 51. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/asset_capture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ce13b5f6ad7a8c1b3f28acdce3e05b548c4b8e8fad7120f7d2141f2b9b1dbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/live_boot.rs: crates/live/src/live_boot.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in impeccable_live::live_boot::run at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/live_boot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_boot.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29ae0dbc0618598d36e2746334367e82a6b07ad1340b35e8057e6231434cd86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tests/skill-behavior/harness.mjs: tests/skill-behavior/harness.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in runTurn at line 423. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- tests/skill-behavior/harness.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/harness.mjs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcd23770d8a413fdb2ce210082ecf73a873bbba720192bd698e4a31fd0f273b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/staleness_deep.rs: crates/context/src/staleness_deep.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in impeccable_context::staleness_deep::check_hook_installation at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/staleness_deep.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness_deep.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e29922a481214789137943e0715169b2f818ed58330ac80fe579a42f22b9329"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/checks/decorative_text.rs: crates/core/src/checks/decorative_text.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in impeccable_core::checks::decorative_text::classify_decorative_text at line 185. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/checks/decorative_text.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/decorative_text.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"152574b40e02bdc928b10201b7c1e85da9b22894c1eaf142096753b0f3dbd594"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/live_wrap.rs: crates/live/src/live_wrap.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in impeccable_live::live_wrap::wrap_cli at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/live_wrap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_wrap.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b867ee27a8dc288939625dc6b08e7aadf273588dfb4d316963b3162da0a691"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/release.mjs: scripts/release.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in release.releaseEngine at line 461. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- scripts/release.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release.mjs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0406d73bf60de44e8aa35ac216f7e9b37d2f80f2771ea169ffc55abb89b0974"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/bake.rs: crates/live/src/bake.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in impeccable_live::bake::compound_parts at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/bake.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/bake.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d754c384636e0cb1970e54381c618684f1f20154715d62b79c925c951bc54f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tests/live-e2e/session.mjs: tests/live-e2e/session.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in bootFixtureSession at line 330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- tests/live-e2e/session.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/session.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"756c4985a99ab0fa67fbae7e20f884e135fbed9406a0428a8bf7546a917f03a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/browser/background.rs: crates/core/src/browser/background.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in impeccable_core::browser::background::walk_surface at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/background.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/background.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cd983f9d457018c551f06f06649f8cb7ca5e5a20927f406aa7c5b19dc1a14e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/raster_coverage.js: crates/cli/src/raster_coverage.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in (anonymous) at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/raster_coverage.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/raster_coverage.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae99a891b6fbabdbfda9d75ec363de59236f9c1afa1ec3c4c8f0ec8bf3ce6927"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: extension/background/service-worker.js: extension/background/service-worker.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in service-worker.chrome.runtime.onMessage.addListener() at line 247. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- extension/background/service-worker.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aa39738a7a18d7fc0a186361a37091ce9cd66aa87f2fa7a395d749cc272512"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/capture_service.rs: crates/cli/src/capture_service.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in impeccable::capture_service::parse_capture at line 516. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/capture_service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/capture_service.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d622d42d227af1e5a5d1462e435573bbf9e44f34148823b2ee150aa4f54b48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/entry_capture.rs: crates/cli/src/entry_capture.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in CdpEntryRenderer::capture_at at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/entry_capture.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/entry_capture.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfbc0a30c62144b085e5bd51f68485e7910a9a328d2a70edc45f227a2ad6616"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/hook/src/before_edit.rs: crates/hook/src/before_edit.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in impeccable_hook::before_edit::main_flow at line 676. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/hook/src/before_edit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef28e54618e9491133c855bd09fa8baa1671b034133325691920e0919d45faef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skill/scripts/live-browser-dom.js: skill/scripts/live-browser-dom.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in live-browser-dom.createLiveBrowserDomHelpers.syncTopLayerHost at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- skill/scripts/live-browser-dom.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-dom.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3da14bb3722131f65bc600259d2fc1b22b8d2f464bc17932dd1f2862ea77bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skill/scripts/live-browser-ignores.js: skill/scripts/live-browser-ignores.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in live-browser-ignores.pageCandidates at line 122. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- skill/scripts/live-browser-ignores.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"561874b0b1ac8e4bbe9de45d66950b7b3b9db89ba296232a0ff396cbb237061c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/component_review/mod.rs: crates/context/src/component_review/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in impeccable_context::component_review::run_with_capturer at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/component_review/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/component_review/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"deace9f7450f41c3064e3319780a6de052a9f504a24834022dc531db2cd28659"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tests/live-e2e/agents/llm-agent.mjs: tests/live-e2e/agents/llm-agent.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in applyManualEdits at line 456. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- tests/live-e2e/agents/llm-agent.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"790e6773305bd3ef34f29ba4ad66c6716bd9f70999a027f385fd65d2a9788381"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/reviewed_entry.rs: crates/cli/src/reviewed_entry.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in impeccable::reviewed_entry::reference at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/cli/src/reviewed_entry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/reviewed_entry.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b80d5dedd1a49a777abfedc180793f3a5229673c2fd20f5ff6006d5a13a4cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/live_insert.rs: crates/live/src/live_insert.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in impeccable_live::live_insert::insert_cli at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/live_insert.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e408827809c59cd2c2abeed0d038fe4625aeb09b1bc3eae007772d87b0183e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/foundation/src/css/scan.rs: crates/foundation/src/css/scan.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in impeccable_foundation::css::scan::keyframes_move_or_resize at line 546. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/foundation/src/css/scan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/foundation/src/css/scan.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6af0045cc2943020baa0c17a4a256fbddfdfa83d0e7ac8ec8ec5de8743d4fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/detect/src/design_system.rs: crates/detect/src/design_system.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in impeccable_detect::design_system::split_top_level at line 929. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/detect/src/design_system.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/design_system.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee257343c07e7b61d305645a4f1a8542a6f9bbad3fc73a8c4c5825b997528791"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: extension/content/content-script.js: extension/content/content-script.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in content-script.runScan at line 220. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- extension/content/content-script.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"df40b907195ef624b6682b9391a356caf1ecddbb92dee44fec9c57ab7714881e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/agents/src/targets.rs: crates/agents/src/targets.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in impeccable_agents::targets::resource_matches at line 106. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/agents/src/targets.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/targets.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"20904db020ac6f47a187e78391c0c89358cd02204b863a3e0465bad4d697653a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/comp-verbs/src/comp_diff.rs: crates/comp-verbs/src/comp_diff.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in impeccable_comp_verbs::comp_diff::run at line 708. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/comp-verbs/src/comp_diff.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/comp_diff.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b1cffdd90bd7c9d7ddcb1877d37adadb05e75809400aa5adbd877a815ccd4e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: browser-bundle/40-overlay.js: browser-bundle/40-overlay.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in 40-overlay.createImpeccableOverlay at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- browser-bundle/40-overlay.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba1e53b155d5a4269decce7faab048565dfd158381ae1726a3afc3c19600e7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/roll_selection.rs: crates/context/src/roll_selection.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in impeccable_context::roll_selection::select_approved_challengers at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/roll_selection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/roll_selection.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ee1b3f4325d17d9b4740276c03fe486d7314361d7874dd0fc4eeee992c1d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/inject/tag_strategy.rs: crates/live/src/inject/tag_strategy.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in impeccable_live::inject::tag_strategy::read_reference at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/inject/tag_strategy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/inject/tag_strategy.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b8e3356710c937b3036f7c1e6c0e16541ab9dc418af46da699323cb8e7fa01"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/checks/row_stripe.rs: crates/core/src/checks/row_stripe.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in impeccable_core::checks::row_stripe::scan_css_text_for_row_stripe at line 524. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/checks/row_stripe.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/row_stripe.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a89d0eef7492f644e4bc5388ed3623aaf095345d8ed17d0d5a3437c08f7b6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/live/src/live_poll.rs: crates/live/src/live_poll.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in impeccable_live::live_poll::run at line 696. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/live/src/live_poll.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_poll.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a3e90c56c22b1c08915ca49e493771b33af41ad62eca5b3095501f74750d53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/context/src/surface_briefs.rs: crates/context/src/surface_briefs.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in impeccable_context::surface_briefs::resolve_surface_brief_from at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/surface_briefs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9029ed6c641cb951fd3219a1d186c03d61c3c99edd0b42da4fc2af4454e24b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/oracle/cases/detect.mjs: tests/oracle/cases/detect.mjs changed 15 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is (anonymous) at line 67), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix launcher probe exit status, \u0060**/\u0060 ignore boundaries, denied storage, and unsafe DESIGN.md links (#1116)\u201D; \u201CFix: ignoreFiles waives a linked stylesheet\u0027s page-level findings (#1087) (#1092)\u201D; \u201CFix: --version prints the installed skill\u0027s version (#1028) (#1032)\u201D; \u201CFix: say when detect scanned files with the regex engine only (#884) (#919)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- tests/oracle/cases/detect.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/cases/detect.mjs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e396d78acb63aa2e79928365793722d2618b985d162ea028684d2d0cd4fd08a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/context/src/http.rs: crates/context/src/http.rs changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is impeccable_context::http::bypasses_proxy at line 100), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: proxy tests clear NO_PROXY; IP hosts skip name suffixes\u201D; \u201CFix: a trailing-dot host matches; proxy tests survive Windows env\u201D; \u201CFix: one deadline across redirects, no 3xx body taken as a download\u201D; \u201CFix: each redirect hop picks its own proxy; IP entries match any spelling\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/context/src/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/http.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd116e5ce4b304dcf4cae1220c6cea44fbf36d5365eef400b21c408cbdac0279"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: cli/bin/cli.js: cli/bin/cli.js changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is cli.download at line 58), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: name the provider behind engine download outages (#1351)\u201D; \u201CFix: launcher checks the cached stamp and the sibling engine version (#1232) (#1233)\u201D; \u201CFix: verify engine downloads against a committed checksum manifest (#813) (#1180)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- cli/bin/cli.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/bin/cli.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5fc195added416fc39453563e05cc445441116cfc82be5e54ca04f9bcae613"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/common/src/git.rs: crates/common/src/git.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is impeccable_common::git::ensure_dir_ignored at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: native audits save too, project-wide audits get a key, commit lifts ignores\u201D; \u201CFix: keep runtime output out of git and report spent build files (#834) (#1303)\u201D; \u201CFix: find the design hook from a nested git worktree (#1016) (#1020)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/common/src/git.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/common/src/git.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e255b11dbf26eaa972e1a41d82eaf04f37127e4c36e0afb42ea43e9ec80a4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skill/scripts/live-browser-session.js: skill/scripts/live-browser-session.js changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is live-browser-session.randomUUID at line 16), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix launcher probe exit status, \u0060**/\u0060 ignore boundaries, denied storage, and unsafe DESIGN.md links (#1116)\u201D; \u201CFix: keep checkpoint revisions ahead of storage across tabs (#903) (#907)\u201D; \u201CFix live cleanup races with framework HMR (#695)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- skill/scripts/live-browser-session.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-session.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c3c09d2dcfb0b83cd3a43ad7b91f8eec91efc638534fffeab1c6e1e1fdb6f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/account/src/http.rs: crates/account/src/http.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is impeccable_account::http::transport_reason at line 207), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix adversarial DESIGN.md upload review findings\u201D; \u201CFix critique upload input, opt-out, and renewal boundaries\u201D; \u201CFix: the account client names its origin for the NO_PROXY match\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/account/src/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account/src/http.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"edefab8bcdbedbd52f0dc609b05f2a47ba2c92135565713c3b0941fd064d4882"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/oracle/cases/live-wrap.mjs: tests/oracle/cases/live-wrap.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is W at line 9), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: choose the live-wrap source file by --text, not walk order (#1281) (#1295)\u201D; \u201CFix: live-wrap finds where a self-closing element ends (#852) (#916)\u201D; \u201CFix: live-wrap matches a capitalised component to its rendered tag (#875)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- tests/oracle/cases/live-wrap.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/cases/live-wrap.mjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"863c5179df8fff1eff98de502926969eccb168964553b8b73d8323d35aaece6a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/detect/src/file_system.rs: crates/detect/src/file_system.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is impeccable_detect::file_system::http_get_once at line 467), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: walk .mjs and .cjs sources in directory scans (#1220) (#1225)\u201D; \u201CFix: detect honors a configured extension\u0027s engine (#795) (#1013)\u201D; \u201CFix: honor detector.extensions in detect directory walks (#822) (#827)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/detect/src/file_system.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/file_system.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"667abcf9aaebdb74882ec5496043f46a40e9273229dba6825e77e3e60fe4a025"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/core/src/browser/line_breaks.rs: crates/core/src/browser/line_breaks.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is impeccable_core::browser::line_breaks::check_straggler at line 352), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: straggler sees a text-wrap: pretty the browser dropped (#1136) (#1181)\u201D; \u201CFix: straggler measures the last word instead of estimating it (#1135)\u201D; \u201CFix small measurement defects from craft run 1009 (round 13, branch D) (#1151)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- crates/core/src/browser/line_breaks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/line_breaks.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfb874a3c35779b45656fdd892b6219b62f0c989e45224d3bffa5b33e248b0c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: tests/oracle/cases/live-roots.mjs: tests/oracle/cases/live-roots.mjs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is setup at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix CSP meta patch hiding a separator after an unknown \u0026name; reference (#1145)\u201D; \u201CFix live-inject CSP meta patch escaping and revert (#1128)\u201D; \u201CFix: live-server --background forwards its resolved root to the child (#1086) (#1089)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 22:07:50 -08:00\u0027 --until=\u00272026-11-12 22:07:50 -08:00\u0027 --full-history --no-merges -- tests/oracle/cases/live-roots.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/cases/live-roots.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"10912a8eebc846b2772f2dc9c7b746254b31dae3501c4775dff6cff13538b648"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dedupe): use rules::is_card_like_from_props \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":"crates/core/src/checks/text_rules.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ec48b8af7b7fc1c18c79ae1bf155f2d14ed924289a2579c09fe081c7f5616b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dedupe): use rules::is_accent_color \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":"crates/core/src/checks/text_rules.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1da13d196bbc6f553e6bc5359fb390af7eee6d466d8ad4c5d450ad30ac6a4"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no map of the repository\u0027s parts: The repository has 6 units (\u0060darwin-arm64\u0060, \u0060darwin-x64\u0060, \u0060linux-arm64\u0060, \u0060linux-x64\u0060, \u0060windows-x64\u0060, ...); \u0060README.md\u0060 and the documents it links name none of them. Add a short list of the parts and what each does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f047b1120601c2537f0645d9b67f052758989ccf5801de4d919633bcff2a3cc2"}},{"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 \u0060package.json\u0060 makes this repository a deployable product (line 37)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f571cc2c2542badcf90ae46e31e24c43d9ca80090c40fca9fd1434a5c34546"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060outerHTML\u0060 spells \u0060HTML\u0060 where 19 names in the project spell it \u0060Html\u0060: 19 of 21 names in project impeccable spell the token \u0060Html\u0060 (19 of 21; unit: names in project impeccable containing \u0060Html\u0060). Peers: live-browser.buildListHtml (cursor-plugin/skills/impeccable/scripts/live-browser.js:13742); live-browser.escapeHtml (cursor-plugin/skills/impeccable/scripts/live-browser.js:13784); panel.escapeHtml (extension/devtools/panel.js:411); sidebar.escapeHtml (extension/devtools/sidebar.js:99); live-browser.buildListHtml (plugin/skills/impeccable/scripts/live-browser.js:13742). Rename to \u0060outerHtml\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"815d4e23cf1b1f4eb1e0cae1c7eba781dcea23a2a07e4ee995698cb9421b2ed6"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060outerHTML\u0060 spells \u0060HTML\u0060 where 19 names in the project spell it \u0060Html\u0060: 19 of 21 names in project impeccable spell the token \u0060Html\u0060 (19 of 21; unit: names in project impeccable containing \u0060Html\u0060). Peers: live-browser.buildListHtml (cursor-plugin/skills/impeccable/scripts/live-browser.js:13742); live-browser.escapeHtml (cursor-plugin/skills/impeccable/scripts/live-browser.js:13784); panel.escapeHtml (extension/devtools/panel.js:411); sidebar.escapeHtml (extension/devtools/sidebar.js:99); live-browser.buildListHtml (plugin/skills/impeccable/scripts/live-browser.js:13742). Rename to \u0060outerHtml\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"130fe153abd001a5efa91eb59d4633104ac86b3d5cf26dbb1a37b9c4eff25de8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022User-invocable with hint\u0022 repeats the code it sits on: 3 of its 3 words (user, invocable, hint) are already in \u0060const skills1 = [{ name: \u0027test\u0027, description: \u0027Test\u0027, userInvocable: true, argumentHint: \u0027[target]\u0027, body: \u0027Body\u0027 }];\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lib/transformers/factory.test.js"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f0b7eac1ce4c9f47543a541ca4e3d215aa67036921b89fdcc35f285760a794"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Terminal pick cleans the state file up.\u0022 repeats the code it sits on: 4 of its 5 words (terminal, pick, state, file) are already in \u0060assert.ok(!existsSync(path.join(cwd, \u0027.impeccable\u0027, \u0027questions\u0027, \u0060${key}.state.json\u0060)),\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new-work-e2e.test.mjs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61a77ff425fee078e829aefff147c40ce02916dbe332d0079599970a115fc71"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 19 project(s) overshoot their size bounds, lowering Project Cohesion to 8.9/10. The most over is \u0060(repository root)\u0060 (28946 LoC, 73 module-visible types across 16 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"482e3b19efd040fb2215efbc5e65f5b9996234817368c5a9198eb89910e46231"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fd51131df60d25c2eae39c17659b477711e08754cf6972b42f9d37427fc3cfa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5593c10d20ccd89af3a37a6f1cfedf3e57980a0d860fd23bf9d85f94e1d22125"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41a030540ba513c6186230e1e7be43bcfd075f025c8ac5fa9e667cb9775e53a3"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef98487a3ad9c762a3aed004ae96544a68315ee135299f191c527728bcbc117e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc05e262c18f1305f6dc859be14d437f8d8642ee5afa6d1898998ac98a17ead8"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"15a2cb9a56d361cbb260c6b56bd812b8c0385d713a418eb3333898adaa7ff7f1"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41100252420ccba1ec35c6de7a17b2fe76caaf7927fc209fd36d29543d450167"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c0d7130bd38fcb2e6cda6745664fa72788e80c37d80c68cc9bfa69940b39bc05"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71d7e14dd2356709607c92012865c597796ec5d30116da295a8c7a4dc151aad0"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00bc9ca6a5544ea8713aa3744ac8f016dd8f164d3610f5882974d7031213c1b6"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c4c8ad138381c53b643c12f0a5463d36870cb36ea07d02413db3e4526c8bb33"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2ef12d0d42cd1db16c309d1c8ec8cae1c1cc9258b881fc640fbc3f29d6fe684"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9d932cc5cf1cb29b66bb58fe399d4762801309c39afc7872da36f7b1a08981ae"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"900293bab60c829951390c81857531adbcb08ecfa186a07b7ceda9a92b622cb5"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0383df6e1485d2fc18eeade572b795d0bd8ba56405a9732899ad1ab0c8b198d9"},"taxa":[{"id":"CWE-345","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5f0a9af30353129a4096071e1577099a21582aa92e3fa85f429d6788beae2b9"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"e7b5473888bec66ce52dd7eb73d00adf4980590f7b3b7bc7b8b31d404dd2d9f9"},"properties":{"dependency":{"package":"proxy-addr","version":"2.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e80166212955305782ecd63648cf84d995faf135cbe4dcb9eacfe6d400b72914"},"properties":{"dependency":{"package":"@modelcontextprotocol/sdk","version":"1.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83cf917ffe5eb204f1d897bec87029aaf4400ef3a29e6c5cd277322f6d7c10dc"},"properties":{"dependency":{"package":"body-parser","version":"2.2.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aadd9808f81b7bf7345e74981bf660df1eac0525a4bbcae2b66494a5bb38ccc6"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8aeb5c7f121fbc352eb13b6291d60c5d6be7b85568281df734903a30538276a1"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b87ce788ef567429428c97c46b1707d4886a58d5ec0988d8f765f1d768d334a4"},"properties":{"dependency":{"package":"ip-address","version":"10.1.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52e7517500af5ed4deaf3bd76c3cfdc99027829f5f17c77374dea50b2c1c3493"},"properties":{"dependency":{"package":"hono","version":"4.12.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2263a75da41737bd41be73a206bdf4145a5cf182e4ae843b420ad4dbcb950cf4"},"properties":{"dependency":{"package":"qs","version":"6.15.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b35d653140e2db8d8d074934d5a01703fe2f94d4c2c5aa06161c7e55b1ce629b"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"faae75faf8db0cfd0fe153a81d1192228ca3235397119ee7bb30a3b5778c5c21"},"properties":{"dependency":{"package":"@hono/node-server","version":"1.19.14","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D32","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":"c4e3ada27d1365fc0313ec8f4e07fd101bab26c6e8d1513a5de497e9ba3b23bb"}},{"ruleId":"D32","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":"40fa5f64f86090f29412336a8ea9abe3950e04663e2baa9a43d86785d3fc7810"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cli.rs \u2194 hook_lib.rs: \u0060crates/detect/src/cli.rs\u0060 and \u0060crates/hook/src/hook_lib.rs\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00606f3746c4\u0060 Add composable rule packs to the CLI router; \u00602e3cdf02\u0060 Report a side stripe on a status row or cell as a side tab (#1133); \u0060dad8dbb3\u0060 Fix: ignoreFiles waives a linked stylesheet\u0027s page-level findings (#1\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ffa3398f60bee63b39e32e396796f78070edb341baf590942d2aca951e5e1a"}},{"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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3797300b52080bbc463de917771dbf6ea00f579b63c99b91eef62d2d00923e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f4c9b7236f76221897efda7cf34c7b948a2896982f6064a05432e54babff04"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/devtools/panel.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"460336843cf39f26b3124299ca015df9daa21edc7f5f75e91c0fd36a581e05f2"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/devtools/sidebar.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab65d89a827db6ddd7ce748db8798b89b907e201aa92d548a6c52e47346baffb"}},{"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":"extension/devtools/sidebar.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9359585348df9bae6a4a0db6f43c31860f27a35e3ef5640bda46414e01b897be"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Add a descriptive \u003Ctitle\u003E in \u003Chead\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3fc4dc443a40e518b734a170c1c6028091bcaeaddd265990422020ab647ebf"}},{"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":"extension/popup/popup.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5288683b25965cbc2aac916bfe0f72e1ae34dde9c047a4877ca665ef5341daa3"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.setting-switch-track::before\u0060 moves (\u0060transition: transform 220ms cubic-bezier(0.3, 0.7, 0.2, 1)\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":"extension/devtools/panel.css"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c970e297e70a491ac8da358c740e94d7d46ef3abea67d31c9f6a5d38e5261e42"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.setting-switch-track::after\u0060 moves (\u0060transition: transform 220ms cubic-bezier(0.3, 0.7, 0.2, 1),\n    background-color var(--ks-quick) var(--ks-ease),\n    box-shadow var(--ks-quick) var(--ks-ease)\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":"extension/devtools/panel.css"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7395629356ef2b67edeafe7be261b3728855698108272afbd36d085336d3efd"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/10 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/account\u0060, \u0060crates/browser\u0060, \u0060crates/cli\u0060, \u0060crates/common\u0060 and 4 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 4 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/ci.yml"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch cargo: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060cargo\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":".github/dependabot.yml"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc96cbee094111cd5477d1cd61206d730376403fd2c6f84d75edafea2180945"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/bin/cli.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"124c72769f648300aeb6496fee2f772322c031a44459defb1aebb2dd9e7fade1"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::AgentBuilder::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/http.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e3e645831817c86df7a3e8e9965ab55eaf7c26c7bf1b5da1efb0a39e97bdbc"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_server.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca998866f7bd0546029dd21bb0458688136d27f102095a12bacc33a4975d4edf"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/entry.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e3be40127f61fee872826c6b093726aabc09088d8fcac8f1522c3df3c22a27"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060fetch(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/entry.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"4578d37087c7e86f245758db3572ca86181784d1e675d3f2c8bcb6998201bf19"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7d34a9e6868cff1b3685cc55d32f49c9588cbcce4f16c08a2f332fa0464d7e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e63dfb545618344f130d3c1c16cfdb85f1639c77c61f11e60d851c13249288"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a625693eb049bc12921d9b0fcc16b071df7b9fac0dfe8a3659a319aa0d53100f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f28a00e524106ac5394af558d664a2c8fb1bab07be47570d330e0b854f5cd3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd870fc97d155f0d72b0c15975237294619305db90f235fb85f3459497f37405"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4eccc8d3a92f73a96b212933f616f40428c7c702397761aada5f571d763ffef"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.statSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fff458f7d394de72497552965050c35a9f40b5fee89cce45df6f5b9909c6230"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060createProviderZip\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/zip.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e7640e4cb587dcb61f6634a3c40feeaec6657b3dd18a0883ee882c59dfbd88"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060createProviderZip\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/zip.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882f84327d70d9497d3de7c0b64c072ce8f580964ba36eed4e5f31b3bf17c40"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 38 typed \u00B7 190 plain JS \u2014 the untyped files are browser-bundle/05-natives.js, browser-bundle/10-probe.js, browser-bundle/15-snapshot.js, browser-bundle/30-scan-common.js, browser-bundle/35-visual.js, browser-bundle/40-overlay.js (\u002B184 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Forked directory tree (41 identical files, ~18152 lines \u00D7 2 trees): cursor-plugin/ and plugin/ are near-verbatim copies of each other: 41 files are byte-identical under the same relative paths (~18152 lines; the trees hold 65 and 63 files). That is one structural fact, not 41 local ones: every edit made to one tree and not the other drifts silently, which is the failure whole-tree forks guarantee. Pick one tree as the single source and produce the other from it (generated, copied at build or release time, or re-exported) \u2014 or, if the copy is a stale snapshot nothing produces any more, delete it. Check first whether the copy is a deliberately published deliverable (a template consumers copy verbatim, a released sample frozen at a version); where it is, keep it produced from the source tree rather than edited in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cursor-plugin/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a38d70657ad0803ffcc17161b465377be8bd3b1abb2119bbb0ccc7a491c4db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (63 matched lines \u00D7 2 locations): crates/wasm/tools/ab-diff.mjs:41 \u00B7 crates/wasm/tools/snapshot-diff.mjs:35 \u2014 the two spans are one implementation copied and then locally edited \u2014 860 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ab-diff.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca685200dfa2f634cb79510bef98a98627488f872f70addfeed30305c12f537"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): scripts/build.js:281 \u00B7 scripts/build.js:375 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.js"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"85def4e49628ae9d15a409c2c0aca8be425cc7e796dc6241bd9926a6fd627ce1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): crates/wasm/tools/disabled-values-check.mjs:55 \u00B7 crates/wasm/tools/skip-scan-check.mjs:35 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/disabled-values-check.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11fada393a9c74766f6e53e43cf2c248bbe53d753f71fadf39f756ddb4a3465"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): scripts/release.mjs:229 \u00B7 scripts/release.mjs:499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"981c9f72fa2d35dca68567e9f7060e1a23b246e97ca07f72f04b6330651a9212"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): browser-bundle/50-scan.js:231 \u00B7 extension/content/content-script.js:153 \u2014 the two spans are one implementation copied and then locally edited \u2014 169 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76e3e3a2a375f9e5609aab2ca8ad1db4431734f1e8432d1db182ede48258dbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): scripts/smoke-provider-hooks.mjs:506 \u00B7 scripts/smoke-provider-hooks.mjs:566 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"4144f13ac3c7f83369048f95bb28a90f50ff9b1ae9d1bc7f7640307c8c4c1994"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): skill/scripts/live-browser.js:2451 \u00B7 skill/scripts/live-browser.js:2541 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5186cfe2845eb7a37d133a345b5c0c762ae80f3163dd66ccc915648be12d984"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): skill/scripts/live-browser.js:1486 \u00B7 skill/scripts/live-browser.js:11865 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8b53b520f5f5b131515072f73d0a377ce109997d36886c776496d47472136b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): skill/scripts/live-browser.js:3946 \u00B7 skill/scripts/live-browser.js:4055 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3946}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3546b99ba89cfb606fdfbbfde4d19ca4030291abc90bc9f9b4ee22bd31517b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): scripts/lib/utils.js:795 \u00B7 scripts/lib/utils.js:824 \u2014 the two spans are one implementation copied and then locally edited \u2014 96 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/utils.js"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"558ea5a51ce4414d9660afe7430dffd13d82db504f856451b3cc9bc6fe63c076"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): skill/scripts/live-browser.js:2477 \u00B7 skill/scripts/live-browser.js:2558 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaae5078ccb17206dbfe5844d7f2a0fab08058b26c1ea9a140f177e58cac024b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): browser-bundle/10-probe.js:63 \u00B7 browser-bundle/15-snapshot.js:103 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d190a81055abaf6295f6a75224383965d8e8a594f7f40b2d75a499619e256c3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): crates/context/assets/component-review.js:1591 \u00B7 ui/component-review/review.ts:215 \u2014 the two spans are one implementation copied and then locally edited \u2014 527 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc853fb43f4a4183f1ff8aba5337d435655b976b08d64d1df7426678fda67f04"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): skill/scripts/live-browser.js:6405 \u00B7 skill/scripts/live-browser.js:6441 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4c039ed956f8184020dcf3eac3094e23cae546c137b663c242219d646198a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): skill/scripts/live-browser.js:9687 \u00B7 skill/scripts/live-browser.js:10120 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":9687}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aa9174a7584aa35e86cb7ec2011b478eaa2c3b6db90a1350bd8ce024d65702"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): browser-bundle/10-probe.js:128 \u00B7 browser-bundle/10-probe.js:157 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"212e562e37b24196b95289dfad457f56a167f184f684c6a951b7ed7213fa9a51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): skill/scripts/live-browser.js:8515 \u00B7 skill/scripts/live-browser.js:8620 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":8515}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ff4fd6862a11c8fad026c37dc7d6951dba38ff314f9c3910dbda0302dbafb9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): extension/devtools/panel.js:69 \u00B7 extension/devtools/panel.js:84 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/devtools/panel.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"46841eb679163b44196110ba6f5c7750d4cb81aecac32f04ec4e03180fc4f2df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): extension/devtools/panel.js:9 \u00B7 extension/devtools/sidebar.js:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/devtools/panel.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e022f05537e1dcd12b45628e5709f94cf8b9341f4e0745f6ef717c4eeea7583a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): scripts/build.js:318 \u00B7 scripts/build.js:408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.js"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22d664fd9cafb6e1a3b040fc1210e56e7de8fe11812ccb40b59d9b53bafc53b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): skill/scripts/live-browser.js:13385 \u00B7 skill/scripts/live-browser.js:13455 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":13385}}}],"partialFingerprints":{"codehealthFindingId/v1":"343765610566560e0fcaadd64efb10698201475aec4d600d51e93dab3e9c4fd2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): browser-bundle/10-probe.js:355 \u00B7 browser-bundle/15-snapshot.js:642 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a13b63ea72b82800aadc66c7dcd9b98b253c2011c263fcd2c590ac1d41fe2ea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): extension/background/service-worker.js:366 \u00B7 extension/background/service-worker.js:399 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e209bb3915b99692cb55fd920eb3b56ed746a03905714e330622539c1c3db7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): extension/shared/findings-report.js:70 \u00B7 extension/shared/findings-report.js:112 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/shared/findings-report.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf5e1e4aaa1ea8e3f41de790712be0ab97ee1defa0273d24ad4b79a1aeb3b05"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): skill/scripts/live-browser.js:1220 \u00B7 skill/scripts/live-browser.js:1260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4183c4f7ceb79d5744fd6936470d7e515f4fe2596ab8bd86235ec20232e6d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): skill/scripts/live-browser.js:5657 \u00B7 skill/scripts/live-browser.js:5694 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11745b072de181f955ab0a2322af70f68e8bffa9a4387c53bafa57c8edece9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/wasm/tools/disabled-values-check.mjs:24 \u00B7 crates/wasm/tools/skip-scan-check.mjs:22 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/disabled-values-check.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d338c4217347135221ec7158942cb4f36cf6abce0069465e31142947c5ca7d68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): skill/scripts/live-browser.js:1824 \u00B7 skill/scripts/live-browser.js:1848 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6583dc67e3796124ae2c0545281d1c8dbaf8ff1b55a9d5b4490b9b38d56049"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): skill/scripts/live-browser.js:13419 \u00B7 skill/scripts/live-browser.js:13446 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":13419}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b998cffc266deb9a7e2df4d053aba8bf8f78d41990628e624146e20e354e685"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browser-bundle/10-probe.js:80 \u00B7 browser-bundle/15-snapshot.js:85 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"453b800be70b9216ddc9c088f6a083b9a6fd332b1565adacc9cd7e21f8af2ecb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): browser-bundle/15-snapshot.js:449 \u00B7 browser-bundle/15-snapshot.js:616 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"143ef48e981d49dfc390acaccc65206c279d503171edc7996b5e9a20a471b8a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browser-bundle/40-overlay.js:376 \u00B7 browser-bundle/40-overlay.js:386 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad1f52fdcdad7c1049fa2545c235ce678b0a684f7e374538cd91e3cc884715e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): browser-bundle/50-scan.js:70 \u00B7 browser-bundle/60-offscreen.js:112 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2020966b7b68d1c69cdf1afc0913bcc2552be113088f17cdffe333c16cb9abd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): crates/wasm/tools/ab-diff.mjs:22 \u00B7 crates/wasm/tools/ext-diff.mjs:24 \u00B7 crates/wasm/tools/snapshot-diff.mjs:19 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ab-diff.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95de3a51012bfb1b1fdf7394526ebab5b468ded100e138944b3d017552064d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/smoke-provider-hooks.mjs:478 \u00B7 scripts/smoke-provider-hooks.mjs:487 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca26216b5563747d75a9236458acdf7ed5f36f03c03d301b6f1da45447156e6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/smoke-provider-hooks.mjs:543 \u00B7 scripts/smoke-provider-hooks.mjs:591 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fcdf2302c94481375b42fcd7721666f5da8dfa5388350569fb5a6e2fbee993"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): skill/scripts/live-browser.js:1153 \u00B7 skill/scripts/live-browser.js:2980 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb333f1877fa2989b4809f7c701b757c2e5ab059fe7c19218cfc3972b8ae6da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): skill/scripts/live-browser.js:3811 \u00B7 skill/scripts/live-browser.js:3846 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3811}}}],"partialFingerprints":{"codehealthFindingId/v1":"420ef99d45fc117c2f9b438e583202f2dc3e53d7924ab8ba876d2997e21519bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): skill/scripts/live-browser.js:6117 \u00B7 skill/scripts/live-browser.js:6170 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":6117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b732232727baee7c13428365d8b45c74c1754b6e3e89540abf95f29544e78389"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): skill/scripts/live-browser.js:8586 \u00B7 skill/scripts/live-browser.js:8668 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":8586}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ee10fb168dc59146fda97809e85da1263c99c3db7ebfa713e6a4204706ae2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): browser-bundle/60-offscreen.js:141 \u00B7 browser-bundle/60-offscreen.js:192 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/60-offscreen.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b986688a7ce76f59f5832491c496b3c114e6640fd63c598f0ed29eed8dfd5483"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/check-engine-release.mjs:111 \u00B7 scripts/check-engine-release.mjs:158 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-engine-release.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4944ffc10fad01f118a73e0e496973f37df490a9c0d5534b9bdf8477f0533bf6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): skill/scripts/live-browser.js:598 \u00B7 skill/scripts/live-browser.js:610 \u00B7 skill/scripts/live-browser.js:746 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21cde2b034112f89d93b640ef8a6e23c82574f18643c6fac9a5216ca285aaf7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): skill/scripts/live-browser.js:609 \u00B7 skill/scripts/live-browser.js:745 \u00B7 skill/scripts/live-browser.js:957 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f56632ffa13da4ae80ad152e86d858f786239479fa81afdd587c4dd1b266f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): skill/scripts/live-browser.js:4381 \u00B7 skill/scripts/live-browser.js:4428 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d533f2f5fb3c288e54cd156a9d6294b65df0142336e66dc9c92e2693fc5716"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): skill/scripts/live-browser.js:4392 \u00B7 skill/scripts/live-browser.js:4475 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4392}}}],"partialFingerprints":{"codehealthFindingId/v1":"14738a873b1b3b2e94a2c7ca8d09803bf7eb2ef9bdd037652ce73601e7607081"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): crates/context/assets/component-review.js:1525 \u00B7 ui/component-review/plan-review.ts:267 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bc99f5374aaaac1e08e2233ef182fa1f93b3fd7cc548c22ce238939ac22edc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/lib/utils.js:169 \u00B7 scripts/lib/utils.js:181 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/utils.js"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e868650ef4f589ca1f16d33eefd23c1fc365460fb4fb7b908fa92bf0e998d9d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/lib/utils.js:262 \u00B7 scripts/lib/utils.js:297 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/utils.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9f01b6315cac14016c1b8fab842375b38318888c9a20e8a4d4ef835d7c8bef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): skill/scripts/live-browser.js:367 \u00B7 skill/scripts/live-browser.js:477 \u00B7 skill/scripts/live-browser.js:12686 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e121931a946eea0229206bdb9646c3a286fe82530db1dcb0ec50a98b862cb9d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): skill/scripts/live-browser.js:4070 \u00B7 skill/scripts/live-browser.js:4397 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e915d78cdaf8166a528fd2a6d5785c63b9a1295e58d5bae26d593db18cc48ec7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): skill/scripts/live-browser.js:11341 \u00B7 skill/scripts/live-browser.js:11353 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":11341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bde53faba1e32f4a216832a951894d8c8049e9911f41c72f9b9b81be1da8b14"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/lib/live-server-processes.mjs:221 \u00B7 scripts/lib/live-server-processes.mjs:255 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/live-server-processes.mjs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f3310607d70b6b863416088fe04adb40de60182f64e3ae0af9a9a1769124fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): skill/scripts/live-browser.js:8919 \u00B7 skill/scripts/live-browser.js:8983 \u2014 both copies are in the same file, so extract the block 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":"skill/scripts/live-browser.js"},"region":{"startLine":8919}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49ef20b3ad151ef6266f0f260ab93798bb91d61678f7497fe5235a6422ae550"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): ui/component-review/plan-review.ts:19 \u00B7 ui/component-review/review.ts:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6932969facdb379b5a73d3d02194da2c177a9f9ef558d0c3155d09755cabf039"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function H (cyclomatic 255, cognitive 246): H has cyclomatic complexity 255 and cognitive complexity 246; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ef24dc46510e20a879066b2c452552d40d9d8b683311b147147ca4875fff6d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function render (cyclomatic 255, cognitive 246): render has cyclomatic complexity 255 and cognitive complexity 246; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"864aa0b0140671522f2fa2ef739dd78d662afd6a1d706e293a1e24e8b01d42c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 93, cognitive 141): (anonymous) has cyclomatic complexity 93 and cognitive complexity 141; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8d1f1f81a44719670cab23d167c95fb7df51e8a42216b3263ad71ee02cf8ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function capture (cyclomatic 92, cognitive 162): capture has cyclomatic complexity 92 and cognitive complexity 162; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afa882835b55028b291d4c7d52e92dcd695eecd7dd97ffcedf17e8240dba2a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runAgentLoop (cyclomatic 79, cognitive 183): runAgentLoop has cyclomatic complexity 79 and cognitive complexity 183; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eccaaf61ce7d34af114cf33369e304252543a2a98d9ca352dc33e4487fa8cd2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 70, cognitive 92): handleKeyDown has cyclomatic complexity 70 and cognitive complexity 92; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f425c23bdaace14084a9ba41d88bdbb0f3c815fabd593fac8614c6aaad2e2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onmessage (cyclomatic 69, cognitive 71): onmessage has cyclomatic complexity 69 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7813}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bdcf0c54517d34eae2ded5ecc289a130e5c3f9f4e2bf764c9fff0f653ba534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function evaluatePullRequest (cyclomatic 66, cognitive 55): evaluatePullRequest has cyclomatic complexity 66 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github/sheriff.mjs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb22b4239877fb1953926a51d6cb8f4cae953a796cdd5abc73434f5bebdb35b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 64, cognitive 80): (anonymous) has cyclomatic complexity 64 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/raster_coverage.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d5d1df5e1c69d4497ed964580337ff4992831ec5ff1bd4b0eafdbed80d58fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resumeSession (cyclomatic 64, cognitive 74): resumeSession has cyclomatic complexity 64 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c3231a9d68f960ebb66e2851ab242bf3759c29fe3a6b4075fd63b22f518336"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function exercise (cyclomatic 58, cognitive 83): exercise has cyclomatic complexity 58 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/launcher-download.test.mjs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5a24902ce7d48fe12cc4993392591fa786ae2ca7374adb90f52f5ec571b001"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ot (cyclomatic 56, cognitive 53): ot has cyclomatic complexity 56 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c2730258b8a395f50208540014efac74836e32ef8222c127c8dc24c2dca183"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKey (cyclomatic 56, cognitive 53): onKey has cyclomatic complexity 56 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a111c8b829c127450e29d045fb6a55c0874f6bf7dff2d1a96ae6c607a9c4a19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function injectSvelteComponentsFromManifest (cyclomatic 50, cognitive 51): injectSvelteComponentsFromManifest has cyclomatic complexity 50 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6052}}}],"partialFingerprints":{"codehealthFindingId/v1":"50045abdf6cd8938c7751b661087b80b83ca921e5f25a8b7cfca03eba638747a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 43, cognitive 70): (anonymous) has cyclomatic complexity 43 and cognitive complexity 70; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7258}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d7c21c85911c6b1c6f0fe72660224f728e1e1fa23c414147abdd9f89359af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function build (cyclomatic 42, cognitive 79): build has cyclomatic complexity 42 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.js"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d01f71765429b953642aa981460ed91bceb67b90b6b13ff13cf45a134283361"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runManualEditStage (cyclomatic 42, cognitive 66): runManualEditStage has cyclomatic complexity 42 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e3799922c6f3c7e24b9a2fdbce4cd43b9c95f61556cb5a79a71eb885227993"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreSessionWithoutWrapper (cyclomatic 40, cognitive 29): restoreSessionWithoutWrapper has cyclomatic complexity 40 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9885}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f33bc49384fa39582f3e30dd3ee27d34a26397787ce011750905fd53f0409d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleClick (cyclomatic 34, cognitive 32): handleClick has cyclomatic complexity 34 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b21f6d953a9e54f9210bb74a526edad675f8f2af96e40672e0bc324a8249c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function scan (cyclomatic 33, cognitive 56): scan has cyclomatic complexity 33 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c74128cdc2d52529a7588230ba71f8c55f147978b52885162bb1467214b905"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleManualEditActivity (cyclomatic 32, cognitive 44): handleManualEditActivity has cyclomatic complexity 32 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6319eacf7425eed7fbdba263ab8f73224c50381f6aedd5ee4c14a25cf74f0341"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSourceFiles (cyclomatic 32, cognitive 38): readSourceFiles has cyclomatic complexity 32 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/utils.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be5eac9fc5210c3b94fb5b3801a3a05230a80416d1f31d2fd81189847ae559e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyManualEditBatchToSource (cyclomatic 30, cognitive 80): applyManualEditBatchToSource has cyclomatic complexity 30 and cognitive complexity 80; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d36c2133a70cccc3cd2b1552bf15442b19cae9054c2bcdc841a215728e2897"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateManualEditCoverage (cyclomatic 29, cognitive 57): validateManualEditCoverage has cyclomatic complexity 29 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"d121cf6f614724be687b024327a1856a8d049f547545864ae5ae5f22d5986c35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function unlockSteerChat (cyclomatic 29, cognitive 36): unlockSteerChat has cyclomatic complexity 29 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd89f23a26797cd3d61ddfa4d45085c90ac0cc7ff68a0195f07ec7196b4d6f4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeSvelteComponentVariants (cyclomatic 29, cognitive 30): writeSvelteComponentVariants has cyclomatic complexity 29 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"deebe409ee7e2b27a3432cfb93e94e07c8ce0bb351211958d9dadbef1147ee50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 32): (anonymous) has cyclomatic complexity 28 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3413d77173ec357e19be3d24972bb678f8fb1daa8e39d996eccbea2543a9e125"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyManualEdits (cyclomatic 27, cognitive 49): applyManualEdits has cyclomatic complexity 27 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88e7fb27ae8d973039ba8dff4b877441bbf021537d6646686d83a0513e83dd7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSveltePropValuesV2 (cyclomatic 26, cognitive 43): buildSveltePropValuesV2 has cyclomatic complexity 26 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5744}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c52d991db9f9aae6694d4ca0db2341b40055566deabfd763441dd2efc547bfc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 25, cognitive 43): main has cyclomatic complexity 25 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-font-index.mjs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23972d2d4a928af153d0e46b787b5dfc3c42e14a06e0217f53aceaa3a4244c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function diffResults (cyclomatic 25, cognitive 39): diffResults has cyclomatic complexity 25 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/lib.mjs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"c826bc8cce75dc83cebeea2d618dd785c2a5cd09f8ec5d4d67e593158db18d72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encode (cyclomatic 25, cognitive 31): encode has cyclomatic complexity 25 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/vectors/recorder.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb34e434562095c0b42731ad5bc17ae0a43511a0f0435e25ceb73ff5c889b81"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 25, cognitive 29): (anonymous) has cyclomatic complexity 25 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af80e3fbe28bee95cbbbbc7ad12d7894614e6f90c0f719c9920271f46c8d434"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ct (cyclomatic 24, cognitive 21): ct has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e37f358d16efc3fefdee41e53804c9b78cd14149c8b4666d5860abe85655c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summary (cyclomatic 24, cognitive 21): summary has cyclomatic complexity 24 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b59f3f4bd687618e7ce2b77d97ab39eb9d4490b9daa438da108535e9e22c7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFrontmatter (cyclomatic 23, cognitive 59): parseFrontmatter has cyclomatic complexity 23 and cognitive complexity 59; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/utils.js"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd34f7fed77524c1227ff59fb9c0c1c68236d43a2c9d77768c8bce26b81decf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateVariants (cyclomatic 23, cognitive 37): generateVariants has cyclomatic complexity 23 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"29990f6ca1c8740983709ddcecdfd2acc57eb89d322b5858b2423a67ebbe70a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEditing (cyclomatic 23, cognitive 36): applyEditing has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"c263b8e2da8b9ac31b150bcdb74caa826be28ca411f667c0f51bcd7f2dc53a4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPendingPillClick (cyclomatic 23, cognitive 30): onPendingPillClick has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b578d2ab5f3de4c905e063e7b74db897c84b8fe52e576e2faada2d8ba261001"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mountSvelteComponentVariant (cyclomatic 23, cognitive 22): mountSvelteComponentVariant has cyclomatic complexity 23 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5904}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c250b7523575907ce16f8ff4f3b8d869ce359525a4f8a95b322b2163f6d9c1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveBarAnchor (cyclomatic 22, cognitive 36): resolveBarAnchor has cyclomatic complexity 22 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe7353a1ece7d84c1166f3ce2bfc5708cae6cfbc170ea420a5eb68f78282eff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPendingDockControls (cyclomatic 22, cognitive 34): renderPendingDockControls has cyclomatic complexity 22 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3b5afa6f190ff16a57d23be1db07f98b63007ab49b7cc8a82ce26455e718df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hitSiblingInsertGap (cyclomatic 22, cognitive 32): hitSiblingInsertGap has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ce06b9a057d6c0aada346ad5e991b992b3e61d8a4ef12649270fa825774e3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onAnnotDown (cyclomatic 22, cognitive 29): onAnnotDown has cyclomatic complexity 22 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ee3812b60278a605938e43dfbe3cc16d6d9712887f4e72cffb72c09de29c6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bootFixtureSession (cyclomatic 22, cognitive 24): bootFixtureSession has cyclomatic complexity 22 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/session.mjs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec1e1a2284c2d99a7a91c5c2d65a4f24faf803ff46c3e4c84a6ccc0e85ebd21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureLiveE2eFailure (cyclomatic 22, cognitive 23): captureLiveE2eFailure has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70d817d5e5a1b111ad988a3f8d13689554746cdf195a3e1fe261aec5298ea59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function At (cyclomatic 22, cognitive 20): At has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0b9e6bebe0f97b7ca9f0b6a5b062b7a9530b52533764542e85e213a92f6ea7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stage (cyclomatic 22, cognitive 20): stage has cyclomatic complexity 22 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8673cbbab7b114d5fe12db35161d2a9ee42576f659ffef77a3ec5e9e0d784904"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ht (cyclomatic 22, cognitive 15): ht has cyclomatic complexity 22 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"96aa59f06f9a8903dca0bd6d95bffe20ac4e97c69ad686b3bb34a76495afb40c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resizePreview (cyclomatic 22, cognitive 15): resizePreview has cyclomatic complexity 22 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbd460560bfc64a1dd0ba7445d78ad92a0fb48d501ea4c73b5b5f9b9c9261f5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Dt (cyclomatic 21, cognitive 29): Dt has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79bec2cce03676906c2023376ac4eda54f544e1010dbe6f33418cb82dbcc653"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decisionBar (cyclomatic 21, cognitive 29): decisionBar has cyclomatic complexity 21 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bd79902af3f7c990ad0cdc661a0fda261308b5544aaa24766bf8501867ed4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function candidateAttemptsForOp (cyclomatic 21, cognitive 28): candidateAttemptsForOp has cyclomatic complexity 21 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38deaa19d2455a5fe96f711bb3ef5e17b0d0272e8cce715a6189edce4722fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pageCandidates (cyclomatic 21, cognitive 25): pageCandidates has cyclomatic complexity 21 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18883a0ea68e6f9c7e2ee0a809875f2843c95327214f56e0975d4e15c72f657"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 24): (anonymous) has cyclomatic complexity 21 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5d52a9a3485f9f12558b402db521bc77f960a4dcdf151489d6cec99e396be5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 23): (anonymous) has cyclomatic complexity 21 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/review-theme.test.mjs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb7622abfd04fe080a04666d4917c01d0250ab44b315325c4a2b029b2062d34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractContext (cyclomatic 20, cognitive 36): extractContext has cyclomatic complexity 20 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64eebc83dab261b21d502d15728141d026b2d5f534df9af4f231856dabca8a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 20, cognitive 35): report has cyclomatic complexity 20 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/activation.eval.mjs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0630caf673b567f1664c6b085294cb6af14ebe8a9d09ce206b8fed644168bca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function suppressMany (cyclomatic 20, cognitive 31): suppressMany has cyclomatic complexity 20 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a434083082352104b6033864d8c5fc3748b7b0faff19135d9caf3dd103c4bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseArgs (cyclomatic 20, cognitive 21): parseArgs has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github/sheriff.mjs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"388e9ac8cf2b927a0feccf970dd739fa6be99f8af76bed6f41380e51a2a2e502"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTurn (cyclomatic 20, cognitive 19): runTurn has cyclomatic complexity 20 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/harness.mjs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f8a983816028e68c6aa4c216d40e742ee47ad7deab5ce884a1b70d31937d44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findLiveElementForOriginalMarkup (cyclomatic 19, cognitive 35): findLiveElementForOriginalMarkup has cyclomatic complexity 19 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5390}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b23c2149767240f2bc5a7a16836bce93f56cbf25e4571cbe028ea100c40a5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __snapRunningAnimations (cyclomatic 19, cognitive 32): __snapRunningAnimations has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"883bd227797927545d6e65954e09b015c30b36854ee15178fed94868ad778454"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateScopedCss (cyclomatic 19, cognitive 32): validateScopedCss has cyclomatic complexity 19 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"db79b6ae7b5460b3c7265f9cda19d3af76555b31847b31719e18b0db59564a0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadManualEditSourceContext (cyclomatic 19, cognitive 24): loadManualEditSourceContext has cyclomatic complexity 19 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc10143a56f9b360155b2f8f81ad08a72b59d243a9d9bf37f7d46eb4833dd647"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findLiveElementFromAnchorSnapshot (cyclomatic 19, cognitive 22): findLiveElementFromAnchorSnapshot has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5367}}}],"partialFingerprints":{"codehealthFindingId/v1":"647d6f583995aee010bbb860f4e0d61343f3dca565371d6fafd13a23502f4464"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function teardown (cyclomatic 19, cognitive 22): teardown has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/session.mjs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3722769173ea12f81952ffcdf73e0425332008d0afcc944c56500cd0a200b61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validatePairedLookupCountEdit (cyclomatic 19, cognitive 21): validatePairedLookupCountEdit has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c3b4699bdb34d99b13f3a62ae2593e20675d7a215f81267c3e6c7471f56dbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLlmAgentConfig (cyclomatic 19, cognitive 13): resolveLlmAgentConfig has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e323c946d4007e85128e29f27f3dad11ff0ea8dc2a1e5c4459cd62ad2deac98b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __snapPseudoElementHostSelector (cyclomatic 18, cognitive 37): __snapPseudoElementHostSelector has cyclomatic complexity 18 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7801e874e7c56f1729e025256a0da900019cd5d64252fd8848e0fe6cd104dd4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCyclingRow (cyclomatic 18, cognitive 30): buildCyclingRow has cyclomatic complexity 18 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2708}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8e545ba894ba2867fda6aa0f3c26eeec17acca81f1015c0ea6bcd97c92eb28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __snapResolvedAnimationKeyframes (cyclomatic 18, cognitive 28): __snapResolvedAnimationKeyframes has cyclomatic complexity 18 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e036b4fc6a07561d5f6a4d3ab26696fe459e5669048e7bdba4991d7314f5fc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Ht (cyclomatic 18, cognitive 27): Ht has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"999dd5ec928f48f27081baac74fb0944dd13f6f8c336b40d83ddb6a63ae8131d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sidePanel (cyclomatic 18, cognitive 27): sidePanel has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf1dc32bd72c34b851199d2ec1c5ec47d497f1458ff58a2e58a499a1293231c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 26): (anonymous) has cyclomatic complexity 18 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/60-offscreen.js"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91f3c77048f0bfeb0efd37a38e7120cb72a120f5db29484ebd51790993ce7e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layers (cyclomatic 18, cognitive 25): layers has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f7de7f632b6d107e0f8f346bf7501340911d35cda22875d78678dc35d9cc7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeCandidate (cyclomatic 18, cognitive 22): analyzeCandidate has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dca35fcc3327ec9f113e6ea0b7ff8c3aa166ee49e7ba6e129c74e881fa48e4d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureElementToBlob (cyclomatic 18, cognitive 21): captureElementToBlob has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8931}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50a1b5d3e9b328804bc06cc2d8ca0a4234c04256eff65cf9be1cd45c11447d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function showShaderOverlay (cyclomatic 18, cognitive 21): showShaderOverlay has cyclomatic complexity 18 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9342}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2fc6326e1c47490239e407ca79385d0c3fd10cadb2b59bf74cabf4e454b9a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDesignVisual (cyclomatic 18, cognitive 16): renderDesignVisual has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34caa8d43f7f8e5f51bc0e368e8c9db2066a069e9c201838686aa4d901d7ff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function De (cyclomatic 18, cognitive 15): De has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c2321a94c95af4888a70a52dea4b8f033f22435dbbc57ae922e428eabee96c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openForm (cyclomatic 18, cognitive 15): openForm has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e77e93a1f997110fa982e40e36638773b1f4dad60413a20cbae490f5b80e7e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function picture (cyclomatic 18, cognitive 10): picture has cyclomatic complexity 18 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/raster_coverage.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"862c9f55f423597c17f3882813fa04a46b20a3b4f5250556d47c724f6c211ed6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildParamsPanel (cyclomatic 17, cognitive 32): buildParamsPanel has cyclomatic complexity 17 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c744174e1151bac608393fd5d270854b8943e101ec96ba4ee53f842368c1dc18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSvelteExpressionTextMap (cyclomatic 17, cognitive 29): buildSvelteExpressionTextMap has cyclomatic complexity 17 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6758}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db3269ac9d5dda8a9c8def8f43c5a7f4a7cd41ab4750d6108b6d69b208b032a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveDetectIgnores (cyclomatic 17, cognitive 23): resolveDetectIgnores has cyclomatic complexity 17 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-ignores.js"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2135a2bfd316f414617997e1141e68a2fe4078461eddcc7677d07cd4fc7131f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function captureAndEmit (cyclomatic 17, cognitive 22): captureAndEmit has cyclomatic complexity 17 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9002}}}],"partialFingerprints":{"codehealthFindingId/v1":"39446d9c2f01b451910250a6f5d743de8bc7c79465009235f93e765ac2b59ed9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 17, cognitive 21): visit has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b7539c1676923afc1ceed709f641bb22152d3b57942f6f15407e00ff701a01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 20): (anonymous) has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-workflow/finish-handoff.test.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de4f7c17bba113ad4599ef50848a6940f6872def2c330e032998735f633cae6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function manifestReferences (cyclomatic 17, cognitive 19): manifestReferences has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-extension.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb82c19679401390a31907900b09a0f5e669a4f4c0677233293f83493786b1c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 18): (anonymous) has cyclomatic complexity 17 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_fonts.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d061c9875c9db2882b430010e5108cfbddbfc796c4673945e688918595cd94"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releaseEngine (cyclomatic 17, cognitive 17): releaseEngine has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release.mjs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"92efb4f016fe97b1fedf81e9b42f184a51bb98fa85fdcef7fbce0bd8db0aac59"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Ge (cyclomatic 17, cognitive 16): Ge has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb5426430e42b194beee54046bce374fb974acdb6f0c0c257634fd310b84c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMouseMove (cyclomatic 17, cognitive 16): handleMouseMove has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73508d34b32edc670b4ac9cbbba1310f8cd7b99e420dba76499d7cfc6d53ea9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startVoice (cyclomatic 17, cognitive 16): startVoice has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11399}}}],"partialFingerprints":{"codehealthFindingId/v1":"40233266ccf5ff802255275ad82a860ad77b3b2969b164a51816e15d28d04117"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateDecision (cyclomatic 17, cognitive 16): updateDecision has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e62c1c94262c81daa5c8538119800776db48866ec85c068e027f569a2125839"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Lt (cyclomatic 17, cognitive 15): Lt has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe41edf4c5754b388ea8a1a663d5a31db3d690874fc18367f9290aca10ab173"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function priorRound (cyclomatic 17, cognitive 15): priorRound has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-model.ts"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab5715da529e5fe037dceb574e547ce46fb46db45ce78650eb66ca26ce65e07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncVoiceUi (cyclomatic 16, cognitive 36): syncVoiceUi has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11338}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b358c84206df39ec80db62495fba1914d3ceea960f6b6ae6cc29b2efa6751d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __snapKeyframes (cyclomatic 16, cognitive 32): __snapKeyframes has cyclomatic complexity 16 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6acf2ffaf783c67d2a9c4db2ec617985bc2ba830bef972299a3fd2a8413c516"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateCounts (cyclomatic 16, cognitive 28): generateCounts has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e86dec638df813843fa555d92766533876de6a4ae11b20fd28bbf97ecd2b3e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMarkdown (cyclomatic 16, cognitive 28): renderMarkdown has cyclomatic complexity 16 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13667}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e74ad76c4b45b5daa68a793cdc2dc338f4f2071f650c5e678eabeeeed8d084e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 26): (anonymous) has cyclomatic complexity 16 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_bridge_helper.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa7e72ef6b5fc99177bf64f76301e8d4ac64e6cbe7668e83c685ba723c1526e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function running_animation_properties (cyclomatic 16, cognitive 25): running_animation_properties has cyclomatic complexity 16 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"618890b8a2d274f8b539c39d750f5b15149d126a9733cf7ef43c2ef0b6f0b746"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncTopLayerHost (cyclomatic 16, cognitive 23): syncTopLayerHost has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser-dom.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3830769e0f4159ffa9de3c925dbea3cc3ec775b79996eca8e829f79823c28709"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateManualEditPlanningCoverage (cyclomatic 16, cognitive 21): validateManualEditPlanningCoverage has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"666dbb745f0253863cad82b0a291ebf9c017925a5b984a29036a013b6c440a3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function completeSourceInjection (cyclomatic 16, cognitive 20): completeSourceInjection has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6572}}}],"partialFingerprints":{"codehealthFindingId/v1":"438ee2042ea06c462e54b3ea545fba870dc33549810b32665beb4816b453a194"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseVariantResponse (cyclomatic 16, cognitive 19): parseVariantResponse has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"052fa8b097fb7de93755f879aca15c5093f2b2474b0a46649f017847e81e38dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __snapConditionalCssRuleIsActive (cyclomatic 16, cognitive 18): __snapConditionalCssRuleIsActive has cyclomatic complexity 16 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a86760cbc43a3869e744c5e3826156d7e7cc54066b8016f5a1ac4b262952271"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removeSelectedElement (cyclomatic 16, cognitive 17): removeSelectedElement has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"d759c04b6a34f2126484ff1d15486f54649efcecd04d4303db10f863e7fdf2a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSteerSmoke (cyclomatic 16, cognitive 16): runSteerSmoke has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/steer.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72ebdae4c3eedad2ba42138173512ac7c0a2e81aaebc79ec38fdd69fb53af95"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function teardown (cyclomatic 16, cognitive 15): teardown has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":12566}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ed0500ed4f658cb5aafe72a9410f4f7b0ad77a9845f3d3a230f9d23e90226"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contextElementForManualEdit (cyclomatic 16, cognitive 13): contextElementForManualEdit has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eec237bafef17b8a843116c2e06f115c517d9bdb931295921f409430e722974"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderFindings (cyclomatic 15, cognitive 33): renderFindings has cyclomatic complexity 15 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/devtools/panel.js"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a519475e8c94a556053e4366f47e6d14c9034b69ad123b0304a0254840c3ae3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyframes (cyclomatic 15, cognitive 29): keyframes has cyclomatic complexity 15 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2291308374073cf5498c31f1212712048c95f12a7060f30ea63672a7685a1b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function keyframe_keys (cyclomatic 15, cognitive 26): keyframe_keys has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"385226d1ba2d9c3bff717ac8c31f4a84f2dad425001252146d7023a67e064479"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendRules (cyclomatic 15, cognitive 26): appendRules has cyclomatic complexity 15 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b807f321aa965da67506f8c21cd05776fb4abbca3a5ae1eb4eb673af553c99"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function maybeWarnConditionalAncestor (cyclomatic 15, cognitive 24): maybeWarnConditionalAncestor has cyclomatic complexity 15 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8299}}}],"partialFingerprints":{"codehealthFindingId/v1":"71224072d1df193c97bc06248a6882a3b559ae3793f7e0be27d72589a29ac0d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ext-diff.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5017a67ba9355a205cd8b39c0c3d9f459886dc45811c23db27489bf6c6829a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 22): (anonymous) has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aa1ec9e907b0d0cb1ea010171d76eb41082b2f0efd3e0fe087c73f956e4621"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function injectVariantsFromSource (cyclomatic 15, cognitive 22): injectVariantsFromSource has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6645}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ca716ccc650db81282b3c024597da516f7f0224d62701f9e55ca2a683fb85e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectPluginManifestFindings (cyclomatic 15, cognitive 19): collectPluginManifestFindings has cyclomatic complexity 15 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/validate-plugin-manifest.js"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d29af296c7f9c8e04aaefdfacc14556717e3aa6c8a74733a47a0b5dc8066db1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectFontFaces (cyclomatic 15, cognitive 18): collectFontFaces has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8746}}}],"partialFingerprints":{"codehealthFindingId/v1":"7929bf2a488921b0c23c494eb8e8aff1bd22c7d29ddc73bd911e7a247705ef48"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Tt (cyclomatic 15, cognitive 17): Tt has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"0271e09b7eaf0e914c65037681c28536744c3c3a0f9f5144bf0801703a5228ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendScanToTab (cyclomatic 15, cognitive 17): sendScanToTab has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"610a649d46f344e617dad8bef72f107b86ddb7d8f008078a9f5190e9f5fd0c36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function place (cyclomatic 15, cognitive 17): place has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/instrument-strip.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef668c2f8b3509ea5a2b9cc5719e0ccdc1fca725377ec541bf1e6b01647f6ae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForSourceClean (cyclomatic 15, cognitive 15): waitForSourceClean has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d45da78a410b704ea7ba9627c414d5fc521af108a68881175719cb0095b723d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __snapRenderedFaces (cyclomatic 15, cognitive 14): __snapRenderedFaces has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3da635123b921a4fd15d25c4a73a74579e81ecc62a535216babdc9b3d4844e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rememberSessionFileMeta (cyclomatic 15, cognitive 14): rememberSessionFileMeta has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9766}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5eb36831f60d4761b7eac148f21f72360113b4d9d518b36585fc4d8fac1e35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizePullRequest (cyclomatic 15, cognitive 13): normalizePullRequest has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github/sheriff.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cbb64daaae287bf93303e69b08f0015764d0fc9cd98aa79253b89d226dd6fa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLocatorForLeaf (cyclomatic 15, cognitive 13): buildLocatorForLeaf has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fdbdce07c0676b882565018c756333e4da25172dd0468d8ba6ad691a9124b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function storeManualApplyState (cyclomatic 15, cognitive 12): storeManualApplyState has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4184}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6da37b59b5473cc7bc1d5fa6a344ad49a9b0353288d3b6fe2090e2eb3ca74d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectCrates (cyclomatic 14, cognitive 31): selectCrates has cyclomatic complexity 14 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/rust-test-selection.mjs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2183012218f7ac7794aa28164dc0fc43e11e7fdf9e767b7ab0fa050a5cb49877"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drive (cyclomatic 14, cognitive 28): drive has cyclomatic complexity 14 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"38067205955df0cb8f1732dbdcdf7caac73c2e5fb99f76105e156f53c65b70e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __snapLastWordRects (cyclomatic 14, cognitive 26): __snapLastWordRects has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb9a02ed9cee7d304a55b221ccfaba1616f8eb6d8c83ad7cf272766df98fd22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPreActions (cyclomatic 14, cognitive 26): runPreActions has cyclomatic complexity 14 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/preactions.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dec87b7347e85eeb4b1fe86bfc00537b29034a14a7b487e1be0639c3dd8484"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findJsonValueEnd (cyclomatic 14, cognitive 25): findJsonValueEnd has cyclomatic complexity 14 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"3094c03497d88c08b2f3029f0b196eb280015bafa240740d2c398b76c12c4392"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildDots (cyclomatic 14, cognitive 23): buildDots has cyclomatic complexity 14 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bb017f2186e89d561e7f3d2f4c54d0925b4fd44b3bb62a65941fde2a09597a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 22): (anonymous) has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fd06ff77443b7654e350a92a8fee7d4912651239af5f2655305528aba41ab2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyCoupledSourceKeyRenamesForEntry (cyclomatic 14, cognitive 22): applyCoupledSourceKeyRenamesForEntry has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74ac512068abf46a5bf5ea62c08843c3d9e8b5dd9252a08b5b946114f7e2bf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wrapMixedContentTextNodes (cyclomatic 14, cognitive 17): wrapMixedContentTextNodes has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3523}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c4946b70b5782c561060d70f19ea7c1a751f543c094ec0f5be0f0a29e3abce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitCssSelectorList (cyclomatic 14, cognitive 17): splitCssSelectorList has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f532d34c2f863b1f6507fb541479617f4da6dcbd49aee073883f1d7163c5c22b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onDetectMessage (cyclomatic 14, cognitive 16): onDetectMessage has cyclomatic complexity 14 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":12542}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd90e645ae4ff5a58b1397db1cb46edaa89cf810ee666b9b8335cfba7338b394"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_isolation.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9399ba35583ed0dbcb9ce5dcd41ac4a912ad243983790404eac2d56d9c65d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elementMatchesOriginalMarkup (cyclomatic 14, cognitive 13): elementMatchesOriginalMarkup has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5346}}}],"partialFingerprints":{"codehealthFindingId/v1":"063d3d7377fc416e3cf79257424ba9a880bff33bbb7e2266250a7836bb424c61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleGo (cyclomatic 14, cognitive 13): handleGo has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8504}}}],"partialFingerprints":{"codehealthFindingId/v1":"884a20a0ce5206274aefbf082c20d5dee2ae23e06663ad76fde6c2e744cc6c2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 14, cognitive 12): run has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0ee9a38d53c5d51fc76ba8e40f4ce4c6515b0a06644f3ac5ebb8a0f494165f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Zt (cyclomatic 14, cognitive 11): Zt has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"82031e288cd0969918904e868c3fe86bab8c34e3a720aba4ebab737d8d79dcb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverMissedGenerationCompletion (cyclomatic 14, cognitive 11): recoverMissedGenerationCompletion has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9964}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97b72405d879f89a2e9b856708326aa8a6164a9d780c598454905ace57927e5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decide (cyclomatic 14, cognitive 11): decide has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-model.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8001cec78bb4f0730884f839f7df99aa22b75dba981f06faa8b6739d32f238e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePendingCounter (cyclomatic 14, cognitive 10): updatePendingCounter has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4346}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef611b062ac32439f84bcb1599eef72246027e83f56af280e61d20803c091467"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForDevServerModules (cyclomatic 13, cognitive 26): waitForDevServerModules has cyclomatic complexity 13 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":2228}}}],"partialFingerprints":{"codehealthFindingId/v1":"328228c80b2076e75c5cbd49bbb7fa2e06b21e7c9fbcbb1d864a967760ec572c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pidsWithEnvMarker (cyclomatic 13, cognitive 23): pidsWithEnvMarker has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/live-server-processes.mjs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06f0a025bc6f0242519214ec6ab5af6f31d61be48b38686e042ae795f8ae95a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selfCloseHtmlVoidTagsForJsx (cyclomatic 13, cognitive 23): selfCloseHtmlVoidTagsForJsx has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d479119da4cbcf3c2f97d4543752aba6612148f43819f4d15e22a8ae6c58fea4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripInlineStylesPerElement (cyclomatic 13, cognitive 23): stripInlineStylesPerElement has cyclomatic complexity 13 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"df17a686d12dfa793cc23c0f855d2f5a532acf9db3f2aef77ebcff1e3e9b14d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitInlineStyleDeclarations (cyclomatic 13, cognitive 21): splitInlineStyleDeclarations has cyclomatic complexity 13 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc63d60c4b8f93320938ef07cc1379b792705d5b2e44dc06945ceeea250733bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSkillFrontmatterVersion (cyclomatic 13, cognitive 20): readSkillFrontmatterVersion has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/validate-plugin-versions.js"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd3d3f5d05da058e986ef1a1484a008bade986f555097321ea00f0be6cceea6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function objectKeyMatchesForOp (cyclomatic 13, cognitive 20): objectKeyMatchesForOp has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a37da49499ee688ff701d6147ee238338ff69a403b0ba7c09f4959babbe815"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForServerManualEditStashCount (cyclomatic 13, cognitive 19): waitForServerManualEditStashCount has cyclomatic complexity 13 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e152772b0700c43a7cfc01a1a10646a4c884b1f52cda6659ee3f05edcb9601"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectInsertAxisFromStyle (cyclomatic 13, cognitive 17): detectInsertAxisFromStyle has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68dd84692f0f2d216bfdba27afda1f2cef82c3e5a362de36c8cce772f29d89e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 13, cognitive 17): tick has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":7372}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b0f1d9e38237d9f4307bc54d06b60188c0eff0680220d31c1ae12e92d2bdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitForCyclingRobust (cyclomatic 13, cognitive 17): waitForCyclingRobust has cyclomatic complexity 13 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/preactions.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3265673138953ba8928635a9e9cf9bcafdd11c2c7706ab8f57cca07f0a598180"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/content/content-script.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a861d5c58bb8e5cd3c57ff6b1e72ad96a52e9e4f6c914e2d9f14149cb81fc7c2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 13, cognitive 16): main has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/publish-platform-packages.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb31f7c40b9e553ec50d8c956edf8d2107e8a1d3721fd4b8384a45ed072b155a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncPageChatChrome (cyclomatic 13, cognitive 16): syncPageChatChrome has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10758}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98e65509e84bc59443beb0da5ef4da05e24fb27ed66c9ad7fbf7422e206a692"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderComponentTiles (cyclomatic 13, cognitive 16): renderComponentTiles has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13468}}}],"partialFingerprints":{"codehealthFindingId/v1":"de258f4f497dab981a85afc15dfdba8d4c5c8438fc14c94fb5d804ebcbee788d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildInvocation (cyclomatic 13, cognitive 16): buildInvocation has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/lib.mjs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6f23f8612c3791203379678d6f8a877a2d357d8b0966bc16d8d4ecfab7592f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPendingTrashClick (cyclomatic 13, cognitive 15): onPendingTrashClick has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d910252e7c8a58450c64684ca6e06930a25580ac4e166ed9bcb4c08f6629ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceTypedNumericDisplayExpression (cyclomatic 13, cognitive 15): replaceTypedNumericDisplayExpression has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c3b17100fce242685edcb10f243acd06748c0a2c515f1f54e57c12e3efacde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findInsertAnchorInDom (cyclomatic 13, cognitive 14): findInsertAnchorInDom has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2173}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d18617f9d689b9e0d9761564b7b48199bc868ccd0393a8e03b3c377e3112c4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySteerEdits (cyclomatic 13, cognitive 14): applySteerEdits has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e4e4bf29a296d501b49b17ebdc977b45060fedeb6664a23382827439a0406e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySavedSessionMeta (cyclomatic 13, cognitive 12): applySavedSessionMeta has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9784}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a21d82f9b400006668150130a69362e8e16be260b15ab950668d625ce45ae7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function safeResolve (cyclomatic 13, cognitive 12): safeResolve has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/harness.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c894792431b01a151da15d67488a0580c43806c6e2fbc0cde941adcd01b94f12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function shouldPassthroughElementNav (cyclomatic 13, cognitive 11): shouldPassthroughElementNav has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8369}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf05b43c3fc05a549b7fcbf16c86b06078885b06de1680d69bad3a140376472a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dt (cyclomatic 13, cognitive 10): dt has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3a062fec31482ea38d758128b76f560c7f45045eca326812aaa254ed814966"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleInsertCreate (cyclomatic 13, cognitive 10): handleInsertCreate has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8609}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92823596ffcab424d49b0ecf883a5120f3353ac968def0edaed02c26589e10e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e69040378d9bfc04e88f841473ec93548377f1f5a2d852fd8817fa487888df3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function beginFeedback (cyclomatic 13, cognitive 10): beginFeedback has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5daeeaff3425d468132ecff9d3b9b7ae561fa90829f7a99b870f67e65763cba8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitTopLevelElements (cyclomatic 12, cognitive 21): splitTopLevelElements has cyclomatic complexity 12 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4409e986e2b92c927714303a1cb2e3df89c6768e3e876c2b46725594e4713eba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeVisualContrast (cyclomatic 12, cognitive 18): analyzeVisualContrast has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/35-visual.js"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3907133e07ca0a3c05a7b3d7b1ff73a9d4e4f8699e497c0d5ad138f8611c4d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function it (cyclomatic 12, cognitive 18): it has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c5f23cb2a80385a6a5e50e4879ba12a4d91a290cd22d2b479bf2bd950e3d2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractVariantCssChunks (cyclomatic 12, cognitive 18): extractVariantCssChunks has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8988d0e8f20f1879b78ece0cb6ec6df9c400355c5107453c6dea587c72d7d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stageFigures (cyclomatic 12, cognitive 18): stageFigures has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f523c21a8b4706625633fa548344cdfac9e75f2614d6a8502490ae3e6cbf97"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadEnv (cyclomatic 12, cognitive 17): loadEnv has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/providers.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"06527c471cb0a8d21966129521a0d00ba96648539ab0df547ee67ca067ca8f54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function queryManualEditRef (cyclomatic 12, cognitive 16): queryManualEditRef has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4694}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4f709b93199490f58df3c4ed0e1d65974cee4ff68435fb26c6d15d994cd795"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5757}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4eee993436a1388f9ae1506617868204eeed3b9f8319915eba6cf79f9bc8b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeWatchedSourceFile (cyclomatic 12, cognitive 16): writeWatchedSourceFile has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"136227af9057f7c0dec2089dee153ff51c365b6251c99e66ee983ca574263581"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Xe (cyclomatic 12, cognitive 15): Xe has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bea25475de851100b671b1bbd1beeba51d5a02757376f6f2d9ea490a04a7a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateBarContent (cyclomatic 12, cognitive 15): updateBarContent has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af43f1f8f1cb79c033dd375008ed5a978a08a8a5803a4d27ea104861c767220"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setComparisonExpanded (cyclomatic 12, cognitive 15): setComparisonExpanded has cyclomatic complexity 12 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9409891764a09ffe4c7ea6eb499ea589180a849a37b812cdc55c17c7f16c41f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup/popup.js"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f4eceb8ba529966dd4412dc6fdae24250bf2f752f01b6cfc8601dca53aefbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function placeholderSizing (cyclomatic 12, cognitive 14): placeholderSizing has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55ca3661a1c63a6b764acfe5aaa45921cbb03c148a6ebe671cf005c4b02b697"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nearbyEditableTextsForManualEdit (cyclomatic 12, cognitive 14): nearbyEditableTextsForManualEdit has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af24e404864bcc9a065e097ab448f3789e8338ab757a2b0882c0c407f3aabc2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6689}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b4bc9316aed92f034dd01d1a72d10f0db41a15b1b7ebfb293845f20d6975af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ut (cyclomatic 12, cognitive 13): ut has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fd436fd82e24f3271984c3118c9b98e25d1ff7ace7034e9db3533380e29ce3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function positionBar (cyclomatic 12, cognitive 13): positionBar has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4dae9e75e661f7de7b610b43fd77e5f11a5c3f965338c85afcabd21ec97095"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 12, cognitive 13): check has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3611}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ed6cc5701ce9051eab0b70154f6c0f8be5df4ce41d29bfac97c1191d9e1526"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function removalOriginalText (cyclomatic 12, cognitive 13): removalOriginalText has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24cc8d1fd6d034f0449eceb08a43d28cc3f9ce75590be0c2fa8432877c03290"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshLiveControlsForManualApply (cyclomatic 12, cognitive 13): refreshLiveControlsForManualApply has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de23ffd8f7502dcadefab28822ac4c531b7409bf80db923fb116c8ad1704e0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncAgentPollingUi (cyclomatic 12, cognitive 13): syncAgentPollingUi has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11807}}}],"partialFingerprints":{"codehealthFindingId/v1":"011e201a88f0f817a5483be4e1cc2bcedad233b8d53da1c2950f11e1d6ca0d9b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceTextInSource (cyclomatic 12, cognitive 13): replaceTextInSource has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"51eeca43ed213681124ffca0b94bec4617faffe25ce5092a2b6aec3fe400037c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sourceAlreadyShowsAppliedOp (cyclomatic 12, cognitive 13): sourceAlreadyShowsAppliedOp has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c806288392750231056fa60d006c7915cf99cc5bcb19d0cbbece65e6639d5cf3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCase (cyclomatic 12, cognitive 13): runCase has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/lib.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be68315a0134c32097a82409055be6dd8f9b2118ae961a58c6de3d22ab2cbd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function layout (cyclomatic 12, cognitive 13): layout has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7b954e1ee3ab984f4342e2b2c0605bfb2689b7f8145a2770688cdd9b55d7bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a819fa6eb99ae52180555b17570a5c457aca0f0341d0d7a87b5ed672257594b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncEditBadgeHitProxies (cyclomatic 12, cognitive 12): syncEditBadgeHitProxies has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4885}}}],"partialFingerprints":{"codehealthFindingId/v1":"d167ad50b4337f509a42ed1614b1b5078338b010e615bb5370d162790aed8a8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleAccept (cyclomatic 12, cognitive 12): handleAccept has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9472}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b48bcbf023fbd198ad10dcd3e80795e5c10c6cc132cd2ea9fd9d27e28bc51a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"9695d1c4f9e1e8c83f9cc2ce95f6464f735886c2990ff0559f82f49a6a125307"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSourceHintLocation (cyclomatic 12, cognitive 12): validateSourceHintLocation has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2856f2678efe11fff4a6f8bed6e09e03b4fd48cafdbe0875a274e47103182050"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseManualEditResponse (cyclomatic 12, cognitive 12): parseManualEditResponse has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3643bc7a8017f53dac078ddfa1a370796689fe31419bea3b3edc86f381cbfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveSession (cyclomatic 12, cognitive 11): saveSession has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9985}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b7f8fa6eb4ac51508a567999940fbb7b475bd9254961e6cd48758b1ac32129"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSteer (cyclomatic 12, cognitive 11): handleSteer has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8c6c62b696331a21fafca1e7087479f8abf53988ced7a60ff2760d91700eb0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function defaultSimulatedAnswer (cyclomatic 12, cognitive 11): defaultSimulatedAnswer has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/skill-behavior/harness.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6876c4d1abe7fbf279f6308ba748fbcbec3c3f0307b1344e67a8fed2b3fa0c11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a438e14016b0cf95ff6308cb05131a23bae9e8d44f29f39dbebd8162b11b5cc3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/popup/popup.js"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05fcd2daa979da2c510a0c101ba7327cfe0579bcf15688de6f69373a94fadee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function generateVariants (cyclomatic 12, cognitive 10): generateVariants has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7aeab204c66c7cd3e790bbf1a5126f3437a20a1899cdcf7d36278df2ba5a77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/model.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac7faf81785c2377ab1047efe433042c8bc7ce1695f204c48993d6209289a2f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertNoSpecificFontIgnoreConfig (cyclomatic 12, cognitive 9): assertNoSpecificFontIgnoreConfig has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41d4558d99016249eab8d3e965a6d09102f2580a655a255fbcab06e68911368"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function insertTargetFromEvent (cyclomatic 12, cognitive 9): insertTargetFromEvent has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bace5ac43c5cf15f6197a28fdd9df700a8c69381f26d6575195292c74e33d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 25): (anonymous) has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/review-theme.test.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"174fcba90f262fb6d23da91591f13b9282c5c8739811008b13f163c858df431c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 20): (anonymous) has cyclomatic complexity 11 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures.test.mjs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a069fa738ed252c9ba03a0d277113adaf97efad93e73ecc8db5f97ad55786d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function __collectTextRects (cyclomatic 11, cognitive 17): __collectTextRects has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/10-probe.js"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b60c68f3a2372b6e469b51389d5ec0ff5ac817185da6c6cd5388651c3e709bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreDiscardedManualEdits (cyclomatic 11, cognitive 17): restoreDiscardedManualEdits has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4607}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f1866ab1fd65cc1bf16c6d22d6d71f7ff99d9404393981e3494fd02494cde1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dcc859417384b50d76690d8052dbb0bb0cac7e5623ec5bb755dcc82d0b3caf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceNearLine (cyclomatic 11, cognitive 16): replaceNearLine has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb1290de12a89ed47c8073192748dc77625a807a44017c5c5d3d761a107eb8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runScan (cyclomatic 11, cognitive 15): runScan has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/60-offscreen.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad0d206196f6df35275c6f2bfed1aab07655ae80ffa81aed7be986696a1e700"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stripManifest (cyclomatic 11, cognitive 15): stripManifest has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19a9e10d35a436f90c9a910d7c603770689d9aaf1b803c1c35cb0aecfb64445"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onAnnotUp (cyclomatic 11, cognitive 15): onAnnotUp has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d28d83d150688b51eb20a19b4e569e5fc58a89189952fd5b0b6fcf7f6324b9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderEditBadge (cyclomatic 11, cognitive 13): renderEditBadge has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4961}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a08c7248cb73c4eeba4707d3b043b1ceda7eb0d286f89e0673ba456c11f001"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function paintsBackdrop (cyclomatic 11, cognitive 13): paintsBackdrop has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dde604dc8a6c65e8af0f54832b3b3eacba04eb058fbb92f7643398f7e6cbff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncPageChatFocusRing (cyclomatic 11, cognitive 13): syncPageChatFocusRing has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":11034}}}],"partialFingerprints":{"codehealthFindingId/v1":"1283824b169bdb879d1997e4f3a99d5406ce13632739e77eadeb405aa88a20e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateProgressiveVariantOutput (cyclomatic 11, cognitive 13): validateProgressiveVariantOutput has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9ffcf8191fa97dd432a5c88d7ed8c75b71a01b780cd0fed88acab70c23a2c7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateCoupledSourceKeyEdit (cyclomatic 11, cognitive 12): validateCoupledSourceKeyEdit has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2338ac0b563df85ffe4246fe86265e9f7bcb5d2564d81ce185392d902ceaa8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function elementMatchesManualRefSegment (cyclomatic 11, cognitive 11): elementMatchesManualRefSegment has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4730}}}],"partialFingerprints":{"codehealthFindingId/v1":"6211c9f926dbd70f7c0892e42e89e30343a4da2811cd30102ce8f3c6749ef97f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderTypeTiles (cyclomatic 11, cognitive 11): renderTypeTiles has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1d700aa5a938c0607dac57047d5f94ba5456b898711838fe612c514cc7265f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addVisualContrastResult (cyclomatic 11, cognitive 10): addVisualContrastResult has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"463802b49b3933a8c5626140ac773e03b55f41d97e6c11ac7cf5a649053ea953"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function kt (cyclomatic 11, cognitive 10): kt has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb860a7ace10984f2263e42c08f301cd9aade5a8d9856482f6868432d4d2ad0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findManualEditRestoreElement (cyclomatic 11, cognitive 10): findManualEditRestoreElement has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d899e481747bf273001d3fffbf2fae3450c3dc456103e7804f2c1239f0129f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSvelteComponentParams (cyclomatic 11, cognitive 10): loadSvelteComponentParams has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded1510908f3aa3dc2aeff00c9fcd2e53395e31a54d931268d4ac1892c3e3a72"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function synthesizeNarrative (cyclomatic 11, cognitive 10): synthesizeNarrative has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13290}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdf03a1cd81953efe5141086d659ac2acc19abaee7a693a385ff6d05dced213"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lib/transformers/providers.test.js"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed17a13c4dc2b2055f1b812b3f78a6098540cdef4f71b5faea8bcfafbc3e2ede"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aa7b1cdc4be8d17c34be79529dc1bab16fb45929cd6c6bddbf2029c0e9629c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replaceNumericValueForContextKey (cyclomatic 11, cognitive 10): replaceNumericValueForContextKey has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agent.mjs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7f18008c3bd4d4a963f57545b39719fcb2a6bbcd5086456fc05f46c3f22774"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/ui.mjs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2b60b7ec843c2fb00a49310a6ca886e95d19b29f342dedd59058caad2b0aff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new-work-e2e.test.mjs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"966f2c0af59e8fbea83ae5f9c60ef8374baf6afc49a4e8bad1bb7e34d2e9cf02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairStatus (cyclomatic 11, cognitive 10): repairStatus has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/model.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb832d0f2ad32a626da213d9a49e8c8077370e6c1b51d82d8cc87a27a436a84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Xn (cyclomatic 11, cognitive 9): Xn has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f434a54c2f89ff170e8fd346277defe1ffb8f5616a2bde5aedc51aa632c1703"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getChangedFiles (cyclomatic 11, cognitive 9): getChangedFiles has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci-test-plan.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8f0b26a3b11a0da4fc113925cf4d74f21e3a30cca89e2b6a8712feb6c693a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureInsertPlaceholder (cyclomatic 11, cognitive 9): ensureInsertPlaceholder has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4b6711b17f7b24d7b636d1f441ffb79e6b6f158e0cb80a42776dcec2888746"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function syncPageChatSendButton (cyclomatic 11, cognitive 9): syncPageChatSendButton has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10796}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4d9513656f8e6f05bcc1c787d697ab623fa3ba65fc226b481fa5ae1438ab2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mountPlanReview (cyclomatic 11, cognitive 9): mountPlanReview has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b127ae78716a88746a0f18c826b08d565b4d5f00279138afc6a05ae343c2af"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/context/assets/component-review.js: 1469 lines of code: crates/context/assets/component-review.js has 1469 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af27fa6610f20fa673a20aaf8f33d1b0f03f3bff03f9714aa87bf495f2a93730"}},{"ruleId":"R3","level":"warning","message":{"text":"browser-bundle/15-snapshot.js: 987 lines of code: browser-bundle/15-snapshot.js has 987 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5df0d1c53a470064e656a71173f5b79fcf29c50e08a1993f93592df54a39ad6"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/component-review/plan-review.ts: 605 lines of code: ui/component-review/plan-review.ts has 605 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-review.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ea1924fdeb74d944be3371e06e25069e01d58b60e32d9ea4f461f7177b9fe7"}},{"ruleId":"R3","level":"warning","message":{"text":"browser-bundle/40-overlay.js: 582 lines of code: browser-bundle/40-overlay.js has 582 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/40-overlay.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf17478f0203242142388a17ff776aa40a6a2878e322fdfaadf92bd4d254327"}},{"ruleId":"R3","level":"warning","message":{"text":"ui/component-review/review.ts: 457 lines of code: ui/component-review/review.ts has 457 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/review.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7058a6342864a27f9fdba149f6dd9094d624dd9de996b25069f4001bc9515694"}},{"ruleId":"R3","level":"warning","message":{"text":"browser-bundle/50-scan.js: 438 lines of code: browser-bundle/50-scan.js has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e7def7d0d61dcf7ca29f045020e2a80c01a3eea42e18609c2d22f5c9d8bc7a"}},{"ruleId":"R3","level":"warning","message":{"text":"extension/background/service-worker.js: 416 lines of code: extension/background/service-worker.js has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fac02019caffda7c56cd370fe7a00ae38361b7f9d5457eb159042d42b3087d1"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: scripts/smoke-provider-hooks.mjs:15 imports \u0027./lib/cli-args.mjs\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9118d9b2cb442b59c8bc7d80477b90588f05937994664d8431a5b8e63822174"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/framework-fixtures/tanstack-start/files/src/router.tsx:2 imports \u0027./routeTree.gen\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/tanstack-start/files/src/router.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee782a0d04b683421ccfbaacae194920572ada3e0391c49fb015d4b5f50423d6"}},{"ruleId":"R4","level":"warning","message":{"text":"This test file cannot be loaded: tests/workflow-security.test.js:4 imports \u0027../.github/workflows/\u0027, which names no file in this repository \u2014 and no rule in its .gitignore chain could cover one, so no build writes it either. The import throws as the runner collects this file, so none of its test cases run and nothing it was written to verify is verified. Restore the missing module or delete the test. It is excluded from the reachability measured above, because a file that cannot load reaches nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/workflow-security.test.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97c6f8bcf075ad41ff674ec24e09840abaf561251da9678c9b15c126e43f10f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd60e3ed169fd181aa5937f2674505261ed95d34488a82726f4c4b053adf3f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/50-scan.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5dc05665a8a0b4176e6162a9774beef9140a9f6235664f45edd8a13a44bb1d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/raster_coverage.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccce7115565295d9ff187a163421c620db586ab124c87890caf49d99535f81f0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/35-visual.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b604215b9f44a78820f4f22d16486b25cd82887a1223267859c8cbbd05471d1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ext-diff.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f4bdffdff6a4734b95d79a825bcb630c4cb99f1aae1ade3f5410f93aa3eb82"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/disabled-values-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a28999f58a9fe601366dfcac0b168a561b0b1cace96c2dba7670e3569ce3780"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/skip-scan-check.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a27a47f5735e8d6413d2dcbb280a1b68c896abbae547f118ac9ea266353124"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ab-diff.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51f150e551b671f38b9827db5d5d3776d8b82efd6b33154d97346c157414b2b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/05-natives.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"749eddcc49ce378137a3a3badcfe5786c195b3ca31b310426347ce7c83d6aa3a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/snapshot-diff.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ce8313269416cb58a604ea0329b049cb09e85f2dfe76be46e925968e4b754d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/asset_capture.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ba177ee215decbe934c4fdeb4192ffbd0c2b56146cc4812aa052fa25456a9b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_isolation.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d8e86b38ce7c24b3ac380de2fb317b699dec901ed39b5c180444fbdef900ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_bridge_helper.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc2d1fb040b1b3e0f98c3c4125ea1ec55ae117581b5bac81895c9793b2f5437"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/30-scan-common.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb38360f550db8ef325936dfd7656f8b25641b9ca1b78525849aef5a406fcdf1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/component_fonts.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f786e4ba141ccc8e0a13b73de00a8b6aed6074366982dbb8e7a490ec60ea8ff4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/99-footer.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"070e6bb027f70fc4b9f1dedb7b2fcead8266739fe1beb95a71039b412a39d8ff"}},{"ruleId":"R6","level":"warning","message":{"text":"The declared test suite includes a file that cannot be loaded: This repository declares test tooling, and the \u2713 above records that declaration \u2014 but scripts/smoke-provider-hooks.mjs and 2 other test file(s) in this workspace cannot be loaded at all: it imports a module that names no file in this repository, so the runner throws while collecting it and none of its cases execute. The wiring is present and the suite it points at does not run as written, which is why the tooling tick must not be read as a statement that the tests pass. Fix the unloadable file(s) \u2014 each one is reported with its failing import under Test Coverage \u2014 then the declared script exercises what it claims to."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"819f11b094f91d0aef8bfb99083468fff75e305c2da2dbcc068ebb0db9a07456"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~461 LoC): no import path from any entry point (188 application, 83 tooling, 313 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/background/service-worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a8a3460deadab3b0d45a86e9cb5f8262c8f68c1b9de1139a212f72ba0627ec"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027IMPECCABLE_HOOK_COMMAND_MARKER\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lib/transformers/hooks.js"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec113bde1e73fefdafebd857ded8e2a47ff620ae026d6392572a7927a65708f7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027assetKindLabel\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/plan-model.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c441d17772dc2f4bbbb91e442c8931a853b33b3ba52f584476010cebdd853323"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027copyDistToBuild\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build.js"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24c738b59d2d6899bd0f18ba2d52a515fd42563e243ebb349e3e32452d2214c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027providerTestDir\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/lib/transformers/providers.test.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1199beca3d8f14f11767515ca98ae66608c4f73665623c5040c47804be881c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027countSourceVariants\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee6101c67cc9d2496f805478fb7620fa6572fbf824a87683a0a59ed85c45b1a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027escapeRegExp\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39ac16390241a1f8722f26a160299fb021d7189e8890218608f64e98a8fddf7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027waitForGenerationTimings\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"3090d3b8af6f634ce751d88305803722d8d44d014a1f1ea483c9c144ca46428c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027clickPickToggle\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e.test.mjs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcbcc738ac35df959236beb2859f2e7bb428f4c9916c852795e8388da04dba6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PICKER_ID\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/ui.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a018b383f05e0406f9232175a996615c81e3b61b420f32e3291c5fab6349c9be"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027HTML\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/cases/live-accept.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c1448fd6d199c971abe61b962db0468cdafb7dd626f4c5898c5799083455e0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027JSX\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/cases/live-accept.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c003c7d271a423a639a8081bb6ccc8a260e8957b3f08000da0f3df902d4099c5"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@anthropic-ai/claude-agent-sdk\u0027: Declared in the root package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ec68cc7298a33cdd91e96073d693b26e97756c3715f88b1818d190f6dbd4d093"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027hono\u0027: Declared in tests/oracle/workspaces/ctx-monorepo-tooling/apps/api/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9cab6d8e5763f12a3a5b66bedc195ee691bde3b0e01b28444b0c28fe991aa52"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react\u0027: Declared in tests/oracle/workspaces/ctx-monorepo-tooling/apps/web/package.json but never imported anywhere in that package or its workspace members \u2014 while tests/fixtures/antipatterns/framework-vite/main.tsx DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"01097bf97a0c6b2b8b30d887236ff2033836412fb4325232a2141f19bcc04ca5"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react\u0027: Declared in tests/oracle/workspaces/live-next/package.json but never imported anywhere in that package or its workspace members \u2014 while tests/fixtures/antipatterns/framework-vite/main.tsx DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"99fbef38ec11439d8f10e01bbc12bf2789a7018c9bc4b888a888de4cc4ee89e2"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react\u0027: Declared in tests/oracle/workspaces/live-tanstack/package.json but never imported anywhere in that package or its workspace members \u2014 while tests/fixtures/antipatterns/framework-vite/main.tsx DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cefbe952e1a43d7b86a65b764cd589d21b3804bd1ecb2baee79b1ba4571e0947"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react\u0027: Declared in tests/oracle/workspaces/live-vite/package.json but never imported anywhere in that package or its workspace members \u2014 while tests/fixtures/antipatterns/framework-vite/main.tsx DOES import it and no package.json above that file declares it, so the import resolves through the copy this declaration installs. The declaration is misplaced rather than dead: removing it breaks that import. Move it to the package.json that owns the importing file (or, if the two packages are meant to share it, hoist it to the workspace root) rather than deleting it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9b8d59c50f0b4b818ae99716d5779ac71c3fa609f50e14b6fcd4a9f11e5db745"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf052fdabbef4c0a8bfeda1fc897e74be6f726e5351449b02e9290db30a524dc"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/font_match.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b0462fa052c2881fe6ea532583c7afd1403df5d79e89fe97be53c808fc69c0"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_sessions.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f7143912006f1d242122035d3d7e784d4eb5c61805eb21d0f2e1ee1b38cc1e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: demos/landing-demo/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"demos/landing-demo/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eaae8ba6de74ddaab8398c2229e1c4fba8b043efe2a315c097440e5fbc05199"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/astro-vite7/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/astro-vite7/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b8be09b6bb8c04ccd0453904cd474af537b471f42e5c4b21ec286a497d0be3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/monorepo-nested-vite/files/website/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/monorepo-nested-vite/files/website/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6241bc8353719cfa3db8738702fa219abdc216a7baf9939e2ef4bb348f4beb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/nextjs-app-router/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/nextjs-app-router/files/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47bb7e152934acfe35f4a186e9cfa8196698ac4439b6ba5503c9f5ae8859691"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/nuxt-vite7/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/nuxt-vite7/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb40d190115af14158611a926d800dd3a18b3a361f16c7549f6f5160dff398c1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/tanstack-router-vite/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/tanstack-router-vite/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf25a4d03cd85412715e7994b13decc2474469dd8d9d4a9b980c69aaefc8315"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/tanstack-start/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/tanstack-start/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1a3b972c87a38374acb5c0e6e74c01a958b0d9c4ad0f70d305eaecbd9ecf67"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite7-vue/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite7-vue/files/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b7bfb52e40c41cb716fd9c1d2b11837ffb0945302cdacfd28570d232037ad0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-https/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-https/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ebcaac67c0f7e941dd48292149ce843fd2374c4a6c32e9e3821a3d8f4add57"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-base-path/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-base-path/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3d1fbe812adf893806749451e24aa03c9e31740ee3ac8ffdce21e1298a32cd"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-csp-meta/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-csp-meta/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"943ed274b88cc43213c327c3a66e2c9d3da8cc9b52abc5685887507f32f2f86e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-css-modules/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-css-modules/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"752551019a72325cf1de34f595b9cb458bdf5ca980e613ccb0e4322095cb4f8c"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-emotion/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-emotion/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1f55811f6d22f7396bead1eef1c05b692a87301f48e1b0dabe90f0f6887da2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-insert/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-insert/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"96390aa1084ef88c65228bc588f801b6ba455d74768d4487185149bbb06ad162"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-mapped-list/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-mapped-list/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb13ce28dd1cdc9608d840d6c85b056ac81f947c4dad3f90be35ac3414353f7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-modal/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-modal/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c35522a5d4519e7520afadf204d984b2f63c86887f8abd06d29cd848aa2acc4"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-plain/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-plain/files/package.json"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"b025fcb3af1018ba26b810eb51eab505ebec15f75570fad3cc845dc1eccdbcfd"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-pricing-cards/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-pricing-cards/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5181392f1ef376fad8629cc29db8066198216fe17f8d4819dc8adc2d7f82e59"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-radix-dialog/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-radix-dialog/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdbd16475cd285c8195fe31e534328a8f3df857fb79744622ec5b9b79d4b6d78"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-router-spa/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-router-spa/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebaec9487c67d9d58b7cf5a438bef625d0efc103759eb6e646788fc7035cc291"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-styled-components/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-styled-components/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5045385d68a85553d875cead9eaa5d8fce7f3289c15cef8fc83257cb46e3eab"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-tabs/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-tabs/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0c175fb054b8b9baeab7e419d1bfcf39a078168b6b60ef2553688e5da2073e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-tailwindv3/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-tailwindv3/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9252107921229a2aab94ae0954fb2bfc1420a9d82ae0f245c33e1a0df3500863"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-tailwindv4/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-tailwindv4/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6526129165a8d4c896533d97ed18f5316be850a8d006dc4925f1c7d4aac99c65"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-ts/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-ts/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7c7feccdf166459b640555adbc34e37b7fd2d7145c2516b59bee45ade798c7"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-tsx-repeated-aside/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-tsx-repeated-aside/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aad5b3c7ef4d41a5e1d54b612e67e55812987826346911cdda8faefe5cb52a"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-unocss/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-unocss/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7b844c3f6d55e61e9ca2328bbcc88acbdce4eecd151a2c935ac53060746fc3"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-react-vanilla-extract/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-react-vanilla-extract/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf2b3f6469dd096b770a726ef4e9056e4d8f00964c4db836d0a23abe92f8394"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-sveltekit-stateful/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-sveltekit-stateful/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8bb3d2cb15269279a75fef58a8de1b299c84137989f57cc281232198db12ad"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/framework-fixtures/vite8-sveltekit/files/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/vite8-sveltekit/files/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"961f8fad11a18411a6d72fca8acb1518b80b01c4bd4e3c2418c365dc7dc4f6ba"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/ctx-adaptive/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/ctx-adaptive/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d85bcf0a8ec8c1b5db36cd0c44aca482c7793b46ad2ea08fb5e206ccb1da893"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/ctx-monorepo-tooling/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/ctx-monorepo-tooling/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"c752952654597c7128cdd76cb5e6e85771f067ca08b78f51ea9638f2bc275a69"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-astro/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-astro/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3649e60c70998d575dcbb1e1b14443418e309f6d42acbe12e2656ea948cbb0"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-monorepo/website/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-monorepo/website/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd7e1492372c915f2df744165db661b3dae24f8a861e71a3b245e4cd7de0df6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-next/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-next/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa622089ac70f4c4058bb6901d9fae973077f3ae4de27d8f6ddad56f7a08ca2"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-nuxt/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-nuxt/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c06b2b7666a8cb619b57f936660ee0811269646fb41fb2c833c9b52fbb3ab8"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-sveltekit/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-sveltekit/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2f0ca2e3c9a47b8ed64858625ba94dcc2d690e20f150a38918081be5186912"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-tanstack/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-tanstack/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5bb81cc908f5466f7a574e433e8c200cf93750a494e795b04988601db02259"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-vite/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-vite/package.json"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e26e0ad785b6254f87363ffeb17d1b524e2c3ef3f55877b507fac7487d3a78"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: tests/oracle/workspaces/live-workspaces/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/workspaces/live-workspaces/package.json"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d71d0d566c30d91d0c07f66ae4df6b2f860bcbe69133efe7a65d586cdbb08e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!btn \u0026\u0026 btn.getAttribute(\u0027aria-disabled\u0027) !== \u0027true\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4045162a1d78a9714f6e287afe5e42e47a6b86afe24a949238194922b726c231"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!currentSessionId || (state !== \u0027IDLE\u0027 \u0026\u0026 state !== \u0027PICKING\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7061}}}],"partialFingerprints":{"codehealthFindingId/v1":"2824f5d0581f90ecde42de73c238dd696ea0977e839ceb7ce61b2f448276eb6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!el \u0026\u0026 el.parentElement \u0026\u0026 document.body.contains(el) \u0026\u0026 !own(el) \u0026\u0026 !el.closest?.(\u0027[data-impeccable-variants],[data-impeccable-carbonize]\u0027\u2026\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9276c096f3551a3695db4837162f5ad63be85f0ac7101b803aab01706dbcaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!rect \u0026\u0026 rect.width \u003E 0.5 \u0026\u0026 rect.height \u003E 0.5\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-dom.js, .agents/skills/impeccable/scripts/live-browser-dom.js, .claude/skills/impeccable/scripts/live-browser-dom.js, .cursor/skills/impeccable/scripts/live-browser-dom.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":".agent/skills/impeccable/scripts/live-browser-dom.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"60023dbd46d2dfe6d1932af8e27c3ca1e0140e495d00fc200971b748ba7f07b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!!wrapper \u0026\u0026 wrapper.dataset.impeccableMode === \u0027insert\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8ce68220c48709ba2e2ac22bf442cc96718677253a24fb64045500e92f6fc0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(rect.height) || rect.height \u003C= 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"c524f1520965ae6520ac4dd8c0b4cf24bfaaa626fbe41f82b418ebed01030255"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(rect.width) || rect.width \u003C= 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e50560d0da41926b224bc7af8af3e0826b79be4d690dea8234ac0e5c7d0fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Object.hasOwn(saved, p.id) || !isValidSavedParamValue(p, saved[p.id])\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb70cd5c7300abb53bb253d30e58e47419b755368cb62026c10c501cacc121b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!active.has(target) || !target.isConnected\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4897}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ea638696638f4c8029bd35d8f911a4250fc311d48484bc4c966102262036ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!barEl || barEl.style.display === \u0027none\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"45102a5551726c260911691799e340ff195822ca771d8a52e4725fce6d0e93c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!candidate || !candidate.contains(leafEl)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6cf4209e4cba952b9df7cfc6271090b7fc2250b7ef6733fcc97efca5aeeb7a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!candidate.id \u0026\u0026 candidate.classList.length === 0 \u0026\u0026 candidate.children.length \u003C 2\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b902bb1d2ea6395cb7523d17ca1ec7867111ad4440d31facd87d26795849011"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!child.dataset || !child.dataset.impeccableTextWrap\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e6646f1e3ae860cc7dd2ef46185a1bc98d915cfe888cc8b2a41d3e43ef4e16"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!cls || cls.indexOf(\u0027impeccable-\u0027) === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3786}}}],"partialFingerprints":{"codehealthFindingId/v1":"898022a1697a15860b45f2514c35b634fc57a3c93c08e047c3d849a013d3886f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!currentPageCount || currentPageCount \u003C= 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4349}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e14fa03ecde76a18881c35a9bf7ccccfa10121ea52ea2f63b3509c9425a852b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!currentSessionId || arrivedVariants === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9487}}}],"partialFingerprints":{"codehealthFindingId/v1":"add80d211ae9a3f2816ee7526b3cd4152a70afa57becc2b1718dcbac2e0e6abe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!currentSessionId || state !== \u0027GENERATING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09536ff2c5f2e3b4e424e0c756d1cce5ef5d45a578b1123bf23a3b0400032ae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!e.data || typeof e.data.source !== \u0027string\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f389bee076ac61c75b52aa978b0226ecdec8bb1a420d991ef05c32850d0ba07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!el || !el.dataset || el.dataset.impeccableTextWrap !== \u0027true\u0027 || !el.parentElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4637}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a89ee1d550d2fc906f1333bd43003fa5dec40efa642131a3729f9cca39d026"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!el || !el.isConnected || state !== \u0027EDITING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3639}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d44728c8762f8c6fb8f32dc2a78e0eb61e1c6b6c9cd655903cc6737aac266b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!el || typeof op.originalText !== \u0027string\u0027 || !canRestoreManualEditElement(el, op)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4617}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87a1cbdb7185ee4f6d0061a7dbd4122a7c68bc5431071c98f2423289413b92c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!el || typeof op?.originalText !== \u0027string\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec36ab700a2c399cf9b8d48b483aa853d94325dc7d381105b846016835d7ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!el.classList || !el.classList.contains(cls)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4735}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6651b9821994c95af097c4e297b96eb8f9d2d713746e33ebc5f14a2663c4ea8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!el.classList || el.classList.length === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3783}}}],"partialFingerprints":{"codehealthFindingId/v1":"690c6725c1123f67d0ab57af18aecc9f02b7033b44e015faa34d21aa02ceba0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!excludedEls || excludedEls.length === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5888}}}],"partialFingerprints":{"codehealthFindingId/v1":"088f7d61ec3679cf9b20761bf2b17fe7950c09b66d5e146dca4c6c85c5676a55"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!handledSessionId || !isSessionHandled(handledSessionId)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3eec7099571571387d34db763df5946d5aaf8f5790a17faae28fa3cf6cea6b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!hasParams \u0026\u0026 (parameterGenerationState === \u0027pending\u0027 || parameterGenerationState === \u0027loading\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b30cd3558e87bac562db33002c0bbb1d6cd3bd08dd8147c57aed506dc1dd73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!hasProjectContext \u0026\u0026 !liveBarHiddenByHelper\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2b0ff094713421f346de748d3d5ec8775eaf3feff7b855c9e4499ff0794d81"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!hoveredElement || !pickable(hoveredElement)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9556692d8dea9d2ca55942357e3e521058230f021043ed98139462ac9de56ca5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!insertHoverAnchor || !insertHoverPosition\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8246}}}],"partialFingerprints":{"codehealthFindingId/v1":"86637cb460cf6fbe2ae2639a81b8d8c99bfa60bfce5753141eb7af5e328b61d0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isTransparentColor(ccs.backgroundColor) || (ccs.backgroundImage \u0026\u0026 ccs.backgroundImage !== \u0027none\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9202}}}],"partialFingerprints":{"codehealthFindingId/v1":"70145d3b1c8f3f937c3ca87468dd697b107c3999a06a538fd27ca589f85d107d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isTransparentColor(s.backgroundColor) || (s.backgroundImage \u0026\u0026 s.backgroundImage !== \u0027none\u0027) || paintsBackdrop(node)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8879}}}],"partialFingerprints":{"codehealthFindingId/v1":"c323ff9e4f4c2240f84085b6eaa57f781ad3aed51db8075aa4b324e9bf4c4ec6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isUsableInjectionAnchor(liveEl) || !origContent\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0298cf6479829ea7a9698bcaa1d1ecce497cbf5f57414de2c0f5dd7a948cc93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!labelEl || (!force \u0026\u0026 b.dataset.active === \u0027true\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12049}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc4abbf5d94dc8994139d62c714b1d0e381a746ca5a2e7fa747bd67e11b03ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!liveText.includes(needle) \u0026\u0026 !(liveText.length \u003E= 4 \u0026\u0026 origText.includes(liveText.slice(0, 40)))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5362}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aa4dc41349f6b36ff10bf8044fef659b4252f74f64014975370b69b2540916"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!msg || typeof msg.targetId !== \u0027string\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d6f3a056799d5efb5cd7484b90c3d8fc97f93d3258599fa91ef73bfdd04dbd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!msg.repairOnly \u0026\u0026 pendingCount !== null \u0026\u0026 pendingCount \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4543}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b5af0f6de4d2f81b59562453d20234ecd1c372a33076b340485bb775fd3331"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!msg?.pageUrl || msg.pageUrl === location.pathname\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4513}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ea9caa6ce07bcd247da7ecd951900d729e726d62ef74f350ddd7d117848bf7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!node || node === document.body || nodes.includes(node)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8827}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55b9c5e96f5fcf4ff070d3ea2c669b5ba69828ad8fbbdb8c424bd0f2fdeaaf4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!original || original.tagName !== el.tagName\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6020}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a39d26457af463f8c9f8d7df6751ade21e5e8b1501e0dab7d73628b2b26a29"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pageChatEl || !pageChatInput || steerLocked\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2965bea662a3af422d759a687a51579d8286b30cbb026a1b53097db885cf0a21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pageChatInput || !shouldSteerAutoFocus()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11080}}}],"partialFingerprints":{"codehealthFindingId/v1":"49353f9b6d96567ec0e435c0244a5b0e70dc66d6dfbc598a0d8e52ac1a5eb7f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pagePointerGesture || pagePointerGesture.dragged\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10952}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cc8033422555218531b1496fef42a72f505877020e8c6bc4d28e37dff2debe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!paramsPanelEl || !barEl || barEl.style.display === \u0027none\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5098}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fdf04569397e451d2ae7c944efb23da93ceb6cc5610a6e54c16eb96044ac8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0027object\u0027 || Array.isArray(parsed)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5589}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5751a9d0cb16bec0e59807fdb5cd5b2fd4423417a9aca56128ffe0467c122b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pending || !msg?.id || msg.id !== pending.id\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9540}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7d557e20063d4d755dbe8d4d0da70164cfb4b35a47639238b319247e60e91a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pending || pending.id !== acceptedSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9519}}}],"partialFingerprints":{"codehealthFindingId/v1":"177171c52ef977145347a59c36cf17a0c5396f33d3b36e10d070818575237af8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pendingDockEl || !pendingPillEl || !pendingPillLabelEl || !pendingPillCountEl || !pendingTrashBtn\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c447c7694c8c2251cd544f76c7681dbbc596cc1d164d738353351b327d4d544a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pendingPillEl || !pendingPillEl.animate || (matchMedia?.(\u0027(prefers-reduced-motion: reduce)\u0027).matches)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad275efec4da6b2fd37e316b177b07fa7b2ae29737fe69db109fde6dd2d23984"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pendingPillEl || !pendingPillLabelEl || !pendingPillCountEl || !pendingTrashBtn\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4335}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ec5a8caa0f5bde1a460b55306e4db60150518eed078a4e76cf10d8db2680a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!placeholderElement || !insertAnchorElement || state !== \u0027CONFIGURING\u0027 || configureKind !== \u0027insert\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8610}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fa386d9c48fd312105609d9e5e997ff45485075ed389742b1ed1b0d3bd4408"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!preparePageChatInputForTyping() || steerLocked\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11171}}}],"partialFingerprints":{"codehealthFindingId/v1":"616d1bc16cc6d0414ec6a5eebe6d2dba9d736c932b64364670db520166adeb65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!restore || restore.kind !== \u0027mixedTextNode\u0027 || typeof op?.originalText !== \u0027string\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4649}}}],"partialFingerprints":{"codehealthFindingId/v1":"57daabe75e177100b67803ee66edcf84c9d5b11887a447f9598db25e702ab426"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!resumed || !document.querySelector(\u0027[data-impeccable-variants],[data-impeccable-carbonize]\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7c25bf39bf7f4ac0e1476af635ef980810cf7ba79deeaf5c750267b89b3d20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!saved?.id || !Array.isArray(activeSessions)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9821}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0bdb50f297e454b3e0d069648bd5206241ecda27e2a87b03c9532010f634f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!saved?.id || isSessionHandled(saved.id)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9898}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca766587abf8fd582f5602ba05d174f439135b66693526e4a98f8422389bb56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!saved?.id || saved.id === handledSessionId || isSessionHandled(saved.id)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e77a13952677d9cda786d4638b8d390801e6b974bd0053b1eb7b46068a377a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!scheme || [\u0027http\u0027, \u0027https\u0027, \u0027mailto\u0027].includes(scheme[1].toLowerCase())\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13777}}}],"partialFingerprints":{"codehealthFindingId/v1":"4874b57284bfbda633d850c9ded0d131b4b707a62cdd631dba1115fbe12edca9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!selectedElement || !editBadgeEl || editBadgeEl.style.display === \u0027none\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4948}}}],"partialFingerprints":{"codehealthFindingId/v1":"280fee5800b637f6ec4afc4161e344f82f3ce02f375d976002f8d29f82f9ad20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!selectedElement || state !== \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ab08e9cee73f584b2a6746b21fdbfc3233d381b39c01c867163130a2a15ec5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!sessionId || !isSessionHandled(sessionId)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4044111cfe8b066fa4fc0f5710eebc8c31bad9703b971b0604a3d1b2905cb57d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!shouldFocusSteerChat() || own(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10934}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56b9251ae852314b1c5420ab2e49e4b89c99375ac3a4e7b1832fdfe0dea1160"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!snapshot.id \u0026\u0026 classes.length === 0 \u0026\u0026 needle.length \u003E= 4\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2895d9eee5483e5b214ebc2e6e78c47cc66f255134e30eaaa70ae054c58a8848"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!steerLocked \u0026\u0026 (pageChatExpanded || hasText || focused)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10801}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb0773120353f330bf9d0883da59ba902e1079d39cd048f8368fdb3d41fe24f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!steerRequestId || msg.id !== steerRequestId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8ee388feeee4807d7f3c3e9f7ca67d4c571a56747b587ce7fd32e69cb4d422"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!storedState || storedState.pageUrl !== location.pathname || Date.now() \u003E Number(storedState.expiresAt || 0)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5316d4a846bb1e1da5b15dd15f7e27bec825d14f5c709d72b0863151222c41b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!summary?.generationCompletedAt || summary.generationCanceled\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9968}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f9e98e8232ec777a9c9fd4d610ce2fcb1356bed862c0ea9dfdf655a5c77d5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!svelteComponentSession || svelteComponentSession.sessionId !== sessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6033}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2f53d58c1bd2bda836145005da9e4a5de2c78e562e29a2ea2e7c071a2f36ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!target || own(target) || !pickable(target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d686486ae74615b38f03dbc75503f8aa4287e196b26629b5f32481a476be4cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text || text.length \u003C 2 || seen.has(text) || skip.has(text)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e7c51a018ad4828203151facb4420f3e27c0a928faddba516ef4a1dd946029"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text || text.length \u003C 3 || text.length \u003E 160\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21a96f51c4e315a57fabda83a9f2d8034909fccf83f35fa120fce5600f6648f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text.includes(needle) \u0026\u0026 !(text.length \u003E= 4 \u0026\u0026 origText.includes(text.slice(0, 40)))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5421}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eac939c73ba7d34079c6f33fd4500becc03ebbfe8324ff13292dbfc69c95a49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text.includes(needle.slice(0, 40)) \u0026\u0026 !(text.length \u003E= 4 \u0026\u0026 needle.includes(text.slice(0, 40)))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f58f2d621818a154181f232ea583ec532c1bf7037c101a545fb9a35b4aa600"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!tuneOpen \u0026\u0026 (!prevDirection || prevDirection !== direction)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5124}}}],"partialFingerprints":{"codehealthFindingId/v1":"31273fc37a2a5baf178eb31df5b9983c697c453407fc5a0bd911baf55a1cedf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!usesShadowChromeRoot() || !editBadgeEl || editBadgeEl.style.display === \u0027none\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4875}}}],"partialFingerprints":{"codehealthFindingId/v1":"23960e185896872c47c9574552fda21e9e67821c730a31298fc4f1625b8de7db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!usesShadowChromeRoot() || editBadgeProxyRoot\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4774}}}],"partialFingerprints":{"codehealthFindingId/v1":"29912583b98738ba0c9bb9dcbd5c0da4c349298366a19bf092379d448f0f6836"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!values || typeof values !== \u0027object\u0027 || Array.isArray(values)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c9627586c63c0ecb8e6673e207554c4c3261845b66753e066c6e24d51e6134"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(clone.outerHTML || \u0027\u0027).slice(0, 10000) || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3855}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aebfaa28698f310047735c538aa662460c8495fbadf762af3525c712f7a76f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(clone.outerHTML || \u0027\u0027).slice(0, 3000) || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fadf157a4a51532df5e7db41db973a3940739b911fbf885bb0d594a972b73f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(e.key === \u0027ArrowUp\u0027 || e.key === \u0027ArrowDown\u0027) \u0026\u0026 !input.value\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d3be34bee5e007d3b292d9b95e57bd8bf8de480fc5e40afef9f99ecaa681cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(e.key === \u0027ArrowUp\u0027 || e.key === \u0027ArrowDown\u0027) \u0026\u0026 !pageChatInput.value\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11758}}}],"partialFingerprints":{"codehealthFindingId/v1":"db73d26d532c1a982e53e86a6e40946c5ee81acfa8c7458fc07e6ab49c8d0dbc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(e.key === \u0027Delete\u0027 || e.key === \u0027Backspace\u0027) \u0026\u0026 !e.metaKey \u0026\u0026 !e.ctrlKey \u0026\u0026 !e.altKey \u0026\u0026 !e.shiftKey \u0026\u0026 !isImeKeydown(e)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1da4f3d535fd5a525bf5d279064bd1a2e354d25733bd66f77bdb7b959d780d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(activeSessions) \u0026\u0026 activeSessions.length \u003E 0 \u0026\u0026 !serverSession\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9903}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7e47e99be90afa9ea8db56a6d06f94cce38b04bf3e9075f6d4d1ca23a53729"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(comments) \u0026\u0026 comments.length \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9343a29f2ca348f7cb62b910cbf82d54e2e6c8b0f00c354526fc10345fbd24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(s?.points) \u0026\u0026 s.points.length \u003E= 2\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ef789d443258ed2ca222e3ebc56ac1b9cc21fd63b51f1af7617756ff6f7313"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060BP || barPaletteForTheme(detectPageTheme())\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"141422156b59f6c4e4aaa7c39a7e183052bc73b3eef42453cbcffbb02ec92855"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060FONT_MIME[ext] || res.headers.get(\u0027content-type\u0027)?.split(\u0027;\u0027)[0].trim() || \u0027application/octet-stream\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8735}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad071c601692e92c25a13cf2109cf43fe9733b89bb93c68c2a5051969759d6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(chunk.totalOpCount) || Number(stored.totalOps) || Number(stored.count) || parseInt(pendingPillEl?.dataset.count || \u00270\u0027, 10) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0827a0ff565a29f97cbefa76d8c9711856fff208116f2f8e8441c583ffa6a139"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(count) \u003E 0 \u0026\u0026 readStoredManualApplyState() !== null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"300606e01c97b2b4b14d3faec238c4c0a4f8b5f0ffc5288db64591bedc232bdd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(existing.count) || currentCount || totalOps\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4190}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a380284fe89db1cce7acc34945fbe616ef21c4cd534d95351aef03dc1a8061a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(existing.startedAt) || Date.now()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60c6762c72b47ae25674a7c30f91ec7020ddf769e3e02892fd15dce5ebd7fb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(existing.totalOps) || Number(existing.count) || currentCount\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4187}}}],"partialFingerprints":{"codehealthFindingId/v1":"745256a82555b23a15da1d6509cec5196ab62807d7765a54546bcbbfc3e4a130"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(manifest.arrivedVariants) || Number(manifest.count) || 1\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6078}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23a99146db224608a1901767d8e7bb5bc35eb55c4f7dfdfbbf56a60399d0014"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(manifest.count) || expectedVariants || 1\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6083}}}],"partialFingerprints":{"codehealthFindingId/v1":"20277991f8a2d7dfa736e3b4ad67fc054402f4527dc5328190805be212c0bcc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(manifest.count) || expectedVariants || arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6097}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ebdc560d27542ff5bcab32a625459d2ad29d272abe9965c38d23184976bcc3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(repair?.attempt || repair?.attempts) || 1\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7be58da4290b50f8547f1a8fbf89aac0ebf66def061a1309c1069a69927f937"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(sessionStorage.getItem(handledWrapperReloadKey(sessionId))) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b59f19fafd1f2f93efa141494340321a11272638bc0de9f4d96e3b367abb8f9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(wrapper.dataset.impeccableVariantCount) || Number(svelteComponentSession.manifest?.count) || expectedVariants || 1\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd03a201a40dcafc487040d2dcc840298538ea4421f52e0e8b822bb4890b966"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(max) \u0026\u0026 max \u003E 0 \u0026\u0026 num \u003E max\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9833}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a26d1151b72e60dcc214e8fab9e631959691aed6fc7fc2922fa88eba0aecb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.rect.top - b.rect.top || a.rect.left - b.rect.left\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"c707540da83af4a42d8016e6dbf428b2524b50f01bd4c39127b2b555a4539868"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060abandonedForeignSessionId === sessionId || sessionId !== currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8111}}}],"partialFingerprints":{"codehealthFindingId/v1":"75df4c1860e3d79c3be28cb76726f855a3a486adbebe1e2c81a4db986ba4cbcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activeDetectScanId \u0026\u0026 e.data.scanId !== activeDetectScanId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12555}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e20e05fd37c8c5a782473e86b34968ec0ee22c85a83a1a9dc6216be862e80bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060adapter === \u0027svelte\u0027 || adapter === \u0027sveltekit\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8871}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a19a448287b93665d92f1311e6a41d8234365815efff7fcd082ed67807b02b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agentStatusText() || AGENT_DISCONNECTED_TIP\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11855}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcac10879d24fdc19b712b45e4bd08dc5963467b39f01e6e20228da8db09656"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060agentTargetOverlayGone() || agentTargetTaken(msg.targetId)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7676}}}],"partialFingerprints":{"codehealthFindingId/v1":"94af2b362d9e3e00ad047fec3b94a549dea72c9cb6e70614f36ad750c02965c2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anchor \u0026\u0026 !anchor.__impeccableFrozenAnchor\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6878}}}],"partialFingerprints":{"codehealthFindingId/v1":"7512de30b3c06282f1279efd55dd863eb1ff9df2ed1c317409a5e427d02f3c3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anchor?.isConnected \u0026\u0026 typeof scrollLockAnchorTop === \u0027number\u0027 \u0026\u0026 isFinite(scrollLockAnchorTop)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7117}}}],"partialFingerprints":{"codehealthFindingId/v1":"490cfb09622d3de19aeaae7873b3fa8ddc988f826a08629cd8c052d74a6e090b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060anchorFlex \u0026\u0026 anchorFlex !== \u0027none\u0027 \u0026\u0026 anchorFlex !== \u00270 1 auto\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b85df44577950fc807c548b9f9228176d148b4010ace4d74f199122f043ff0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060animation.playState !== \u0027running\u0027 \u0026\u0026 !animation.pending\u0060 appears character-identically in 2 files \u2014 browser-bundle/10-probe.js, browser-bundle/15-snapshot.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":"browser-bundle/10-probe.js"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dc0f0b71fba0c1a62bee5afc7b266f86ab41c92b0ad459974ff93e53f8fcd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotEditing \u0026\u0026 annotEditing.idx !== idx\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20538a01cd230438b1a9cae064c344c46859b9ba6e63605b035cfaf6d98e344"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotEditing \u0026\u0026 annotEditing.idx === idx\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2c604aa6804d2d888476b776ea3b28e55488be08761ecc3a8a26c0983d5652"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotEditing \u0026\u0026 annotEditing.input \u0026\u0026 e.target === annotEditing.input\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8381}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50c29102d719b267398772f02af6f2e0d1533a8c7e03fadc6cbdcca6aac9cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotEditing \u0026\u0026 annotEditing.input === input\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"1401b680c5f524f2204fb911c44987b97a70a9ca10c96a3eef0fae9736b2184b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotLastPinClick.idx === idx \u0026\u0026 now - annotLastPinClick.time \u003C PIN_DBL_CLICK_MS\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e511718a5bcfa6f858b4e440232127ebd5ee37a44831d4a72a57515e7ebbb3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060annotState.comments.length \u003E 0 || annotState.strokes.length \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"931e9e209d7e0924d9ad9889a5e24e025d00faf86a4f55c560d1341a601dd0fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arrivedVariants \u003C= 0 \u0026\u0026 currentPreviewFile\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9913}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5976f7009d63ac74c75bf6222a90fc4c3b8c68018750ab392b8f6189ad4c5e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arrivedVariants \u003E 0 \u0026\u0026 arrivedVariants \u003C expectedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10456}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c13be491770591db488dcbe8c5a48f48e018ca42aea093d4fb3d69a74792d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arrivedVariants \u003E 0 \u0026\u0026 arrivedVariants \u003E= expectedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9970}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffaca5a85efc90d70e1b766dab46856c4572c125c1e8c2d365e8fbe696896d3c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arrivedVariants \u003E 0 \u0026\u0026 arrivedVariants \u003E= expectedVariants \u0026\u0026 expectedVariants \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10465}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7da4df70185ed01e1c21252f305af27668e7b13727572698453a8f5e341dc54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arrivedVariants \u003E= expectedVariants \u0026\u0026 expectedVariants \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fffac76acebf1df475fa046dccf11c4c9456c268c5f5ceb1e6a2cec1330d00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arrivedVariants \u003E= expectedVariants \u0026\u0026 expectedVariants \u003E 0 \u0026\u0026 (parameterGenerationState === \u0027pending\u0027 || parameterGenerationState === \u0027load\u2026\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9999c0766e60a9cfadc0b3997ba2cabf61f76fcc9beeb41c0108cbb4ac08120"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060awaitingAcceptResult?.id \u0026\u0026 msg.id === awaitingAcceptResult.id\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7938}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd849e3523dbf2317b2c3752762347cb2c4a202398dfea257e81acc9473a7cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060barEl \u0026\u0026 barEl.style.display !== \u0027none\u0027 \u0026\u0026 state === \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4273}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c3f686bc77cab274426308b1675369591334916c36152fed7299b320062c92"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060barEl \u0026\u0026 barEl.style.display !== \u0027none\u0027 \u0026\u0026 state === \u0027CYCLING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde60a60143cfbea8ae7c21caec33626b04c3cc5c3b98596419ee105b6d5b64a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body.error === \u0027agent_target_already_served\u0027 \u0026\u0026 msg.type === \u0027generate\u0027 \u0026\u0026 msg.id \u0026\u0026 msg.id === currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8075}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b5a748da63722c22573348a4ebd756350c8276e031ec48cfbc9cc92c03f33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body.error === \u0027unknown_session\u0027 \u0026\u0026 msg.type === \u0027checkpoint\u0027 \u0026\u0026 msg.id \u0026\u0026 msg.id === currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8085}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c77b06ef50cebfe119a6f426bb0cab975d062502f3d8bbb1fe2fb85a1276962"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body.error || (\u0027HTTP \u0027 \u002B res.status \u002B \u0027 \u0027 \u002B res.statusText)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8090}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c1f2b61bb1590aa64756c1eb278ddc3985558bb3e32eca806d9dc840c47eb2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060btn || uiGetById(PREFIX \u002B \u0027-insert-create\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c720a64983efbdfa8795da5b5821ce2e2a3390ec696853aa7ea77e3ff21cac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060busyDeclinedTargets.size === 0 || agentTargetBusyReason()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7608}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3e4dfa3cf0d9ed2fb67ed8f8be739cdfc03b96ebd4df7a031561691a38fdb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byIndex \u0026\u0026 normalizeManualContextText(byIndex.nodeValue) === newText\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2888a283aa19c7921e77a6e54760d1f1bd997a11f9412bd8572e5e72641900"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byVariant[String(visibleVariant)] || byVariant[visibleVariant]\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b8ab1a90b0576c4311260b88b1467c027a8c4a054c9894f19dec25cc3a74c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c \u0026\u0026 typeof c.getRandomValues === \u0027function\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-session.js, .agents/skills/impeccable/scripts/live-browser-session.js, .claude/skills/impeccable/scripts/live-browser-session.js, .cursor/skills/impeccable/scripts/live-browser-session.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":".agent/skills/impeccable/scripts/live-browser-session.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb584ddabd47bdb3b614f4769ade6747e8ba327fa0cec3d419d5370f437c9008"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cachedRaw?.id \u0026\u0026 !pageMatchesCurrent(cachedRaw.pageUrl)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9891}}}],"partialFingerprints":{"codehealthFindingId/v1":"567df2de7219e4ecab071422f0a751ac3be15d58a34b45f0ffe875fbd305f86c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ccs.position !== \u0027absolute\u0027 \u0026\u0026 ccs.position !== \u0027fixed\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b084edad428e692477decf68e2d2351561ee33341ad1a0596284ee8ae48b6919"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.nodeType === 3 \u0026\u0026 /\\S/.test(child.nodeValue || \u0027\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3617}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d7e8b69401f1b8a1da5673b1034306126d5330531d18e2903bfda21042b440"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clientX \u003E= aRight - slop \u0026\u0026 clientX \u003C= bLeft \u002B slop\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"025c36e074fc2491fa30f127f5b51130b6cfae5c02efa586cf58594ff7b8091e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clientX \u003E= overlapLeft - slop \u0026\u0026 clientX \u003C= overlapRight \u002B slop\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"429807287323d4e85127d5336009c2196db76b1b09f26cccb22e29ceb7621d5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clientY \u003E= gapTop - slop \u0026\u0026 clientY \u003C= gapBottom \u002B slop\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca9a83268c60b62b96456dae7ea6ee605b821dd5c187c134d8797e0347dcc28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060clientY \u003E= top - slop \u0026\u0026 clientY \u003C= bottom \u002B slop\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67789fbabb6f561c8ba28b720551c6b304188e4b5ed9ff68a377dd6e946fc26"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060comments.length === 0 \u0026\u0026 strokes.length === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d3e3df0d769ac235f157ced8fda9a8b0eb3f19f808700fb55b304336a9fb89"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060configureKind === \u0027insert\u0027 \u0026\u0026 annotActive \u0026\u0026 !!placeholderElement \u0026\u0026 state === \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6b446ae8a2c4a4cc7cf8bcd48bfed0a0fc89d5a8661c0ef4a8fc629d5e923e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060configureKind === \u0027insert\u0027 \u0026\u0026 state === \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12495}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c4f413e248cb106da994384659d78c88ff0e06008105035a6aec98ef45bc4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060containsElement \u0026\u0026 paintsShaderProxySurface(node)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8896}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd58bf51f058204badefb61f05e1d9a5657f52f1d9d8ba6aaf1b076305c5bab7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count || parseInt(pendingPillEl.dataset.count || \u00270\u0027, 10) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4338}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eeee32bcf242d59adc73042181d5d46e242c4fa67d26e608002afda39e28b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cr.width \u003E= nr.width * 0.9 \u0026\u0026 cr.height \u003E= nr.height * 0.9\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8709922d73c41b63556e6f010dccd8f2a00f5024dcd5d653c029c893f011eac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060created?.ok \u0026\u0026 currentSessionId === basePayload.id\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9012}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaecabf971e9a634a0376cba6699af44ef6c987c12052c5c1df1dd84d1d36fac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.mode === \u0027configure\u0027 \u0026\u0026 state !== \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11402}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8760048e2ec80bcd315ae836ac7151536ee09c1d3eccbba87147111e0a09f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.mode === \u0027configure\u0027 \u0026\u0026 state === \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11396}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b529fb81bf1f38cfc19255fe2ac27507822c5377096ea65a56e741a69d1d226"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ctx.mode === \u0027steer\u0027 \u0026\u0026 (steerLocked || state === \u0027CONFIGURING\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d452b5a8e366688c65c6faf4b419b36ada335e1fac6f7de2137bde8780e95bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cur \u0026\u0026 cur !== document.body \u0026\u0026 cur !== document.documentElement \u0026\u0026 depth \u003C 4\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cd23e4d803b3f31e2aa0453c9b7efa1f5d8a3f860a2354b184108a4a3cdba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentSessionId \u0026\u0026 (state === \u0027GENERATING\u0027 || state === \u0027CYCLING\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5753c3849e93f91087fac16d799e42b5f18fdc6c97c099ef856ff19e2e5efa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060currentSessionId \u0026\u0026 currentSessionId !== pending.id\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9541}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c070d373bb24d512fd8c3798861b70cb8c851445ff6b198bee2353ecc45b04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data \u0026\u0026 typeof data.agentPolling === \u0027boolean\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11910}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d64b913c672ab8810c4bb54037c783237f0f29f94ab52db5a83d0cae36d30e5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deepActive \u0026\u0026 own(deepActive) \u0026\u0026 /^(INPUT|TEXTAREA|SELECT)$/.test(deepActive.tagName || \u0027\u0027) \u0026\u0026 !shouldPassthroughElementNav(deepActive, e)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8384}}}],"partialFingerprints":{"codehealthFindingId/v1":"47599b73c40bd7c32df1b3b81a35f9406cdd0b8fb1cf7e7667fd437f9b9ba4be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deepActive.id === PREFIX \u002B \u0027-input\u0027 \u0026\u0026 state === \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8374}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f7b0ea2f25b4e6dc378817c1a37c0b67d323b93e44ec7ca4d0b34916e6470f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060deepActive.id === PREFIX \u002B \u0027-page-chat-input\u0027 \u0026\u0026 state === \u0027PICKING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b537ce5aa51c0cd0b2ab9dce09981aad1db5c4fe96d496df130936eb9284f11e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060designState.hasMd \u0026\u0026 !designState.hasSidecar\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a6a2c71da9d14b29a089f551eb6497d9eef0f11a36bef0c20f2b9a0d7608eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060designState.open \u0026\u0026 designState.present === null \u0026\u0026 !designState.loading\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13074}}}],"partialFingerprints":{"codehealthFindingId/v1":"66285b04f59b88aa40e614d8f5fd3fdad5fcbdd8771ed9f2b4d1628f5265326c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060detail.includes(\u0027newText cannot contain\u0027) || detail.includes(\u0027newText cannot be empty\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4086}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f70eeff66290fb9a1d83e70e42189f4afc49972a60cc289f6b7b036acee165"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060details?.message || \u0027A variant failed to load.\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6291}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d95f09602d6aba9068e94e2534b9238ecd64edc0d12f750b2256856056e5bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060details?.previewFile || currentPreviewFile || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6292}}}],"partialFingerprints":{"codehealthFindingId/v1":"956124113ac91901142b7e688c16a03d709c76c1f815dcff4320f6f4861b4b56"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060detectActive \u0026\u0026 pendingDetectScanId \u0026\u0026 detectCount === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12557}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba1f8c719fbb2756acba59970bd0229469ee8c25f93123f6132e7d539ee9424"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060display === \u0027grid\u0027 || display === \u0027inline-grid\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1739}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd16665b1d8c8fa889b6bc3d73dc3651cc1d98962cbca7e86dfabbb6067e84ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060doc.getElementById(\u0027impeccable-anchor\u0027)?.firstElementChild || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5313}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4176d5ee3da7d3fadc5180c27b346ccffdb10a0c7f4ad2ed579aa15af6e7bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.documentElement.lang || navigator.language || \u0027en-US\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11429}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f39e3e9e311d306fd368448be022e89e97e28b2e71e01935420f7a76c882489"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060document.head || document.documentElement\u0060 appears character-identically in 24 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"3243d0ca426d481aa8386556ccf882d18d17225f94c280ca223ee302df903da2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060documentRefForElement(el) || el.tagName.toLowerCase()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3508}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94227b62ce47f88823991c3d083a82cb481b7807c4f169d009702eb0d180fb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dominantRgb01(cctx, crop.width, crop.height) || averageRgb01(cctx, crop.width, crop.height)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8925}}}],"partialFingerprints":{"codehealthFindingId/v1":"0feb493bb0b91958c897bf029f96ad13e5983de17056808dc4010dda4b6a1ac5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.key !== \u0027ArrowUp\u0027 \u0026\u0026 e.key !== \u0027ArrowDown\u0027 \u0026\u0026 !isRemoveKey(e)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a0953b283d171098feab406c59defe2ca5134ff6231e0ab0cee966552e969"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.key === \u0027Enter\u0027 || e.key === \u0027ArrowUp\u0027 || e.key === \u0027ArrowDown\u0027 || e.key === \u0027ArrowLeft\u0027 || e.key === \u0027ArrowRight\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8411}}}],"partialFingerprints":{"codehealthFindingId/v1":"441fcdbc5179d2d614e607fc75ffc6f1c94867d70ad9ce32067ac60c0774c8e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.target.isContentEditable \u0026\u0026 isInlineEditActive(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8397}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d7b72bb8a2e4bcad8f672807e2152b4e6372cbac827eeaec08197b4e6ee166"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060editBadgeEl \u0026\u0026 editBadgeEl.style.display !== \u0027none\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4280}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e307829e5c40520dce58c0bcb25ce732595812108590811ec41f25376c10d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060editBadgeSuppressed || sessionOrigin === \u0027agent\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4962}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac87166af8fbad9fbb141a99b036f191e6738409757f2fd74e9016964420d77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060el \u0026\u0026 (el.id?.startsWith(prefix) || el.closest?.(\u0027[id^=\u0022\u0027 \u002B prefix \u002B \u0027\u0022]\u0027))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-dom.js, .agents/skills/impeccable/scripts/live-browser-dom.js, .claude/skills/impeccable/scripts/live-browser-dom.js, .cursor/skills/impeccable/scripts/live-browser-dom.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":".agent/skills/impeccable/scripts/live-browser-dom.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f14004bdc8f4baf2601fff3512c280a9f43a8924c5116cfee4994018922eab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060el.hasAttribute \u0026\u0026 el.hasAttribute(\u0027contenteditable\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cc2c8c064495d00dda151e8ab833d67d48c9bb64862991aa8ade78913f6e7f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ensureInsertPlaceholder() || findInsertAnchorInDom()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66c2c9d9276ad5e2705491c0baa5290d6382977bf58e7933fd266ea41d020bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ensureInsertPlaceholder() || findInsertAnchorInDom() || wrapper\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10427}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ade10b0a2b55180eb5efae6eca87305db7de03f8881745375781e22a18b770"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry === pagePath || entry.endsWith(\u0027/\u0027 \u002B pagePath)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-ignores.js, .agents/skills/impeccable/scripts/live-browser-ignores.js, .claude/skills/impeccable/scripts/live-browser-ignores.js, .cursor/skills/impeccable/scripts/live-browser-ignores.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":".agent/skills/impeccable/scripts/live-browser-ignores.js"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"10558d68c74ffdcd94ee6f94d865fc4a95594c3d558c0cee538564f7a33e9bfc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.item.keyField \u0026\u0026 item[entry.item.keyField] == null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5773}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff6603567d319466e777b54c5cb6812cd2ab6d67738c139bd56e6fee678cb9d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.kind === \u0027collection\u0027 \u0026\u0026 entry.item \u0026\u0026 entry.item.rootTag\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5750}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af511bf0b9d62252a287e65187184162bf9061311c12896e65e390a1dd58eb1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.previewToken || (\u0027{\u0027 \u002B entry.expr \u002B \u0027}\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d36cac6f9a98892f626c95a0e94b6fc27a6bbab752618b7136222b954e0b3c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err?.message || \u0027Failed to load design system.\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13098}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbbe190c81cc17c3dc6c46d36a3b71b4f34c630df65640a0d903377696e179a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error?.message || error || \u0027Unknown mount error\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2893ef7f196b8eddd10f2d703304be1b9c117f329f6a44bdcdc71d831ab80ed8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.source !== window || !event.data?.source?.startsWith(\u0027impeccable-\u0027)\u0060 appears character-identically in 2 files \u2014 crates/wasm/tools/disabled-values-check.mjs, crates/wasm/tools/skip-scan-check.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/disabled-values-check.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"5703b66417ac3a50ea10635aca2ca5fdd8936ea5bf1e30497b1fd0d4fe435022"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existingWrapper \u0026\u0026 svelteComponentSession?.sessionId === sessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6092}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b8e1994864b76fec1369eaa89d4039a63b93a7e18f69a3201e31360a0d0576"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expandInactive \u0026\u0026 globalBarEl \u0026\u0026 globalBarEl.scrollWidth \u003E window.innerWidth - 16\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10733}}}],"partialFingerprints":{"codehealthFindingId/v1":"edee8e393acae298d69624cf970ad14d68e1650125c91087e901801b2ca69f13"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expandInactive || toggle.dataset.active === \u0027true\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10724}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb47443f745c56b1ed26731f6485c27b2687fbc2277f5a042ab6b37d39681d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expectedVariants \u003C= 0 || arrivedVariants \u003C expectedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0e7b00bd8bfe1e16936ba4e24ac02ab996b6413747bc29cf0fe805a20be291"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fam \u0026\u0026 /[,\\s]/.test(fam) \u0026\u0026 !fam.includes(\u0022\u0027\u0022) \u0026\u0026 !fam.includes(\u0027\u0022\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b09b49335a485bd1cbf1fa3062262fd8e8de94330577e1857700526e26f7397"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060files.length \u003E 0 \u0026\u0026 !matchesScope(files, candidates)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-ignores.js, .agents/skills/impeccable/scripts/live-browser-ignores.js, .claude/skills/impeccable/scripts/live-browser-ignores.js, .cursor/skills/impeccable/scripts/live-browser-ignores.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":".agent/skills/impeccable/scripts/live-browser-ignores.js"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"213bd76ea60016c98beb21b35ddc930f88a992970cbcd82302d0fd709308dda2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060files.length \u003E 0 \u0026\u0026 matchesScope(files, candidates)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-ignores.js, .agents/skills/impeccable/scripts/live-browser-ignores.js, .claude/skills/impeccable/scripts/live-browser-ignores.js, .cursor/skills/impeccable/scripts/live-browser-ignores.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":".agent/skills/impeccable/scripts/live-browser-ignores.js"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"039aa390ace551c45983194bd80e0712636dbdb4a36842559639799621cca90b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060flag(\u0027--public\u0027) || process.env.IMPECCABLE_PUBLIC_REPO || engineRoot\u0060 appears character-identically in 4 files \u2014 crates/wasm/tools/ab-diff.mjs, crates/wasm/tools/disabled-values-check.mjs, crates/wasm/tools/skip-scan-check.mjs, crates/wasm/tools/snapshot-diff.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ab-diff.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc34ec8075d2e711294fac83fb63c93fe4f02676d3173c035663e58b144561a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getComputedStyle(target).cursor || \u0027pointer\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b344f76996c8768b1bb740526056ca8e88153903c0962e4bc0cb92372a503c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getMountedSvelteComponentAnchor(session) || session?.swapAnchor || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a585c49c667d032b576b8b72d72ca9608ba31f0d8035e4de4a1a08521f6b1140"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getMountedSvelteComponentAnchor(svelteComponentSession) || selectedElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5924}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f408669788ed952cf59c897cebd89b10b92742893928376e8272d5c38588b34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060globalBarEl \u0026\u0026 globalBarEl.matches(\u0027:hover\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd54539e83d07eafb49d24fb4fd8ba9c4be2bef12a19cfdff69c8a7ef2312d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060globalBarEl.dataset.liveBarDisplay || \u0027flex\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7534}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b66d25d19428de7da83f51e5d21516e8f04e309e451fc20d259f9c640885c7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060globalBarEl.getBoundingClientRect().width || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10746}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e10ec56a95959fb0a06e9581f7428b60b7a79a93bf57faa5b7baaae9861838b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060globalBarEl?.dataset.theme || detectPageTheme()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b5716f596fac6b7bfbe7a7c0ab3f81cbd501eceb9c8c7c2c9d4cae3adccbc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060group.length === 1 \u0026\u0026 group[0].description\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13515}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fb327c825aa5f0f3988efb6e6f3c846adbc1a1e183b58f16a12df478250783"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060group[0].name || group[0].kind || \u0027Component\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56aab04a0bfe326e77a5f19b5458cf0bec049aa8ca36d096c25e3e3270b1199"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hiTarget \u0026\u0026 !hiTarget.hasAttribute?.(\u0027data-impeccable-insert-placeholder\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9a239e65a0e4b67a63c6c9a930e177c7a05e165120016d38b98352ebf30426"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060highlightEl.style.display === \u0027none\u0027 || highlightEl.style.opacity === \u00270\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7616abb6d9b64ad7a692285ca5882287af90c932360e78143950b9f60ec2ff50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003C common.length \u0026\u0026 i \u003C segments.length \u0026\u0026 common[i] === segments[i]\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-ignores.js, .agents/skills/impeccable/scripts/live-browser-ignores.js, .claude/skills/impeccable/scripts/live-browser-ignores.js, .cursor/skills/impeccable/scripts/live-browser-ignores.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":".agent/skills/impeccable/scripts/live-browser-ignores.js"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a8be9d7c546ee6d8d1f64cfcba2fd09d122ab585defdf3058f41e332261fb7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ignoreFileGlobs.length \u003E 0 \u0026\u0026 matchesScope(ignoreFileGlobs, candidates)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-ignores.js, .agents/skills/impeccable/scripts/live-browser-ignores.js, .claude/skills/impeccable/scripts/live-browser-ignores.js, .cursor/skills/impeccable/scripts/live-browser-ignores.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":".agent/skills/impeccable/scripts/live-browser-ignores.js"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"105bf769487593d36924cdeeed0fe2362d9723a4e8bc8e10aab5a7ea41e4acf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inlineEditRoot \u0026\u0026 !opts.preserveMixedWraps\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3595}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e1b4a1a981e82249d75f80518f5f86a40561d1ecd0e8ad5fce2761d808d110"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inlineEditRows[0] \u0026\u0026 inlineEditRows[0].el\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3636}}}],"partialFingerprints":{"codehealthFindingId/v1":"53eb5733fa642330a2b9d6c1f51a83a1d513e9dc41c54869951afe5441a7b5c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input || uiGetById(PREFIX \u002B \u0027-insert-input\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ecb19fe008bba9bf7820fc080e3a3c6484f8df73903cc4f7c8ea787c787e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060insertAnchorElement \u0026\u0026 document.body.contains(insertAnchorElement)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b1c5ca577a7aa6af982df6d768cbfdeaea1dcafc2983a0c620844cd2037bc7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060insertPlaceholderSnapshot?.layoutAxis || insertAnchorLayoutAxis\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13bd4d7ab4cd9b723e8f6917823cb73b15d21576c27231c70633187eee877ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060insertPlaceholderSnapshot?.position || insertAnchorPosition || \u0027before\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6283416a0bc1980317dc4f104e720e84f34ef5134c8d7bed7e9106261ef02d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isFrameworkComponentPreviewMode(currentPreviewMode) || svelteComponentSession\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8872}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b33892cdb569b735ee516b85b4da3666567ffd54fb4ca137dd1414233709b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isFrameworkComponentPreviewMode(msg.previewMode) \u0026\u0026 msg.previewFile\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7857}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f3ae1c3ffc8bdc1a16d8f1ded0b2db1cd203cf5c3ad2b0e5fd54a1c0313535"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isFrameworkComponentPreviewMode(previewMode) || isSvelteComponentManifestPath(file)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9772}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8decb61a6fdc9535ca195df58e57c9c261ca486da649f515b0314b661e0c62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isFrameworkComponentPreviewMode(wrapper.dataset.impeccablePreview) \u0026\u0026 svelteComponentSession?.sessionId !== sessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10354}}}],"partialFingerprints":{"codehealthFindingId/v1":"386948b8f030bb529f02ddc3039e2a2768726f3c8c0110b1713a656a852bc91b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isInsert \u0026\u0026 resumedState === \u0027GENERATING\u0027 \u0026\u0026 arrivedVariants === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10426}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f2c0abe58ef3f2cec67bb1e69f49923b14b3e8a2ed1a751905c4af93a6e262"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isInsertGeneratingSession() \u0026\u0026 count === 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15ab512751f2246ac6fd77896559870ad2537c37573727d3fd4f155ea32b84c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isPageEditableElement(active) \u0026\u0026 !isInlineEditActive(active)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10880}}}],"partialFingerprints":{"codehealthFindingId/v1":"92492339a2b7d3ffa25ae69997a8e0aae3104e48c7fb491d5bbd5464554be129"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isPageEditableElement(deepActive) \u0026\u0026 !isInlineEditActive(deepActive)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed197159a2d9e47d920ab6dedef9a01905424e979955807fa10a830499be72c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isRemoveKey(e) \u0026\u0026 state === \u0027CONFIGURING\u0027 \u0026\u0026 selectedElement \u0026\u0026 configureKind !== \u0027insert\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e30bf447872b8005d916ad5b4002cd1be6e7b3d806fb3496d72e66d785662e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isUsableInjectionAnchor(selectedElement) \u0026\u0026 selectedElement.tagName === origContent.tagName\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5443}}}],"partialFingerprints":{"codehealthFindingId/v1":"5895a6286d1014a48f099ffca67069c2173606c98b247cdbfeb640cb7c20f3b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060jsonData.parseError || jsonData.sidecarError || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b85b0fa0024cd3b7d7827bb773cbf9a7325adb45957188d8832f65bda99f0b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kept.sessionId === currentSessionId \u0026\u0026 kept.variant === visibleVariant\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"134df49112215b75e93a666fe16815b621cb5a3fcda3b551d1502b201078cfa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.startsWith(\u0027__reactFiber$\u0027) || key.startsWith(\u0027__reactProps$\u0027) || key.startsWith(\u0027__reactContainer$\u0027) || key === \u0027_reactRootContainer\u0027 |\u2026\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-dom.js, .agents/skills/impeccable/scripts/live-browser-dom.js, .claude/skills/impeccable/scripts/live-browser-dom.js, .cursor/skills/impeccable/scripts/live-browser-dom.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":".agent/skills/impeccable/scripts/live-browser-dom.js"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a64d51c651ba5916d4667411c9587fd8980abae0da9146c91bde79467107af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind === \u0027flex\u0027 || kind === \u0027percent\u0027 || kind === \u0027auto\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e174a22b9c98db2ab26f939e67fd6c9171c7aaf320915628d110d703a93500"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060last \u0026\u0026 last[0].kind \u0026\u0026 c.kind === last[0].kind\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6817bdf08fc877f48aa46fad7f9cdcb05e5d23a80be5ba9615feda0dd6a10a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lastErr || new Error(\u0027no module candidates\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5549}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c53330d409fc51dfe1f12d845ab8aee77a901fe48935d9d483e7e6dfd6ca4e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060leafEl \u0026\u0026 (leafEl.id || leafEl.classList.length \u003E 0)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"4454136e1c565f1cd1388daaeeee94c7c05a73f9af06ce278b6fa308d963ed04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060legacy === sessionId || legacy.startsWith(sessionId \u002B \u0027:\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a58f39cfbc2398bd7e28584b664173cf6bc84b807ee285a0038dc13af1cde7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060listening || pageChatVoiceBtn.dataset.active === \u0027true\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10774}}}],"partialFingerprints":{"codehealthFindingId/v1":"137557becd4725e61171b3792cb9f22c4e73788a1d97d39148660608e66ea3cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060liveEl.classList.contains(entry.probe.className) || !!liveEl.querySelector(\u0027.\u0027 \u002B cssEscapeIdent(entry.probe.className))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5786}}}],"partialFingerprints":{"codehealthFindingId/v1":"567867063ee6a166c7909ca2d77597d8a212e303a993b5f4b06fe398e06fa4e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060liveInteractionRevision !== recoveryRevision || !!(currentSessionId \u0026\u0026 currentSessionId !== sessionId)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c289b0261efb5970a853b755b1425baa9e4804192218524d60b6d1d5b6551ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060liveNavKey \u0026\u0026 (state === \u0027PICKING\u0027 || state === \u0027CONFIGURING\u0027 || state === \u0027CYCLING\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8416}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef930610c6670096125c4866ea7b42cb1838cb772bbcc6fbc3ef312ab96c57e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060liveWrapper \u0026\u0026 liveWrapper.querySelector(\u0027[data-impeccable-variant]:not([data-impeccable-variant=\u0022original\u0022])\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6653}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff11d0944cc5e68491531352768c2c4cefa5eb3ee63357ecd65f1ec355b633e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060m.description || findProseDescription(proseColors, key, m.displayName)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a725e288841430a9c3d1df07473ab2dbc3580e34662409795069cf8dc0586bce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060makeFrozenAnchor(previousAnchor) || svelteComponentSession.swapAnchor || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5925}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23536f51b93bd6c46bce5a194b48f1c5981ea55dfe3e7291f6acbc0249c3ec7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest.componentModuleBase || (\u0027/\u0027 \u002B String(dirRel).replace(/^\\/\u002B/, \u0027\u0027))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5915}}}],"partialFingerprints":{"codehealthFindingId/v1":"360bda55d63f43bd597f673d7cc8cb46e2092e079457d2fda9a732b39cb57dc2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest.revisionDir || manifest.componentDir || \u0027\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5913}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63659135a6d278c55116979b323acf433d5f3499019c2a11134c55d2e48ec95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest.revisionDirAbs || manifest.componentDirAbs || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5914}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbd89242c35bc0be01c84e6d03389b9c07d12099fc0239df9df9a7696c2cdcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest?.originalMarkup || manifest?.anchorMarkup || \u0027\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5463}}}],"partialFingerprints":{"codehealthFindingId/v1":"559694a21b25dedb91039a31c25aaaf38a5d6ae861fc8903751683f4c1da59da"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest?.previewMode === \u0027svelte-component\u0027 \u0026\u0026 manifest?.mode === \u0027insert\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b780ed7346e00459c2a25869f233c7efbd36e45b1f70f3dcbda140b53d0cd3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060manifest?.revisionDir || manifest?.componentDir || \u0027\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d50204856e6afbc62715df4a4e54895d4b213b038da0ad06ba5383225ab1dc6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode === \u0027cycling\u0027 \u0026\u0026 !ensureCyclingRenderable(\u0027show-bar\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"783f91662ba2da388eaa3fbc37c075d979d7f8fbb449b09f3fa357463f73ba61"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode === \u0027cycling\u0027 \u0026\u0026 !ensureCyclingRenderable(\u0027update-bar\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b398cb3dc41e1fccaae94c3c2ca5ed5b7df576ae4a36c0d7cc54a8bdeb822e65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode === \u0027idle\u0027 || mode === \u0027idle-disabled\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4998}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ffd26d745f1b18973238bc8fab91343beb94a1b00a5a2e34c60a8b850c8c33"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mountErrorState?.sessionId === sessionId \u0026\u0026 mountErrorState.variant === variantNum\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fba8c4b4e35093bc870f685b7d3af31b04b766c8f79ae5b27b964a0210ef52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mountTarget.firstElementChild || mountTarget\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc82b183dea30f06adffdca240bdb98a31e1d677815b0433dad9b6dea9b48085"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.action === \u0027findings\u0027 || msg.action === \u0027state\u0027\u0060 appears character-identically in 2 files \u2014 extension/devtools/panel.js, extension/devtools/sidebar.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":"extension/devtools/panel.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d94de4b04e6d546e815bf5c052907e1ad768d45b1b62c98d59623319d2563a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.data?.carbonize === true \u0026\u0026 awaitingAcceptResult?.id \u0026\u0026 msg.id === awaitingAcceptResult.id\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7950}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba06a95e552946ecb47d51297740b855411eaed9ab276408c79ed2d654ab3a50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.data?.carbonize === true \u0026\u0026 maybeCompleteAcceptedSession(msg)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7951}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d09fbef99c008e1f2a71e04384afbf25b6ead71379c05367727a29e30dce91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.file \u0026\u0026 /\\.svelte(?:$|\\?)/.test(String(msg.file))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11545}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc75ff7fd2940371f1d779fa62e5d147a73cee8e2de89a8b51a2f6db630707e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.file \u0026\u0026 msg.id \u0026\u0026 state === \u0027GENERATING\u0027 \u0026\u0026 msg.id === currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7911}}}],"partialFingerprints":{"codehealthFindingId/v1":"508dfa7a1592d388c6fc6e2336dba3d482151de88946da956d97df18a764993c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.id === currentSessionId \u0026\u0026 (state === \u0027GENERATING\u0027 || state === \u0027CYCLING\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7842}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5ab6a1ce80c6ae8d7e4158319770e3dba4d3e119dd797f52b82dfd829224ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.id === currentSessionId \u0026\u0026 isFrameworkComponentPreviewMode(currentPreviewMode) \u0026\u0026 currentPreviewFile\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7890}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1931c7fd97216f3f2b0350fa690c98fd5bea4fb4856bed5c89466548bf59fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.reason === \u0027manual_edit_repair_needs_decision\u0027 || msg.needsManualDecision === true\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4572}}}],"partialFingerprints":{"codehealthFindingId/v1":"285d24e4202162f91f7338eeb99f799b0465f36e404c7b3f34975ed9bf6e556d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.type === \u0027generate\u0027 || msg.type === \u0027steer\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8093}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b49a94ff12dbbcf7eb43c5f3c015a98b9ab84d0daedc1c96772fbacb6aa742"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060msg.type === \u0027manual_edit_apply_dispatched\u0027 \u0026\u0026 msg.repair\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4555}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33239f1fda28f6bab37a2a7d89931f083be1004c900e7efdd61237e20a4d555"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.dataset?.impeccableVariants || n.dataset?.impeccableVariant\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7269}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d9db942897f01263b34f9957943d223030ca2e7103e424c38a97b72a138286"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.nodeType === 1 \u0026\u0026 (n.matches?.(\u0027[data-impeccable-variants=\u0022\u0027 \u002B sessionId \u002B \u0027\u0022]\u0027) || n.querySelector?.(\u0027[data-impeccable-variants=\u0022\u0027 \u002B sess\u2026\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e485c78a4db7226d8a027ed6a7aa5bf9d05dda56d29820e81123ce3e87221b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n.nodeType === 3 \u0026\u0026 /\\S/.test(n.nodeValue || \u0027\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3529}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb47f580751b636789571a9adffb874d9a3796c563f377a963d3e65fd82a521"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060narrative.dos?.length || narrative.donts?.length\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04398ea3291d46db54428a2f67baca6db41ae07f86276627047bb0a332495bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060narrative.overview || narrative.northStar || narrative.keyCharacteristics?.length\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbad37b35b6cc91d98989f4067e2837d6437ee336bd77f520ce3d35e83b46ac"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060navEl \u0026\u0026 (e.key === \u0027ArrowUp\u0027 || e.key === \u0027ArrowDown\u0027 || (e.key === \u0027Enter\u0027 \u0026\u0026 state === \u0027PICKING\u0027))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8451}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c977a3aa24dd5f1dcbf809106516fd102a3ae1e38b36c4f22962f627604905"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060navigator.clipboard \u0026\u0026 typeof navigator.clipboard.writeText === \u0027function\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13802}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca63ca06216eaec0147a32d732d4d6d206a47792ba5b9cb98bd32c1923bb871"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060needle \u0026\u0026 !(candidate.textContent || \u0027\u0027).includes(needle.slice(0, 40))\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"065812de6d367d9f33a407e90c8dd7738cd1485000e5b9c1c052e3b9b291db84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060newText !== undefined \u0026\u0026 newText !== row.text\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4022}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a10d5fb87d05aaff23fe0f71f5e0cfb004f496591e9392ce860042089724d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nextRank === undefined || currentRank === undefined\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18114d0519d03383a23a1b1798bac440d0a6e70f2e879c7498c948be7c2f9b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node \u0026\u0026 node !== node.ownerDocument.documentElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dee9f6b366bb5a110c3cc6bf220349ad7afacda76978f0c67eeca313b992d5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node \u0026\u0026 node.nodeType === 1 \u0026\u0026 node !== document.body\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a98a6969ad61ac47593cb3e168116321bd785b2aa3416a7dacc3f8ed856343"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.dataset \u0026\u0026 node.dataset.state === \u0027open\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb3df4e8d007ac51d6f40fa8c79158d98e57b45248f687b2469131f5b956469"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.getAttribute \u0026\u0026 node.getAttribute(\u0027role\u0027) === \u0027tabpanel\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8317}}}],"partialFingerprints":{"codehealthFindingId/v1":"77aa1c7b4c4bcbdc62a8cccb175bbb68bce5647856b0861ba09435fce6563224"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.hasAttribute(\u0027data-impeccable-editable\u0027) || node.hasAttribute(\u0027data-impeccable-original-text\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"92702dbc49482fb26b631739cac23939a6aefb876abcb7da1c0c0281d7aaaf58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.nodeType === 1 \u0026\u0026 node.dataset \u0026\u0026 node.dataset.impeccableTextWrap === \u0027true\u0027 \u0026\u0026 /\\S/.test(node.textContent || \u0027\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4668}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0d8758c5a825a691a1fb46163d063ab69d99299b72c7596366cb3bc408105e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.nodeType === 3 \u0026\u0026 /\\S/.test(node.nodeValue || \u0027\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ab8ad0a1124f4f4ae1fb4b562d3b1055ee0ee76136c35dcc04d14dce41b2e6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.nodeValue \u0026\u0026 /\\S/.test(node.nodeValue)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a458fc2342afff2df73ba813ea20d4db235320f597c164a3d8c0ce2faed1d46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.tagName === \u0027DIALOG\u0027 || (node.getAttribute \u0026\u0026 node.getAttribute(\u0027role\u0027) === \u0027dialog\u0027 \u0026\u0026 node.getAttribute(\u0027aria-modal\u0027) === \u0027true\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d9babaa8ef20680931a963a2ddd8af57f6397e26090d344709e4ec3a9fbda8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nr.width \u003E 0 \u0026\u0026 nr.height \u003E 0 \u0026\u0026 nr.left \u003C= er.left \u002B 0.5 \u0026\u0026 nr.top \u003C= er.top \u002B 0.5 \u0026\u0026 nr.right \u003E= er.right - 0.5 \u0026\u0026 nr.bottom \u003E= er.bottom \u2026\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8891}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b02830d6f8d890a3534d695373fcfb59064d515818f20392ec07171eb16a372"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060numberOrNull(msg.appliedCount) || numberOrNull(msg.cleared) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4586}}}],"partialFingerprints":{"codehealthFindingId/v1":"4613fa01fb523a3df0f425c9ecf6574b4fb7152aded42a8b2239373e599f1737"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060numberOrNull(msg?.repair?.attempts) || numberOrNull(msg?.repair?.attempt) || 3\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4462}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dca8c806b1ba3432de2b7c5936c283947cf302d5fa7e9b8d3d94bd1c474566"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060numberOrNull(msg?.repair?.maxAttempts) || 3\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4463}}}],"partialFingerprints":{"codehealthFindingId/v1":"923679c762ad4c87c63a0545bff60e8bc18e2bf36769a3ef174752db78d74b5e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060numberOrNull(result.remainingCount) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49f06e759a24edc7d17a4a338148b39e39f244cf470b606afbcffd89bd161e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060onlyA.length === 0 \u0026\u0026 onlyB.length === 0\u0060 appears character-identically in 2 files \u2014 crates/wasm/tools/ab-diff.mjs, crates/wasm/tools/snapshot-diff.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ab-diff.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebabb6de7d25b5ec87a6119f1bac4cece03ad67a939b01178d5122f30915226"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060openModals.length \u003C before \u0026\u0026 openModals.length \u003E 1\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-dom.js, .agents/skills/impeccable/scripts/live-browser-dom.js, .claude/skills/impeccable/scripts/live-browser-dom.js, .cursor/skills/impeccable/scripts/live-browser-dom.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":".agent/skills/impeccable/scripts/live-browser-dom.js"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf4c6d62c2ad6652bc1472bdbdb0fe5d4589b83e52323c4fd83510f205f5432"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060openModals[openModals.length - 1] || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-dom.js, .agents/skills/impeccable/scripts/live-browser-dom.js, .claude/skills/impeccable/scripts/live-browser-dom.js, .cursor/skills/impeccable/scripts/live-browser-dom.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":".agent/skills/impeccable/scripts/live-browser-dom.js"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e258b1a73bd3af4c1b70799f890c3bab5a5e2584a92c7b6515894fe4d7ea83"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.generationCompleted \u0026\u0026 sessionId === currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6660}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a53b6f9dce2ace796d326f5a115c5ebbe0628ed83d7f2dd411a48f6d353441c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.orphanDiscard \u0026\u0026 !liveWrapper \u0026\u0026 sessionId === currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6681}}}],"partialFingerprints":{"codehealthFindingId/v1":"db603a6403c0914676258a751e527cbe6f406e46b6c2e6560ed900bcf67ddb76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.orphanDiscard \u0026\u0026 sessionId === currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6709}}}],"partialFingerprints":{"codehealthFindingId/v1":"1278d4faa63fade9188eb8d745fe388196fc4aad122c8d6eada6756c3284f04c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060origClasses.length === 0 \u0026\u0026 origText.length \u003E= 4\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5359}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32579b19984e63d64b5871900ee3a9dd733fa5676d21164f2a0d047c03d0a66"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060origContent.id \u0026\u0026 selectedElement.id === origContent.id\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5445}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaba99d7d669ec9501414fb0e1a090f2d37212b9a05fea75c17150c4031ab394"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060override === \u0027light\u0027 || override === \u0027dark\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10647}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff4a2ef12fb10e2469b2d0220071a8dc4c52d2cd15b80f2afb8b09c9cd4cf91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060own.backgroundImage \u0026\u0026 own.backgroundImage !== \u0027none\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8806}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4e4c48b6ebe5b6d849ac3433c51b538feb62f0dfd2261691b67c23f3c2094e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageChatEl.getBoundingClientRect().width || pageChatCollapsedWidthPx()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10745}}}],"partialFingerprints":{"codehealthFindingId/v1":"947072ead91fcf1f4abc80829ccd1845cc4ed965f1a4cc7654274318f26bdecb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageChatHint \u0026\u0026 activeElementDeep() !== pageChatInput\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11583}}}],"partialFingerprints":{"codehealthFindingId/v1":"526922f0c84aa5a31e4fb18faccdc235724ddf8bf8ae9f4d20bc3042e87ef42e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageChatInput \u0026\u0026 activeElementDeep() === pageChatInput\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10761}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb572dd507965801fd652f19382ac5647ff04fe2ef7677984ad1e77d384ef07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pageChatVoiceBtn.contains(e.target) || pageChatSendBtn.contains(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11717}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e776f5f315137af0758851c5c964a507154f3e96d6e7ee20637a1d8c8f22d44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pagePath === \u0027\u0027 || pagePath.endsWith(\u0027/\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-ignores.js, .agents/skills/impeccable/scripts/live-browser-ignores.js, .claude/skills/impeccable/scripts/live-browser-ignores.js, .cursor/skills/impeccable/scripts/live-browser-ignores.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":".agent/skills/impeccable/scripts/live-browser-ignores.js"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc9c9bc4a198c8fde8338a5526002e4c6a827b45a7978abd5fec88fe262618d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pagePickSkipClick || pageHasHostTextSelection()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc01a9d55c8c29bda9ab3045658bdc2e86bb0c869f925887c91fe09ad70b39fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pagePointerGesture?.dragged || pageHasHostTextSelection()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10960}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf7c957e3d22da3e5d5bfff79568b267aa43d88621ddc8d7b1dc3fc070a1fd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parameterGenerationState === \u0027pending\u0027 || parameterGenerationState === \u0027loading\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5211}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12fb53377ceb505640f75030fbb393d28478fdf236fcd55acde4f32ea313446"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paramsPanelEl.dataset.tuneDirection || \u0027below\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8548fc4345103cc30b1ab7eb0b81040c29a1d44240d3642872fb42d21e2990c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paramsPanelEl.style.display === \u0027block\u0027 \u0026\u0026 paramsPanelEl.style.opacity === \u00271\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe24852514fe210031db3d97d38b83f1c513be542666464328b09db379859f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paramsPanelEl?.dataset.tuneDirection || \u0027below\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5feeb50ac52bfedb3a5783303db2dcaad7a0c3a739af5a777d396f1ee1d75f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060paramsPanelPalette || barPaletteForTheme(detectPageTheme())\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86f932e6c2c3b00f62a91113d9e793dd31e68b82192c4a6f6f558ce257b104e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseFloat(placeholder.style.marginLeft) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bd304573264048933d59577d732c4c09610da214cdb9ad4e9c1b5fafd9ca90"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseFloat(placeholder.style.marginTop) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2164}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb9740ac56375dcd82de288d9e2d3d2df3a144fc5b87475187c1a0e250d057e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseInt(pendingPillEl?.dataset.count || \u00270\u0027, 10) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5645a3fe847ad9619001b0a530f7a347102afce0aa755c02a0fb466170bd0ef0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseInt(pendingPillEl?.dataset.count || \u00270\u0027, 10) || Number(readStoredManualApplyState()?.count) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4258}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d237675afb5b8380ad9f7a5c782f4ee2809d46934aec13157b08dbc51b98b8e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseInt(pendingPillEl?.dataset.count || \u00270\u0027, 10) || numberOrNull(msg?.remainingCount) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4458}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5303ea684970b76083032e955432d453ad579a98ab20be975275a368c75e7fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parseInt(pendingPillEl?.dataset.count || \u00270\u0027, 10) || numberOrNull(readStoredManualApplyState()?.count) || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4473}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a80bb4a764482e40275f9e7d702a3b89d7e4a2f492ccb7a8ce5861825749919"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pending \u0026\u0026 typeof pending.then === \u0027function\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13806}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2b3d59a5e6a6cb4268f5a648daa9169c12d74629a1e3e4d717a0ede685c619"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pending.nextSibling?.isConnected \u0026\u0026 pending.nextSibling.parentElement === parent\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9668}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ecea3fa40bb48df014c010b0b6f38abbb2804acac8b40a2338605d25bf1157f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pending?.id \u0026\u0026 document.querySelector(\u0027[data-impeccable-variants=\u0022\u0027 \u002B pending.id \u002B \u0027\u0022]\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9678}}}],"partialFingerprints":{"codehealthFindingId/v1":"051afb39f4b981a2b0d10f19d33bd2f027a5fd14d8c51c8b4a9c954775893bf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pendingAcceptedSession || state === \u0027SAVING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9474}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c9c46df405766374c503a75321ae2ccfc70ecd08bf89a9ec2efdb9314f66a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pendingAcceptedSession?.id \u0026\u0026 msg.id === pendingAcceptedSession.id\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7004a0c30adbe2cb5a3af2e01b6fc8d453b308b2331544cedde67c975009de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pendingApplyInFlight \u0026\u0026 !pendingDockEl?.contains(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6169734923a5a58b69539e99c3125d1eca40c864a67b2607971f1501bac1f19f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pendingApplyInFlight || shouldResumeManualApplyLoading(currentPageCount)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5117cbbaafe5a92747cc436599ef5d555cdc0f501981e396de8943da71f10092"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pendingCount !== null \u0026\u0026 pendingCount \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf6c016ec566b3a0aa5b236c224cd0b0ca3b3aa0cbcb6ef0952f7c28a08a0e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ph.parentNode?.getBoundingClientRect().width || PLACEHOLDER_MIN_WIDTH\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"552bcbe334137d551b29988be00be39a956da5bdd17613d2ec00ab2a99947b59"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pickVariantContent(wrapper, \u0027original\u0027) || wrapper\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcb87fb57326daf14dd47170fd34a1e5affa0dfbc135a90935a798eeb81c078"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pickVariantContent(wrapper, visibleVariant) || wrapper.parentElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6620}}}],"partialFingerprints":{"codehealthFindingId/v1":"094484ddf64ffc5201c18bcf985080e17ac808be55183d5373aad67b06b850e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pickerEl.__iceq_palette || barPaletteForTheme(detectPageTheme())\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"a582eee9b9dc003d3cf3e870c4e00cfbbd18a7ad466d32d6fbfd5a48bf97b384"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pickerEl?.style.display !== \u0027none\u0027 \u0026\u0026 !own(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a745bfa60c34db7224bea5eb9eb771f5c7e6c159468f7552c212d0d2abb0dfcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060placeholder.offsetHeight || PLACEHOLDER_DEFAULT_HEIGHT\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f353267a922736436ca4a3b63588a15140420488e1e887b5200992e1f1067f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060placeholderElement \u0026\u0026 document.body.contains(placeholderElement)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b55c36076d6e85edc22df474f33e123331e7e3b564af1f99696542ac4e3b3a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefs.collapsed \u0026\u0026 typeof prefs.collapsed === \u0027object\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12671}}}],"partialFingerprints":{"codehealthFindingId/v1":"d067bf4e6add3fa2408dd35b2e65f849921d264115139146bceaa69ed3d6ebb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefs.tab === \u0027visual\u0027 || prefs.tab === \u0027raw\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12670}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae04db00cf34b9e5881186b2390e9f4016ff9c629759c98de24dfe0d2e4ff3bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous \u0026\u0026 previous !== activeElementDeep() \u0026\u0026 typeof previous.focus === \u0027function\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-dom.js, .agents/skills/impeccable/scripts/live-browser-dom.js, .claude/skills/impeccable/scripts/live-browser-dom.js, .cursor/skills/impeccable/scripts/live-browser-dom.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":".agent/skills/impeccable/scripts/live-browser-dom.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"248fc175d8a625a828ce5b3ee7201711643d8df627c6b2f28e09e46bc7654dff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previousVisibleVariant \u003E 0 \u0026\u0026 previousVisibleVariant \u003C= arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a274c8d0d3bdc9353fb7f759aeaad7e7fcaba5e5e4401ae356ec1a70513867e7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.IMPECCABLE_DOWNLOAD_BASE || DEFAULT_DOWNLOAD_BASE\u0060 appears character-identically in 2 files \u2014 scripts/check-engine-release.mjs, scripts/fetch-engine.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-engine-release.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3630df67d1a3c893853b8ba4484c050d2e84071905289363df15c1d6690674f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.PUPPETEER_EXECUTABLE_PATH || undefined\u0060 appears character-identically in 4 files \u2014 crates/wasm/tools/ab-diff.mjs, crates/wasm/tools/disabled-values-check.mjs, crates/wasm/tools/skip-scan-check.mjs, crates/wasm/tools/snapshot-diff.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/tools/ab-diff.mjs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9065731bad118e3a0b7743d5e7764a9570fab5b31a7459694ebe0785956423f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060readOpaque(document.body) || readOpaque(document.documentElement)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10664}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b2c105c16bc4d4f70a9ecf92194ba3f1e686287cd34115de17cbd58bb64595"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ready \u0026\u0026 parameterReadyAnnouncedSession !== currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfb2f6d330a58e2993b929fd8ff0917bd059967f424042b6db2c9d366807dd0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reason || \u0027browser_restore_without_wrapper\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9928}}}],"partialFingerprints":{"codehealthFindingId/v1":"167290b9e549a2939d96477faf5ba134f42e68c90cf76776fbbff10b889ba83f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rect.top \u003E= 0 \u0026\u0026 rect.bottom \u003C= window.innerHeight\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7481}}}],"partialFingerprints":{"codehealthFindingId/v1":"669db40eb5ec7b5fb2ab32c3274e22a1f04b07c18e83df2ece49b2611b5386a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060res.status === 202 || result.status === \u0027started\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b096fadfa35c3e5758a40f99ca46811d81ea2a9fb66108f841a4baf94df540b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resizeEdge \u0026\u0026 configureKind === \u0027insert\u0027 \u0026\u0026 placeholderElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a2d1c10ee74de12f4e8423cf5719d826dcdfe1d4619d36a0e91ce6a99efb0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolveSvelteComponentAnchor() || svelteComponentSession.wrapperEl || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88ddbd4c9fe197b485edeaa0c569e4d915369edf7f7a29c37e6b232bdc44bd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolveSvelteComponentAnchor() || wrapper.parentElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10379}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba9651062469c076329710ab7e3d2d560c2ad5180029f1c7f31c8099cd63fae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolved.anchor !== insertHoverAnchor || resolved.position !== insertHoverPosition || resolved.axis !== insertHoverAxis\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8193}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0fbe88378472f5c152a7f7c95d14b7e6da2a60b6a45711d609add381b10c6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060restoreOriginal \u0026\u0026 detachedOriginal \u0026\u0026 wrapperEl?.parentElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6008}}}],"partialFingerprints":{"codehealthFindingId/v1":"01506407e524433932610cf1bc19146c90c5fc887f7ceaa972aa3e0c3c3dbc73"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.failed \u0026\u0026 result.failed.length \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6323b53eae3606d77e1522558616e52520ae042a67e6ccb8f2975c912de3cd5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060root \u0026\u0026 root !== document.body \u0026\u0026 root.host \u0026\u0026 root.host.id === PREFIX \u002B \u0027-root\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4766}}}],"partialFingerprints":{"codehealthFindingId/v1":"157badd765b1326b775d1e077b7b6478e249b9198a84a357099c2b05754dcec9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rows \u0026\u0026 rows.length === 1 \u0026\u0026 rows[0] \u0026\u0026 rows[0].el === selectedEl\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c4c705d953a6a8496686ac97df97fc0120628e50eea2da3af3ce326f44c849"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rule.constructor.name === \u0027CSSFontFaceRule\u0027 || rule.cssText?.startsWith(\u0027@font-face\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8763}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a3ece6e280da4314cbdb54743d04da9aeeb58e8f9895da62d10af073119ae4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rule.constructor.name === \u0027CSSSupportsRule\u0027 \u0026\u0026 !CSS.supports(rule.conditionText)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8767}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cf91da2c994bba13c2f1f8f073bf06f515f4bf5caafe79e5e199ee98f2b8cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rule.media \u0026\u0026 !window.matchMedia(rule.media.mediaText).matches\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8765}}}],"partialFingerprints":{"codehealthFindingId/v1":"2721955a1c91a5e915aed726d3ac7a5e47f7f2e756a12ae0ef7495ffe7b165de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtimeModule || \u0027lib/impeccable/__runtime.js\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1998fd3f6566cb44eceabdd2a7f3ba12f993d71dece9b567332a0599e317e188"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtimeWrapper?.dataset?.impeccableVariants || runtimeWrapper?.dataset?.impeccableCarbonize\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4683be9574d281b39616f18b0a57669970b958b941c3f104346b2459a9096353"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.backgroundImage \u0026\u0026 s.backgroundImage !== \u0027none\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d44a527d970f3d77db501504960adb56eba61c82dc9c38a4abebd3c4388612"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sampleSurroundingRgb(actx, sx, sy, sw, sh, ancestorCanvas.width, ancestorCanvas.height) || averageRgb01(cctx, crop.width, crop.height)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8992}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3d59be9b7c2806b1a5ea10e4b0eb29ca31d91eed1b353f473312e649df1b50"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060saved \u0026\u0026 saved.id === sessionId \u0026\u0026 saved.insertPlaceholder\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10407}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86c5f486ea3b5eba4bca7ded06add4aa9986183c5277ae643121e115846d271"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060saved.arrived || serverSession?.arrivedVariants || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9912}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9abbbef163029d69291abc8451182125bc820401aa18029c10757a2208f911"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060saved.expected || serverSession?.expectedVariants || selectedCount || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9911}}}],"partialFingerprints":{"codehealthFindingId/v1":"80169edd1a69c7f46983f08ff07ada47424fd34bc4ebb880c7f47571a173c27f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060saved.paramValues \u0026\u0026 typeof saved.paramValues === \u0027object\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9793}}}],"partialFingerprints":{"codehealthFindingId/v1":"a084d139c6f841bf4f8a5d5dbea239dc462866018f9f865794eae7348ac02589"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060saved.visible \u003E 0 \u0026\u0026 saved.visible \u003C= arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10400}}}],"partialFingerprints":{"codehealthFindingId/v1":"519ee14ea8e179182dff9d9e1e29887b0df280638e13b80825e3a6406fe06910"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060saved?.appRoot \u0026\u0026 APP_ROOT \u0026\u0026 saved.appRoot !== APP_ROOT\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10019}}}],"partialFingerprints":{"codehealthFindingId/v1":"914e9e1652b2a5467f277184faf164201891fdab56c9e143fd33be9c27622dd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060savedState !== \u0027GENERATING\u0027 \u0026\u0026 savedState !== \u0027CYCLING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9900}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85d2d9d2c84d407ac4c8ad283cb2b1c1368175138a5038ebd12132dc2bdf050"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060savedState === \u0027CYCLING\u0027 \u0026\u0026 !isFrameworkComponentPreviewMode(currentPreviewMode)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0e53fe97c91a928b93a39a54176a7a567dcaf895706d31c372df6299406f53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060savedVisibleVariant \u003E 0 \u0026\u0026 savedVisibleVariant \u003C= arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfede2dc33d5916e5bf2f6d53598a4f01c9a74eec4c83e4368949c52cd15e5f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment.nth \u0026\u0026 indexAmongSameTag(el) !== segment.nth\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4737}}}],"partialFingerprints":{"codehealthFindingId/v1":"94892b1c79ff13fbb9357c0c1d1902289a07ad87cc64691077e85c69f8e39595"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectedElement \u0026\u0026 !document.body.contains(selectedElement)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7293}}}],"partialFingerprints":{"codehealthFindingId/v1":"454a0cfa24c08dece961d4b981e8a1f318b3132c339c0d0bc91c767c2b8083f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectedElement \u0026\u0026 document.body.contains(selectedElement)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"733950686fc19b4fe27c0f57d28270fa6b1839de9650b5493dde182b539451f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060selectedElement \u0026\u0026 hasTextRows(selectedElement)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5040}}}],"partialFingerprints":{"codehealthFindingId/v1":"8115a8452a1d6e82df3f84817e6c9ca458b3daee3a1901de655dc46f28cc657a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060serverSession?.expectedVariants || arrivedVariants || selectedCount || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4564c10761edef9c18f8886d703df209c464499afa876738b25482126ba7c43c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060serverSession?.expectedVariants || saved.expected || selectedCount || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9913}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc275b257a99a1a3fc70403137bfdeac3b4a0178334c1f4e41b9955adef68b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.generationCompletedAt || session.generationPhase === \u0027completed\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11901}}}],"partialFingerprints":{"codehealthFindingId/v1":"558e649b00d58498e6a688e0721d5a5ef82a4b3550ebfc6f3ea0978d6b1558c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.paramValues \u0026\u0026 typeof session.paramValues === \u0027object\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9881}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb85c9a04571422bc4b0904a87847b971436caca80f5ce815607898cd3d09da4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session?.id \u0026\u0026 !isTerminalSessionSummary(session) \u0026\u0026 !isSessionHandled(session.id) \u0026\u0026 session.pageUrl \u0026\u0026 pageMatchesCurrent(session.pageUrl)\u2026\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9856}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d8c1b90afa489f690545cc8bdaa5b67a169b29ce318598b7669d4317316abd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session?.id === saved.id \u0026\u0026 pageMatchesCurrent(session.pageUrl || saved.pageUrl) \u0026\u0026 !isTerminalSessionSummary(session)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9823}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc77293028d1f0c816df3f49f908a27d8b4a6d1df7ab00de173fdfda596d1c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session?.mountTargetEl?.firstElementChild || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"621e58fb3af5dab97db4d3292810316af7be54852d2c9b15c97ff844fee83d8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sessionId !== currentSessionId || state !== \u0027GENERATING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9979}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ab5264d4211dc4cec75098c4752fb1392d915485c667537d2eee0a210642fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sessionId === currentSessionId \u0026\u0026 (state === \u0027GENERATING\u0027 || state === \u0027CYCLING\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6530}}}],"partialFingerprints":{"codehealthFindingId/v1":"65904409e6c355f9a216796cdeca545e93e7426c7e3c0042c35926c13129ea51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sessionStorage.getItem(HANDLED_WRAPPER_RELOAD_KEY) || \u0027\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10227}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c1cb65b9e8ee4f4e54426a975d7f0ba4dbad4fffb32186b58285b25a42a2fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060shouldFocusSteerChat() \u0026\u0026 !steerFocusSuspended \u0026\u0026 !isPageEditableActive() \u0026\u0026 performance.now() \u003E= steerFocusPauseUntil\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10899}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00a39441b91a2f82761ecdf50287cfb03ba2d1ebdbb9e480637e16b75e6d57b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sidecar?.narrative || synthesizeNarrative(parsed)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d748ed544da07d830586c3ecb41e01ffa1e4aee40a778742262214b934586cae"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snapshot \u0026\u0026 (snapshot.comments.length \u003E 0 || snapshot.strokes.length \u003E 0)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8933}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3d48bc4bc6c21fc9ea7185fd697baf066d299cf3a744f87b954e827580036d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060src.indexOf(\u0027data-impeccable-variants=\u0022\u0027 \u002B sessionId \u002B \u0027\u0022\u0027) !== -1 || src.indexOf(\u0022data-impeccable-variants=\u0027\u0022 \u002B sessionId \u002B \u0022\u0027\u0022) !== -1 || \u2026\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9e9793966a7e97cd060cd15760417e89ac2389c38fbbf6f78777a14b6e9bf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060startIdx !== -1 \u0026\u0026 endIdx !== -1 \u0026\u0026 endIdx \u003E startIdx\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ace0de651f6ea751b1fd855adf0b0e9d9ebaeeb1734a32d6cfad00093938ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state !== \u0027CONFIGURING\u0027 \u0026\u0026 state !== \u0027EDITING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c84c15ebe81b2a79a3fde0ae8f37fbdc002458da0eef7fa9a002defde7f2e27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state !== \u0027CONFIGURING\u0027 \u0026\u0026 state !== \u0027EDITING\u0027 \u0026\u0026 !steerLocked\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10863}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dbac3f9af32ac0be145c0b104b56c5a9050f8171726bf39bfbd01c8f14b633"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state !== \u0027GENERATING\u0027 \u0026\u0026 state !== \u0027CYCLING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6714}}}],"partialFingerprints":{"codehealthFindingId/v1":"2112af580cc9fd7ddb38019c0f9235b7d4b61ab0473901ebb300591119652f3d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state !== \u0027GENERATING\u0027 || !currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"69eed28d555a40af2ec440747f3b36b757f17885234265843d1da5591cfd9782"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state !== \u0027GENERATING\u0027 || currentSessionId !== sessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6603}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49b1af6a5a807f9e91adbb47a2915aa9b4a1048c527c6a5af60732bd7ac8b57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state !== \u0027GENERATING\u0027 || msg.id !== currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7914}}}],"partialFingerprints":{"codehealthFindingId/v1":"52914aa2b7a9fc8405c7e3c5e14fa8e91f37d62fe2f5bee79bc1c19240a23d84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state !== \u0027IDLE\u0027 \u0026\u0026 state !== \u0027PICKING\u0027 \u0026\u0026 state !== \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7554}}}],"partialFingerprints":{"codehealthFindingId/v1":"b543805accd47a8b044fbd9f9e68c5c2d9cee44aeb3d96f3d4bfec520d3000d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027CONFIGURING\u0027 \u0026\u0026 !own(e.target) \u0026\u0026 selectedElement \u0026\u0026 !selectedElement.contains(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d89572b77748fa6f1cf78f8ef1d84fb1d20b2b55994e9152cf1bde2557950f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027CONFIGURING\u0027 \u0026\u0026 configureKind === \u0027insert\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7748}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d43821364a1f9c14b151b78fabe7e89917df68359715fdb600df504f59c65a8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027CONFIGURING\u0027 \u0026\u0026 selectedElement\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4282}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa74c338171ffa66da518b956a8b6b2e1665518ce528ec6cdf2d50cf9a79c53"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027CONFIGURING\u0027 || state === \u0027GENERATING\u0027 || state === \u0027CYCLING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7373}}}],"partialFingerprints":{"codehealthFindingId/v1":"553b5db03e2444d17a37e03d99ba82a6740cb5624d8107c736a200e6a0fa9101"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027CONFIGURING\u0027 || steerLocked || voiceListening\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10916}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b289e382bd1e9d7601fc576a827056bddf609f337a13abe83d50c03c5cf1f32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027EDITING\u0027 \u0026\u0026 !own(e.target) \u0026\u0026 selectedElement \u0026\u0026 !selectedElement.contains(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8231}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd51d20171000ffd5fd8b79a065c3f657cbee4bf729a4774d709f9d46e500419"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027GENERATING\u0027 \u0026\u0026 currentSessionId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7782}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a97c4b2204a0a6ec72d8b6a474ffe88bacb411f91892eec15a7c325b299b5f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027GENERATING\u0027 || state === \u0027CYCLING\u0027 || state === \u0027SAVING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8024}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6bdcb4fa7df03e6f59e68d3276f2a914e6904c2e153df37c07831b25a3925c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027GENERATING\u0027 || state === \u0027SAVING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11793}}}],"partialFingerprints":{"codehealthFindingId/v1":"be37ccdfb436fdeabda27f2cba6420908a27dbf0401d7b5aad127f75e16ea143"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027IDLE\u0027 \u0026\u0026 (pickActive || insertActive)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8313ba3d4673998527829cf8dc370736def7bb13c23f55002f4cdfa5b0c753b1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027PICKING\u0027 \u0026\u0026 insertActive \u0026\u0026 insertHoverAnchor\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf65f466c469ca1729e343c1b8f0aa81b2cd70950af10c16e1a93686a82f40a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027PICKING\u0027 \u0026\u0026 pickActive \u0026\u0026 !insertActive\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6f9d7c886969686b9cefd104d6acda2be36a682a7f88060bb26eb3cd8bce75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027PICKING\u0027 || state === \u0027CONFIGURING\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":12505}}}],"partialFingerprints":{"codehealthFindingId/v1":"edef0d898e90b553b9c8301de6b62da00a79b30599a79038e40c51f10063fab4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060state === \u0027SAVING\u0027 || state === \u0027CONFIRMED\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c26f3280e4b67b83f2789b65bcfec829dc9bd4bc83143f9e142179099195f51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === \u0027acting\u0027 \u0026\u0026 targetId !== exceptTargetId\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7556}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bff2790303d6637faffad0eabcef24b88d6443b0261d9092af4b7b3e6f08a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === \u0027acting\u0027 || status === \u0027done\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7636}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca40cdabb57feb771b8cce7e4be2d8945ba6d78012b516901314537338519e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060steerLocked \u0026\u0026 !agentPollingConnected \u0026\u0026 agentHasWorkInFlight()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10819}}}],"partialFingerprints":{"codehealthFindingId/v1":"65076bbef9cae4887ebb2a31b333ca4993ea6f06a551b76b6ce2f1da0083ee7e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060steerLocked || pageChatVoiceBtn.contains(e.target) || pageChatSendBtn.contains(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11710}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e948ba1ef12c6bc26957714f21114e0c11966021ecbb6d8d4843dd9dd317e03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060style.display !== \u0027none\u0027 \u0026\u0026 style.visibility !== \u0027hidden\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4881}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7b4fc92fe2c96e67ffbd35e38baf8a76993bb84c1d7fce32c4d68e80d1025d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060summary.sourceFile || summary.previewFile || currentSourceFile || currentPreviewFile\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9975}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6b5488849736a0d65dffe77ceb97edefae786fe8423382f73409f5e65f8c3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060svelteComponentSession.mountedInstance \u0026\u0026 runtime.unmount\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5931}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2ad76bb158355c9215526073c5e31cf459950c622ef4907d3a92d705042829"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060svelteComponentSession.mountedVariant \u003E 0 \u0026\u0026 svelteComponentSession.mountedVariant \u003C= arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05820ef0cabdcfe8691564561dd1d6583ab2fc7637a6f0105162de98b90f65d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060svelteComponentSession?.mountedVariant || 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e486f7af842c733da0ed650ae04e18719f84d1e2a0af8f570ae5cd669aae2ceb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060svelteComponentSession?.sessionId === acceptedSessionId || isFrameworkComponentPreviewMode(acceptWrapper?.dataset?.impeccablePreview)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9500}}}],"partialFingerprints":{"codehealthFindingId/v1":"624a5f6f2b2ef69d36f7292aab11207939ba61feaf35c2485b5e96747a9ce720"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060svelteComponentSession?.sessionId === currentSessionId \u0026\u0026 (state === \u0027GENERATING\u0027 || state === \u0027CYCLING\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a361734c805b4161949b64fd84c784d4a6d9fa3c26d2424d5e823140ef821cd1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060svelteComponentSession?.sessionId === currentSessionId \u0026\u0026 svelteComponentSession.mountedVariant \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69cf7b56feca3fcfce9a9b96f1da772d2c81e42385ab7b82fe81aa6715dbc64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060svelteComponentSession?.sessionId === sessionId \u0026\u0026 svelteComponentSession.mountedVariant \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6888}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67568c076e9b883cb6f19b78824ab9680691ec527a4e9a87549ea1a1b5b6dd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t[0] === \u0027raw\u0027 \u0026\u0026 designState.raw === null \u0026\u0026 !designState.loading\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13051}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ad2ad42aeaa08da170213c7135e316fbdb582e9c963f5f5a99d8d7ad137d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.title || target.getAttribute(\u0027aria-label\u0027) || target.textContent || EDIT_COPY_LABEL\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4914}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7459086f85220c7d5c86bbeef77d3f93748a780e01bf65c0c4021403db1918"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tuneOpen \u0026\u0026 paramsPanelEl \u0026\u0026 !paramsPanelEl.contains(e.target) \u0026\u0026 barEl \u0026\u0026 !barEl.contains(e.target)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8227}}}],"partialFingerprints":{"codehealthFindingId/v1":"764e5036f3a4c7e15599d1c4bf3e6423016c463499edb2dfa4f88352b9479a45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof c.value === \u0027string\u0027 \u0026\u0026 c.value.match(/^oklch\\(\\s*([\\d.]\u002B)%\\s\u002B([\\d.]\u002B)\\s\u002B([\\d.]\u002B)\\s*(?:\\/\\s*([\\d.]\u002B))?\\s*\\)$/i)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":13347}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bf408e08ce8a538118c549d909f04e5fa0eae402b56857f94f529d8cda1f99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry.file === \u0027string\u0027 \u0026\u0026 entry.file.trim()\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-ignores.js, .agents/skills/impeccable/scripts/live-browser-ignores.js, .claude/skills/impeccable/scripts/live-browser-ignores.js, .cursor/skills/impeccable/scripts/live-browser-ignores.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":".agent/skills/impeccable/scripts/live-browser-ignores.js"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"b605f0fc528536f49dd14658daf365a24901dc313397435c153ea91cb3fb1f41"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof initialAnchorTop === \u0027number\u0027 \u0026\u0026 isFinite(initialAnchorTop)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7090}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f8716ec41e39c437561e43e2a206dc286135f3784801a6fffea65b35e59538"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof initialTargetY === \u0027number\u0027 \u0026\u0026 isFinite(initialTargetY)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7087}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ce60c70236f626bbe795bc1e25868acc9a43e26acaca4d126d3f09c4cf1541"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof prompt === \u0027string\u0027 \u0026\u0026 prompt.trim().length \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1937}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9773271704ea15d60b15af83989160e9b47c12c839410ed10aedfe1029ccbb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof providersRaw === \u0027string\u0027 \u0026\u0026 providersRaw.trim()\u0060 appears character-identically in 2 files \u2014 scripts/lib/utils.js, scripts/lib/validate-plugin-manifest.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":"scripts/lib/utils.js"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"905ec71a9e76e89b894bdf3300fcfef89d5451a381d1e94deab2feb6566c4525"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027number\u0027 || !Number.isFinite(value)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf000d066595865bb38151912242d323606fcd9524f97fdad1bc9c8a3f45cde"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uiGetById(PREFIX \u002B \u0027-configure-voice\u0027) || uiGetById(PREFIX \u002B \u0027-insert-voice\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11352}}}],"partialFingerprints":{"codehealthFindingId/v1":"e448d865214b17c7a2647d68344730ce850440e7e0c66b2b7ec5b9ef302d2fba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uiGetById(PREFIX \u002B \u0027-input\u0027) || uiGetById(PREFIX \u002B \u0027-insert-input\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7ee6334750ee50386ddbed09275d142c4510f310ee5a2a37766a1650f60ee4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uiGetById(PREFIX \u002B \u0027-input\u0027)?.value || \u0027\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedb5498363c588a890e45637e3255113462450057d9d5fd0a652ff12dbb755a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060uiRoot \u0026\u0026 typeof uiRoot.appendChild === \u0027function\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser-dom.js, .agents/skills/impeccable/scripts/live-browser-dom.js, .claude/skills/impeccable/scripts/live-browser-dom.js, .cursor/skills/impeccable/scripts/live-browser-dom.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":".agent/skills/impeccable/scripts/live-browser-dom.js"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"528b1ceda0bd4c88ec34d6dd1ed39e6aacc687b654c0a9b16e8f7d699c6608ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060variant.dataset.impeccableVariant || \u00270\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6896}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba958e0d28cfd2e673c2bda2352849c41d9d0c94706ede84525d1a4f99f3390"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visibleVariant \u003C 1 || visibleVariant \u003E arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":3091}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ad90fc64ba41fbe799b7324c0cd4d20e4ffd8c99a31d8559d96a753b17eca1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visibleVariant === 0 \u0026\u0026 arrivedVariants \u003E 0\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7320}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b0e0eaff11d99a65aa6b733b75f8c694227c3c609ff4298a11adee3c712b4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visibleVariant \u003E 0 \u0026\u0026 visibleVariant \u003C= arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6098}}}],"partialFingerprints":{"codehealthFindingId/v1":"f903f0957a73a0c6a8f682c3da032ba12fa50ac26d4dff51c6de0a32aad66860"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060voiceListening \u0026\u0026 voiceCtx?.mode === \u0027configure\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0d7b10c1743ec2ea9cb441576410ea721fb8ecef9b8c735559837eea763f0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060voiceListening \u0026\u0026 voiceCtx?.mode === \u0027steer\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11497}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b49afcad9e89129642db7334cf3d19aea0befcada2f633d91176cea812b4b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.CSS \u0026\u0026 typeof window.CSS.escape === \u0027function\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":4742}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c23d03ac12660a2c94430b8d829d64409859786b1cab7081b884db147a5942"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.SpeechRecognition || window.webkitSpeechRecognition || null\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11300}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f6d0249331171aba3e2f3d8d127ddf7615ef096971b438097d1601a269149c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.__IMPECCABLE_COMMAND_PREFIX__ || \u0027/\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"55629be08cb68e606385a8c35f500ef34005c2bfc01b115c82376fdeff174a65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.__IMPECCABLE_LIVE_ADAPTER__ || \u0027\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":8870}}}],"partialFingerprints":{"codehealthFindingId/v1":"6528710ca50d6d84dda57d003fc72c2040ef8c58473c2925cabb73fd5d20f8e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.__IMPECCABLE_LIVE_ADAPTER__ || \u0027dom\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e90dc9f551aa1755f3e326b5775ff3f4781c79d930b5595d201b3e88bbe680"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060window.cursor || window.__CURSOR__ || window.__GLASS_BROWSER__\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":11308}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cff0a3f1e9ca9b14a3b324fce67c850bd9d9093dc05c4fc7871bf71e4d5634"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapper \u0026\u0026 !hasFrameworkHmrOwnership(wrapper)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9572}}}],"partialFingerprints":{"codehealthFindingId/v1":"580f26c9d00450c78489d80df0543584806b97b666dd4ab6e9a927db5434b04a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapper \u0026\u0026 !isFrameworkComponentPreviewMode(wrapper.dataset.impeccablePreview)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":9950}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02ea00f6db37d82199c09b991b265191e1132bca1ff62f8e606e7fbc32072e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapper || document.querySelector(\u0027[data-impeccable-carbonize]\u0027)\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b17b48eb46ec1dd0a35c56e3fed0cb4a478df0b4c703991c0d64624474a45d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapper.dataset.impeccableVariantCount || \u00270\u0027\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":7332}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f147472c9a8e641f5faf2dd3088249b379846fb7bb5b553f3fd4cf6d4a891c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapper.dataset.impeccableVariantCount || arrivedVariants\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":6582}}}],"partialFingerprints":{"codehealthFindingId/v1":"612009d689f881f1996bffb29215c4af89de0d209595a8597451e779a4a01487"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060wrapper?.dataset?.impeccableVariants || wrapper?.dataset?.impeccableCarbonize\u0060 appears character-identically in 23 files \u2014 .agent/skills/impeccable/scripts/live-browser.js, .agents/skills/impeccable/scripts/live-browser.js, .claude/skills/impeccable/scripts/live-browser.js, .cursor/skills/impeccable/scripts/live-browser.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":".agent/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10242}}}],"partialFingerprints":{"codehealthFindingId/v1":"03aa15f9375d0edab4af1fea4b08b2ac8d16fde620984ee661295352646d021e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.environ.get(\u0022HERMES_HOME\u0022) or os.path.join(os.path.expanduser(\u0022~\u0022), \u0022.hermes\u0022)\u0060 appears character-identically in 2 files \u2014 .hermes/plugins/impeccable-design-hook/__init__.py, skill/hermes-plugin/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/impeccable-design-hook/__init__.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a00e7520798b14190368ca433d7b700435efbd60e0279b4e075112046e0c43"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060os.path.isfile(candidate) and _project_trusted(current)\u0060 appears character-identically in 2 files \u2014 .hermes/plugins/impeccable-design-hook/__init__.py, skill/hermes-plugin/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/impeccable-design-hook/__init__.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02f21cb04becbabf7aebc1cbe4df1757559d7491fe34de2cf6b3864448b0473"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output.get(\u0022decision\u0022) == \u0022block\u0022 and isinstance(reason, str) and reason\u0060 appears character-identically in 2 files \u2014 .hermes/plugins/impeccable-design-hook/__init__.py, skill/hermes-plugin/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/impeccable-design-hook/__init__.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"329b327fc7ed3a98ddde1e8c21b353fe7d2112ed98c8139a7e3ba47ba9b8136e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool_name not in _TOOL_NAMES or not isinstance(result, str)\u0060 appears character-identically in 2 files \u2014 .hermes/plugins/impeccable-design-hook/__init__.py, skill/hermes-plugin/__init__.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".hermes/plugins/impeccable-design-hook/__init__.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f30fe40ea94e4fa16dd8ec6be08e76fe1a42ef3d6d5035d4f33073fabd698b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!font_size.is_finite() || font_size \u003C 8.0 || font_size \u003E= 200.0\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/page_checks.rs, crates/html/src/page.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"face29d7f196cde460d56cff425cbc627031d4a44fada0791753d9f5d2ad5d42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!m.is_file() || m.len() \u003E MAX_FILE_BYTES\u0060 appears character-identically in 2 files \u2014 crates/browser/src/html_snapshot.rs, crates/cli/src/capture_snapshot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1269fea37f6907fb53b1400f73630cdec5e5bf625df8af56c16497e89938eaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!num_truthy(heading_level) || heading_level \u003E 4.0\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/text_collectors.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2148b7b04a5cfbe1ee46fbfe84884328688bed9c3d981700792e572981c2e934"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!opened.is_file() || opened.len() \u003E MAX_FILE_BYTES\u0060 appears character-identically in 2 files \u2014 crates/browser/src/html_snapshot.rs, crates/cli/src/capture_snapshot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6141111083a6f8e2dcb79fc3adb91cd960f3b26288bb31ed7a58c35923bb9a10"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!position.is_empty() \u0026\u0026 position != \u0022static\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/visual.rs, crates/html/src/layer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/visual.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"038100543730470ba63e49503a58f65aeeb0385f29c9271b8034e02fc2257b85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pseudo_surface_read \u0026\u0026 !surface_unresolved\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2784}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ec060bbd065ed504117912f0794b997ad48aa6815f5d073251efc7bc915715"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Some(el) == dom.body() || Some(el) == dom.document_element()\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/core/src/browser/painted.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":2552}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70310aed141e8dc79734d5303e1fb61f11acb5696ce65226b8843d6e758641d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Some(parent) == dom.body() || Some(parent) == dom.document_element()\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/painted.rs, crates/core/src/browser/text_collectors.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/painted.rs"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"19863f4765eb4d08aa72b6e9378f597905c3a10baabae952d6dd185ab58e9eba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.contains(\u0022gradient(\u0022) || args.contains(\u0022url(\u0022)\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/core/src/browser/painted.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e63624e098575171162f3fed7a7c4ef814a35800b74545d9e2ddd2de8def440"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060aria_level.is_finite() \u0026\u0026 aria_level \u003E= 1.0\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/text_collectors.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/text_collectors.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b4d261493a89df5bf1cb89abffe305c5d710d84cb4d5333ebe4007eb1bed78"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before.dev() != after.dev() || before.ino() != after.ino()\u0060 appears character-identically in 2 files \u2014 crates/browser/src/html_snapshot.rs, crates/cli/src/capture_snapshot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf41f4573c5f7324681c112e1db1a24d9c1d2d4069f648c4b19b4512795c1b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060before.dev() != opened.dev() || before.ino() != opened.ino()\u0060 appears character-identically in 2 files \u2014 crates/browser/src/html_snapshot.rs, crates/cli/src/capture_snapshot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"796f21e122a0c475e509d19148beee1001caeaf30475915a3462572551171f8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060box_shadow.is_empty() \u0026\u0026 text_shadow.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":3695}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f04cd6b866782248f7cf7589a9c7687b40b1bde3094ff35452ee5b8e3126923"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() \u003C= 8192 \u0026\u0026 method == Some(\u0022GET\u0022) \u0026\u0026 protocol == Some(\u0022HTTP/1.1\u0022) \u0026\u0026 first.next().is_none() \u0026\u0026 hosts == [host]\u0060 appears character-identically in 2 files \u2014 crates/browser/src/html_snapshot.rs, crates/cli/src/capture_snapshot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77dabe37b3cf7dc809a027ce45fd83832ad97d11107fab94021db1f02ae44a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() as u64 \u003E MAX_FILE_BYTES || before.len() != after.len() || before.modified().ok() != after.modified().ok() || bytes.len() as u64 \u2026\u0060 appears character-identically in 2 files \u2014 crates/browser/src/html_snapshot.rs, crates/cli/src/capture_snapshot.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/html_snapshot.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb0966311c2bca8c97dbf7245e8e3a9d7aaf3cf7dc9dc40fa5bff3e42745a0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_ascii_alphabetic() || c == \u0027_\u0027 || c == \u0027$\u0027\u0060 appears character-identically in 2 files \u2014 crates/live/src/manual_edits/commit.rs, crates/live/src/svelte_ast.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3353e9663770efb0fe68a6d8a84444f4262d2438b655ebca4007d3038659179a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_ascii_alphanumeric() || c == \u0027_\u0027 || c == \u0027$\u0027\u0060 appears character-identically in 2 files \u2014 crates/detect/src/detect_text.rs, crates/live/src/svelte_ast.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/detect_text.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf2ce302b0982bc056ae4e5932eebdda7845076f6f34c16ecf8b074c8d94462"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_ascii_alphanumeric() || c == \u0027_\u0027 || c == \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/live/src/svelte_component.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"504aa57af9dffc2d56d5519e6b81234edaa8678966b1488b0bb29a0e729f8020"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch == q \u0026\u0026 (i == 0 || chars[i - 1] != \u0027\\\\\u0027)\u0060 appears character-identically in 2 files \u2014 crates/context/src/design_parser.rs, crates/html/src/cascade/values.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/design_parser.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"028e390cd3c4af8e4e8cd3c2b22988626e63a03f40a9f1954f12c98eec2a3c45"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content.is_empty() || content == \u0022none\u0022 || content == \u0022normal\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/page_checks.rs, crates/core/src/browser/visual.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":2832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb86f095dcf67c34ce81315f35c1592a52c3e2bdb42a3b2b0b5c32157ac1d2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060display != \u0022inline\u0022 \u0026\u0026 display != \u0022contents\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/core/src/browser/text_geometry.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":6034}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c57394969f3cb22a1c976bd3ceaf545e47c049c6db0194631997b87dae66d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060display == \u0022contents\u0022 || display == \u0022none\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5017}}}],"partialFingerprints":{"codehealthFindingId/v1":"5785623f7045f1ff25fdfc5354cbeeb660a285cb414e3edb32b0f14d2c53ea95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060display == \u0022none\u0022 || visibility == \u0022hidden\u0022 || visibility == \u0022collapse\u0022 || content_visibility == \u0022hidden\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/page_checks.rs, crates/html/src/page.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"91da88a2bc5958526bb1b669e4ec340c4e58ff3640f596b409c2ebf6566d6e19"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060display.contains(\u0022flex\u0022) || display.contains(\u0022grid\u0022)\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/decorative_text.rs, crates/core/src/browser/visual.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/decorative_text.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cfa156623478a3af62b08163ae28b5f3aa7c6d61e354286a32ab064de1c16a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dom.style(c, \u0022display\u0022) == \u0022none\u0022 || visibility == \u0022hidden\u0022 || visibility == \u0022collapse\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/core/src/browser/page_checks.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8825f630f0d2aff146efa7bd973b767461811d25e4d61a4c9d9a6f192af963"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element_id.is_none() \u0026\u0026 classes.is_none() \u0026\u0026 query.is_none()\u0060 appears character-identically in 2 files \u2014 crates/live/src/live_insert.rs, crates/live/src/live_wrap.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/live_insert.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ce1878fc6d9f7d33c4186c94d58973fb1a66dd74eb11d486ca6c8c48afd694"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060element_rect(dom, el).is_none() || !ai_palette_is_visible(dom, el)\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/core/src/browser/element_checks.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d40d60c6fcfcc0424038da10144b8883254f669e49a39c9456880acf97f62f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060font_size.is_finite() \u0026\u0026 font_size \u003E 0.0\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/page_checks.rs, crates/core/src/browser/text_geometry.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":4322}}}],"partialFingerprints":{"codehealthFindingId/v1":"925fc09b1140dd4bdb9cd6e36934b0f55a29dca33f04553eb4db4090bc1bd70e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u002B 1 \u003C args.len() \u0026\u0026 !args[i \u002B 1].starts_with(\u0022--\u0022)\u0060 appears character-identically in 2 files \u2014 crates/detect/src/ignores.rs, crates/hook/src/admin.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/ignores.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf355183c559b9eaa69965fbfea78cad48fd41f9b8804a400e26a6ff2576cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060j \u003C b.len() \u0026\u0026 (b[j] as char).is_ascii_whitespace()\u0060 appears character-identically in 2 files \u2014 crates/live/src/manual_edits/commit.rs, crates/live/src/manual_edits/evidence.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"316751a8edb3568929464462ea5b67b17a684d2cc668a3bf23b48ec55365af6e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060l.alpha \u003E= crate::checks::measures::FAINT_PAINT_ALPHA \u0026\u0026 (l.x != 0.0 || l.y != 0.0 || l.blur \u003E 0.0 || l.spread != 0.0)\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/page_checks.rs, crates/core/src/browser/text_collectors.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/page_checks.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"88037b9ed4411741384a137cb71724eed06cec4c14c590732f5c9d3890d3e1b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.starts_with(\u0022http://\u0022) || lower.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 3 files \u2014 crates/context/src/surface_briefs.rs, crates/context/src/target_slug.rs, crates/detect/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/surface_briefs.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e472c5b8e4891fe85a419a3c5bf8f7c62f6a24a6c169fd3d8d8f0e0c797323a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060marker_in(e, \u0022command\u0022) || marker_in(e, \u0022commandWindows\u0022) || marker_in(e, \u0022args\u0022) || marker_in(e, \u0022bash\u0022) || marker_in(e, \u0022powershell\u0022)\u0060 appears character-identically in 2 files \u2014 crates/hook/src/admin.rs, crates/skills/src/hook_manifest.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf2278061a865c2f01f03656a70f11c0d5d4705fee5ae1cbc54f158d26e2377"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.ends_with(\u0022CLAUDE.md\u0022) || path.ends_with(\u0022AGENTS.md\u0022)\u0060 appears character-identically in 2 files \u2014 crates/agents/src/render.rs, crates/agents/src/resources.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf6a45e8b75267bb03591023bfe577b3adb99ada1cc6f440cd6088506a488dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060position != \u0022absolute\u0022 \u0026\u0026 position != \u0022fixed\u0022\u0060 appears character-identically in 5 files \u2014 crates/core/src/browser/element_checks.rs, crates/core/src/browser/page_checks.rs, crates/core/src/browser/visual.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aca39bcdc1fea7565afc3685bfc73b4ba68348f1a9c15a9799a26efd9850ec0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060position == \u0022absolute\u0022 || position == \u0022fixed\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4828}}}],"partialFingerprints":{"codehealthFindingId/v1":"397cf4828360a87a63868f1488ef69ffaeecd26205dfa11715c48914da84ecd0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060quote.is_none() \u0026\u0026 (ch == \u0027\\\u0027\u0027 || ch == \u0027\u0022\u0027)\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/detect/src/design_system.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e63ff3ff747135db75c75f4f720f7f7f6dac6a094f67ce99a1118aa72c5b77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.all_finite() \u0026\u0026 r.width \u003E 0.0 \u0026\u0026 r.height \u003E 0.0\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/core/src/browser/text_geometry.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":5509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d625360c8798a95f1cde5f18270eff17481e8d4d216c872d702b3d5d316eed7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role == \u0022none\u0022 || role == \u0022presentation\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/element_checks.rs, crates/html/src/adapters.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":4959}}}],"partialFingerprints":{"codehealthFindingId/v1":"563e682c457cdb86a049ecf19332cf25d0be339a42038d50deb976e440047567"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stripped.is_empty() \u0026\u0026 hooks.iter().any(value_has_impeccable_hook_marker)\u0060 appears character-identically in 2 files \u2014 crates/hook/src/admin.rs, crates/skills/src/hook_manifest.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/admin.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e482f805b1338775d8ca45446a001911856292d857b4f301c22bfe8f9e7ab9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.contains(\u0022var(\u0022) || text.contains(\u0027%\u0027)\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/detect/src/design_system.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c6e2277ce33f32713c35ed6ff200e07f7083d172ae094e0a9d27eaac687520"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.is_empty() || text == \u00220\u0022 || text == \u0022none\u0022 || text == \u0022initial\u0022 || text == \u0022inherit\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/detect/src/design_system.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652b3e7058219623eb08278b7f5a127807d0d1010ff8f99506aa09acd8b20a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.is_empty() || text == \u0022transparent\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/detect/src/design_system.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6afa455817dd60069a72640b00cd297316df5a38beef07c2467d2c14810a374"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.is_empty() || text == \u0022transparent\u0022 || text == \u0022currentcolor\u0022 || text == \u0022inherit\u0022 || text == \u0022initial\u0022\u0060 appears character-identically in 2 files \u2014 crates/core/src/browser/driver.rs, crates/detect/src/design_system.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/driver.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"41af3384177fc555f8ae981c3c0bfb6d2766bb63da7474b8eff7fe636c12192f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.is_empty() || trimmed.starts_with(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 crates/context/src/context.rs, crates/detect/src/design_system.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/context.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c257f68682e8a2d8a18d50d65d8d7292b14bf4bca9b0f5c565b18e4f024d5b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visibility == \u0022hidden\u0022 || visibility == \u0022collapse\u0022\u0060 appears character-identically in 3 files \u2014 crates/core/src/browser/element_checks.rs, crates/html/src/adapters.rs, crates/html/src/field_label.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":3809}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d3128beb0d2c3b0e24be2d5a17688b561270872c285c27bc94fefa0239b1e0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060y1 \u003C -0.1 || y1 \u003E 1.1 || y2 \u003C -0.1 || y2 \u003E 1.1\u0060 appears character-identically in 3 files \u2014 crates/core/src/checks/html_patterns.rs, crates/core/src/checks/rules.rs, crates/detect/src/regex_matchers.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/html_patterns.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"437cdbf5eafa15e90f942d49d277d8c16cf7a5c8bd117662c99fda520dc3c436"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/20 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: download: \u0060download\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/bin/cli.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f3e6572fc0b67c3ac54e1cbb6ea8acb5790dfba7138c3986fb75e0a6bb55bd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: start: \u0060start\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/entry.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa5bcd266fbc3aadbd23776bec1367baeaf7c7dffb7539389c0e8e522cb5b40"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: onSubmit: \u0060onSubmit\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/component-review/entry.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d64ab504759a0e3e8f9cc12b626caec8aec8efc05089046ef00e4799b248ca"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: removeSelectedElement: \u0060removeSelectedElement\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"4936fe21c7ec7a2807a95738262bdf33410bfce0d55db164ee9302bb08bb5f26"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: undoElementRemoval: \u0060undoElementRemoval\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65ec465c282af05942a6b967ee5435e46f256102020ce7f6fce6d8b46511616"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: applyEditing: \u0060applyEditing\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4017}}}],"partialFingerprints":{"codehealthFindingId/v1":"86145c256250dbc846322d504049319f35f067ce6a230cecd8cf2b9ede0383f0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchPendingCount: \u0060fetchPendingCount\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4372}}}],"partialFingerprints":{"codehealthFindingId/v1":"db29851b5aafb811d88760facac30cd0e6aedc3c237b7db878ee47b62f301b56"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: onPendingPillClick: \u0060onPendingPillClick\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b98d9cde6409d7362d43fbfdc4c5bee01d18a37d49e003d8cacb65fb4e4e8cf"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: onPendingTrashClick: \u0060onPendingTrashClick\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca79265671392e6f6925ec6892dc761496d82ba9f918e43781637bbad08d5717"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: onPendingKeepFixingClick: \u0060onPendingKeepFixingClick\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd77efd674f3fe43f13d0c32bfe7443b18d10a9ae75f58e5c08d7faf216acf3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: onPendingRollbackClick: \u0060onPendingRollbackClick\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":4489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6824fd7e0a87e6a81f54dc328df9735add7ef5d51a7988caa56c4fb9961edc02"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadSvelteComponentParams: \u0060loadSvelteComponentParams\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c924f9a943ffcdfcf2f47982d0787db370791a60054ac7e576f108a06687d9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: injectSvelteComponentsFromManifest: \u0060injectSvelteComponentsFromManifest\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":6052}}}],"partialFingerprints":{"codehealthFindingId/v1":"877626fa6c728fc7175d44eb61693cbcc8d9b37d400a82eba871955268431c0a"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: inlineFontUrls: \u0060inlineFontUrls\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2784dec376b64b58ed1858c9523df6db726eb9ed00b3f66679adad70a09f27e3"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: collectFontFaces: \u0060collectFontFaces\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":8746}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3defa65d0fe42cc8695adb59c62810784fd699789360854666b2e1371edca01"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: captureAndEmit: \u0060captureAndEmit\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":9002}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2803aea87b99d5526878e364d66bc3a2cca3d186896bb58015aee036c5eae1e"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchDesignSystem: \u0060fetchDesignSystem\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":13079}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ba49fef2c81ee239b8ca2b3269cd5fd20ed66ade5f188b06a04c39dad61ba1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: initSettings: \u0060initSettings\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extension/devtools/panel.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"086a636aebebe0e71468d0c65bf75370f1c36f820140822e75fae5df78925505"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: di: \u0060di\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae790f40739f3961cb9b927e8ea1034b057ef7b069a04a692b764ac7b82ecb30"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: onSubmit: \u0060onSubmit\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/assets/component-review.js"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"990edc8382b080f9b38b99d26e93bba8c228e1a370425fc3f76267e46e78055f"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~38.6 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 86 assertion(s) across the 2228 source line(s) of the 12 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: ui/component-review/review.ts (53), ui/component-review/plan-review.ts (30), ui/component-review/entry.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060drifted_hooks\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/agents/src/render.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c397a276c2ce0f453a57bffccb59a7cf51d37f3b7f6855ed386ad6884cf14c6b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060probe_layout\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/browser/src/fullpage.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"db59ee07c5281f691bb3e6457f7d44624b942c260ce2b7a3c18c54157b24df8d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_string\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\\u0022\\\u0022\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/font_render.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"404cfbd32bb378013f62d8750d59c94882c0440b7b5d0bb144ad9f887874daf8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060svg_illustrations\u0060 turns every \u0060Err\u0060 into \u00600.0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp/src/hero.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"520639a7ec096c7a40bb46979229bd35493732e850e6f11b77a7f74c076581c7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060organic_clip_regions\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/src/build_phase.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"b002653ac0f280af3f6951c118d07ed5a4e2c74b7ec7585e3e980109b2a2ed73"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060run_with_saved\u0060 turns every \u0060Err\u0060 into \u00602\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/critique_storage.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1871bb7be1742211d2dfeb00f1fbbf3d98e40af6cba21c3d684ab45d0ea642e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060record_generated\u0060 turns every \u0060Err\u0060 into \u0060Ok(vec![])\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/serve_question.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a286ed44d4ec957bc67abf649615aa6166ca39265849c0d223d265d4c3ebabd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060js_json_stringify\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/staleness.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd5e18a085fced3f3029b1be69ebf35aeead5f3f935a873d034320217a159c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_pretty\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"847d5534ef22e04ff5dfa6dd9c96639825ec99ad4c68637c3dc4162b85f8afc2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_compact\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad8af8996788ab06440c203836cc3a2703c0040958aee6d1f99c28855805023"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060homedir\u0060 turns every \u0060Err\u0060 into \u0060\u0022C:\\\\\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/context/src/util.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"06684932b6c2401aed69427a14df39fcced69cb2024da106e1589812e22df4e9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060check_hard_offset_shadow\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/checks/hard_offset_shadow.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dabf333de61ae389ff8d7c03428bf3f4f6e57adb055ef5d13fd8108a72088a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format_findings\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/cli.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c79860feb4b318bbbeb3559d5dae9eab7a8176f171bc05efa70a9a2a6b9dae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format_list_rules_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/detect/src/list_rules.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966ddf7460a2d7bb563fd6188cb2a96e890c77e635e32d96339136c4e7fe129"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060shell_here_doc_content\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/before_edit.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a946599bfc8d9ef0fc1ad63da702e50cb8b969fdea6c7684e41979ebf79875b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060recorded_roots\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hook/src/hook_sessions.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c991083ae99bdc1601e01adfa5c05d817fa70bbffbf7d9a05d2aff5c770aba1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060query_selector_all\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/dom.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f349d167a754be51e54bd73909605609247339137d610124babaca4b0e49645d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060query_selector_all\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/html/src/dom.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f46e651538c5672d63d19d529c2e6bbdf39cb554e880274b2717f73e04e4410"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_buffer\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/pending_edits.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d777b478f30998a2ab5fc48293c08733be091fffc6b5f6e0c31b5781bf54e5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_declared_params\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/svelte_component.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba203bcadd0b33f1d2681c280ed48808a304ab102f92589444fb06f2d9bcb16a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_pretty\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/util.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd948b840d308a80b82659693cd7435e3a2bc82a41613e4493ef65ebcb98909"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_browser_findings\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022groups\\\u0022:[],\\\u0022pageLevel\\\u0022:[]}\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf508517627c1ce2ae602881e7325ce12cf925849581b825d76db4ecb7afa602"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060antipatterns_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/lib.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a4a80d79cbd4ff393e9b8b7056ce7afaa0fd901504a8c0d64cde479b5b8da"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060collect_findings_from_snapshot\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022groups\\\u0022:[],\\\u0022pageLevel\\\u0022:[]}\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/dom_source.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1e97eb51be322ed63cbcb7558fa11f4e253bcce1612957d8a4aa8d23e2d83e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060findings_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_detect.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"703acd09f91b878f1004a15271afd80ec31154850cd34c4678f328a6f651d158"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060immediate_tier_rules_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022[]\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_detect.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeff5ec97ae75cc842a1eae14eb71ce1f26ed7c5edbc66c242e4a5922da91d78"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060measure_hidden_text\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022totalChars\\\u0022:0,\\\u0022hiddenChars\\\u0022:0,\\\u0022hiddenSamples\\\u0022:[]}\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_driver.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c8eb2a5d300b56c9801b5e9beaf2200e72e8d336ea8129d5a974b475d2f8e1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060vc_img_loaded_source_point\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_visual.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"951459137d79c5b3bd7d25cd8163e4afb112fad71b2ae45bc92bd6e798883298"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060vc_raster_pixel\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/wasm/src/exports_visual.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca4092766dd3104e9e5b13924795bb31a3dbb04d2ff50c5a04f152932487e11"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060__snapStyleRuleAppliesToLiveMatches\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61b55dde14ccd81544040738f58f2c57d40ba04ceec13e333e9492e296f1e4a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060__snapAnimationNamesDeclaredByRule\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c5025148a5a154abbe75800359c403f6355b12a349031fbe48818284c9a5d9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060__snapLinkedStylesheetText\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"browser-bundle/15-snapshot.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a516de8aa07fd833bc84a987e68993cbeb6685e124db4c484a802be1174602"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060__snapStyleRuleAppliesToLiveMatches\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/assets/detect-antipatterns-browser.js"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4132fd2577a88a5f082088d444b49c052108b0a1b089026332b9decc7788dcd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060__snapConditionalCssRuleIsActive\u0060 swallows every exception into \u0060return true\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/assets/detect-antipatterns-browser.js"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdb5f49e63e1ca2b9cee0ff8278ee9bea7e7ec5664413e45e74e68250039aa9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060__snapAnimationNamesDeclaredByRule\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/assets/detect-antipatterns-browser.js"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f3d6797ad7c91401778e8383ac26b515cef84cffbfa6d5455ad65909af4aa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060__snapLinkedStylesheetText\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/assets/detect-antipatterns-browser.js"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"7657ff4d113ede2068482e447a573ab9cf5114ddb4269bc285ed60fa79a03933"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadSvelteComponentParams\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cursor-plugin/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf431a2c2802ccd4b1ec8ab846ad66fd3674287a2e209e60cd70201e3e56eed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060detectPageTheme\u0060 swallows every exception into \u0060return \u0027light\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cursor-plugin/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10676}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3ae299696236efbcabaa59682a88feef9d767803f83305f33b4c2826162986"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadSvelteComponentParams\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":5595}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c37dc08149235c6014fc00a796cabf1525da4de67d53c00ca474ae30c6517a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060detectPageTheme\u0060 swallows every exception into \u0060return \u0027light\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"plugin/skills/impeccable/scripts/live-browser.js"},"region":{"startLine":10676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31145f877ae75e9f2333d717c236b51bee3288543bcfef72611eaf9c1563ce5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readMaybe\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/smoke-provider-hooks.mjs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"5822ce2ab1ac812408c490de8cdc507afc78618e232f323662fb1304f7835ae9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadSvelteComponentParams\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":5595}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8df90a0fa17de7bb96f9dcb0904168b436e28b66ea704451e5f1ec162eb82ed"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060detectPageTheme\u0060 swallows every exception into \u0060return \u0027light\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skill/scripts/live-browser.js"},"region":{"startLine":10676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8d5c0c7e6961e34c6a0eef97dad1c5eff75b4846853f1b45dfbefffd74ef2f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060getSupabaseOrigin\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/framework-fixtures/nextjs-turborepo/files/packages/shared/src/security/origins.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff743954be2c8eef130f18da72abc5a9456f1fa4277f09670d477bd3eb6f627"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060parseManualEditResponse.previewParsed\u0060 swallows every exception into \u0060return \u0027[unstringifiable]\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/agents/llm-agent.mjs"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a334a3035c5366dfe19a87bad3d9072956063dc3e7b9959aa23312fb463649"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060dispatchBarButton\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/live-e2e/ui.mjs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20c3af4fcaba5140d066b42a6526824c195ab62f227e376b8cc2dbec3353104"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060stateLastBeat\u0060 swallows every exception into \u0060return 0\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/new-work-e2e/user-bot.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"634c2d8fbedc80081df7eb88184dd2c1895061e12ea0285fe6f6c9c471c266bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeRead\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/oracle/lib.mjs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e0808ca86bd49e7cc597df907966abcaeb256b502dea70e4c808f98c39324a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060kind.contains(\u0022context_text_match\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060kind.contains(\u0022context_text_match\u0022)\u0060 also satisfies \u0060kind.contains(\u0022text_match\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/live/src/manual_edits/commit.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"447242b11b92c790de4f6721956d6f54e6a2e3f15551c5fe1252fc42d2c55c76"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060w.ends_with(\u0022rem\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060w.ends_with(\u0022rem\u0022)\u0060 also satisfies \u0060w.ends_with(\u0022em\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/browser/element_checks.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d98981f4948734312a9c0d6cbb84628d64e39a2cf2bc6afdf9862cfce9f25a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060err.contains(\u0022covers 100% of the comp\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060err.contains(\u0022covers 100% of the comp\u0022)\u0060 also satisfies \u0060err.contains(\u0022% of the comp\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/comp-verbs/tests/parity.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0e569337b02b64861b5c6b9d541c477275184c77ad19419df178c24470b980"}}],"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-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.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-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-88","guid":"32dec161-013d-ac58-8599-1309e12e67f5","name":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/88.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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-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":34,"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."]}]}